Borderou de evaluare (job #1800264)

Utilizator bciobanuBogdan Ciobanu bciobanu Data 7 noiembrie 2016 17:03:25
Problema Flux maxim Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 40

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
10ms452kbOK1010
20ms548kbOK1010
312ms784kbOK1010
436ms1048kbOK1010
5Depăşit1576kbTime limit exceeded.00
6Depăşit3152kbTime limit exceeded.00
720msDepăşitMemory limit exceeded.00
820msDepăşitMemory limit exceeded.00
920msDepăşitMemory limit exceeded.0
1020msDepăşitMemory limit exceeded.0
Punctaj total40

Ceva nu functioneaza?