Pagini recente » Borderou de evaluare (job #2003237) | Borderou de evaluare (job #2450857) | Borderou de evaluare (job #2914466) | Borderou de evaluare (job #2298972) | Borderou de evaluare (job #1490640)
Borderou de evaluare (job #1490640)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:156:114: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if (in[index].conexComponent == out[index].conexComponent && addedNodesFromComp[in[index].conexComponent] == 2 && index < in.size() - 1 || (addedNodesFromComp[in[index].conexComponent] == 1 && index < in.size() - 1 && addedNodesFromComp[in[index + 1].conexComponent] > 1)) {
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 1180kb | Esti baza | 10 | 30 |
2 | 8ms | 1312kb | Esti baza | 10 |
3 | 8ms | 1444kb | Esti baza | 10 |
4 | 20ms | 1836kb | Solutia nu e minim lexicografica | 7 | 0 |
5 | Depăşit | 2512kb | Time limit exceeded. | 0 |
6 | 72ms | 3192kb | Solutia nu e minim lexicografica | 7 |
7 | 100ms | 4060kb | Solutia nu e minim lexicografica | 7 |
8 | 112ms | 4376kb | Solutia nu e minim lexicografica | 7 |
9 | 132ms | 4836kb | Solutia nu e minim lexicografica | 7 |
10 | 144ms | 5248kb | Solutia nu e minim lexicografica | 7 |
Punctaj total | 30 |