Pagini recente » Borderou de evaluare (job #687991) | Borderou de evaluare (job #2068691) | hanoi2 | Borderou de evaluare (job #1710410) | Borderou de evaluare (job #2664400)
Borderou de evaluare (job #2664400)
Raport evaluator
Compilare:
main.cpp: In function 'void dfs(int, int)':
main.cpp:19:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<vecini[nod].size(); i++)
~^~~~~~~~~~~~~~~~~~~
main.cpp: In function 'void dfs_(int, int)':
main.cpp:30:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<vecini[nod].size(); i++)
~^~~~~~~~~~~~~~~~~~~
main.cpp: In function 'void rangemq(int)':
main.cpp:50:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<inaltime[nivel].size(); i++)
~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:83:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0; j<vecini[i].size(); j++)
~^~~~~~~~~~~~~~~~~
main.cpp:93:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0; j<vecini[i].size(); j++)
~^~~~~~~~~~~~~~~~~
main.cpp:102:39: warning: iteration 100003 invokes undefined behavior [-Waggressive-loop-optimizations]
for(int i=2; i<=100005; i++) lg[i]=lg[i/2]+1;
~~~~~^~~~~~~~~~
main.cpp:102:19: note: within this loop
for(int i=2; i<=100005; i++) lg[i]=lg[i/2]+1;
~^~~~~~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 34ms | 10354kb | OK | 10 |
| 2 | 25ms | 10354kb | OK | 10 |
| 3 | 34ms | 10403kb | OK | 10 |
| 4 | 32ms | 10354kb | Incorect | 0 |
| 5 | 73ms | 13631kb | OK | 10 |
| 6 | 260ms | 28573kb | OK | 10 |
| 7 | 441ms | 38404kb | OK | 10 |
| 8 | 794ms | 60555kb | OK | 10 |
| 9 | 800ms | 63688kb | Time limit exceeded | 0 |
| 10 | 441ms | 65552kb | Memory limit exceeded | 0 |
| Punctaj total | 70 |