Pagini recente » Borderou de evaluare (job #44975) | Borderou de evaluare (job #1806388) | Borderou de evaluare (job #2967755) | Borderou de evaluare (job #1690389) | Borderou de evaluare (job #1800264)
Borderou de evaluare (job #1800264)
Raport evaluator
Compilare:
user.cpp: In constructor ‘LPSolver::LPSolver(const VVD&, const VD&, const VD&)’:
user.cpp:15:11: warning: ‘LPSolver::N’ will be initialized after [-Wreorder]
VI B, N;
^
user.cpp:15:8: warning: ‘VI LPSolver::B’ [-Wreorder]
VI B, N;
^
user.cpp:18:5: warning: when initialized here [-Wreorder]
LPSolver(const VVD &A, const VD &b, const VD &c) :
^
user.cpp: In member function ‘bool LPSolver::Simplex(int)’:
user.cpp:43:72: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if (s == -1 || D[x][j] < D[x][s] || D[x][j] == D[x][s] && N[j] < N[s]) s = j;
^
user.cpp:50:72: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
(D[i][n + 1] / D[i][s]) == (D[r][n + 1] / D[r][s]) && B[i] < B[r]) r = i;
^
user.cpp: In member function ‘double LPSolver::Solve(VD&)’:
user.cpp:66:80: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if (s == -1 || D[i][j] < D[i][s] || D[i][j] == D[i][s] && N[j] < N[s]) s = j;
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 452kb | OK | 10 | 10 |
2 | 0ms | 548kb | OK | 10 | 10 |
3 | 12ms | 784kb | OK | 10 | 10 |
4 | 36ms | 1048kb | OK | 10 | 10 |
5 | Depăşit | 1576kb | Time limit exceeded. | 0 | 0 |
6 | Depăşit | 3152kb | Time limit exceeded. | 0 | 0 |
7 | 20ms | Depăşit | Memory limit exceeded. | 0 | 0 |
8 | 20ms | Depăşit | Memory limit exceeded. | 0 | 0 |
9 | 20ms | Depăşit | Memory limit exceeded. | 0 |
10 | 20ms | Depăşit | Memory limit exceeded. | 0 |
Punctaj total | 40 |