Borderou de evaluare (job #2717103)

Utilizator lflorin29Florin Laiu lflorin29 Data 6 martie 2021 13:39:02
Problema Ciclu hamiltonian de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In constructor 'LPSolver::LPSolver(const std::vector<std::vector<double> >&, const std::vector<double>&, const std::vector<double>&)': main.cpp:16:11: warning: 'LPSolver::N' will be initialized after [-Wreorder] VI B, N; ^ main.cpp:16:8: warning: 'std::vector<int> LPSolver::B' [-Wreorder] VI B, N; ^ main.cpp:20:5: warning: when initialized here [-Wreorder] LPSolver(const VVD &A, const VD &b, const VD &c): ^~~~~~~~ main.cpp: In member function 'bool LPSolver::Simplex(int)': main.cpp:69: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]) main.cpp:80:76: warning: suggest parentheses around '&&' within '||' [-Wparentheses] (D[i][n + 1] / D[i][s]) == (D[r][n + 1] / D[r][s]) && B[i] < B[r]) main.cpp: In member function 'double LPSolver::Solve(std::vector<double>&)': main.cpp:105: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]) main.cpp: In lambda function: main.cpp:210:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < A.size(); ++i) ~~^~~~~~~~~~ main.cpp:189:13: warning: unused variable 'i' [-Wunused-variable] int i = 0; ^ main.cpp: In function 'int main()': main.cpp:229:15: warning: unused variable 'ans' [-Wunused-variable] long long ans = -1; ^~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms131kbIncorect0
22ms131kbIncorect0
3751ms6946kbTime limit exceeded0
43ms262kbIncorect0
5752ms6553kbTime limit exceeded0
6752ms5898kbTime limit exceeded0
7751ms4849kbTime limit exceeded0
8752ms5111kbTime limit exceeded0
95ms262kbIncorect0
10751ms4325kbTime limit exceeded0
11751ms4456kbTime limit exceeded0
125ms262kbIncorect0
13752ms5242kbTime limit exceeded0
149ms393kbIncorect0
15752ms4849kbTime limit exceeded0
16751ms4849kbTime limit exceeded0
17751ms5214kbTime limit exceeded0
1860ms786kbIncorect0
19751ms3932kbTime limit exceeded0
20752ms3801kbTime limit exceeded0
Punctaj total0

Ceva nu functioneaza?