Pagini recente » Borderou de evaluare (job #2351442) | Borderou de evaluare (job #3270506) | Borderou de evaluare (job #535135) | Borderou de evaluare (job #740209) | Borderou de evaluare (job #2265486)
Borderou de evaluare (job #2265486)
Raport evaluator
Compilare:
main.cpp: In function 'void solve()':
main.cpp:53:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(i=1; i<=n; ++i) cout << l[i] - 1 << ' '; cout << '\n';
^~~
main.cpp:53:50: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for'
for(i=1; i<=n; ++i) cout << l[i] - 1 << ' '; cout << '\n';
^~~~
main.cpp:54:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(i=1; i<=n; ++i) cout << r[i] - 1 << ' '; cout << '\n';
^~~
main.cpp:54:50: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for'
for(i=1; i<=n; ++i) cout << r[i] - 1 << ' '; cout << '\n';
^~~~
main.cpp:52:35: warning: 'root' may be used uninitialized in this function [-Wmaybe-uninitialized]
cout << "1 \n" << root - 1 << " \n";
^~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 23ms | 131kb | Correct! (at most 10000 Query calls) | 10 | 40 |
2 | 23ms | 131kb | Correct! (at most 10000 Query calls) | 10 |
3 | 21ms | 131kb | Correct! (at most 10000 Query calls) | 10 |
4 | 23ms | 131kb | Correct! (at most 10000 Query calls) | 10 |
5 | 213ms | 200kb | Correct! (at most 20000 Query calls) | 5 | 20 |
6 | 214ms | 131kb | Correct! (at most 20000 Query calls) | 5 |
7 | 135ms | 176kb | Correct! (at most 20000 Query calls) | 5 |
8 | 211ms | 131kb | Correct! (at most 20000 Query calls) | 5 |
9 | 218ms | 131kb | Correct! (at most 2000 Query calls) | 10 | 40 |
10 | 214ms | 131kb | Correct! (at most 2000 Query calls) | 10 |
11 | 214ms | 131kb | Correct! (at most 2000 Query calls) | 10 |
12 | 211ms | 131kb | Correct! (at most 2000 Query calls) | 10 |
Punctaj total | 100 |