Pagini recente » Borderou de evaluare (job #1872233) | Borderou de evaluare (job #562842) | Borderou de evaluare (job #1915949) | Borderou de evaluare (job #1837709) | Borderou de evaluare (job #986277)
Borderou de evaluare (job #986277)
Raport evaluator
Compilare:
user.cpp: In function ‘void DFS(const int&)’:
user.cpp:18:22: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
l2[s + 1] = l2[s + 1 >> 1] + 1;
^
user.cpp:24:26: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
l2[s + 1] = l2[s + 1 >> 1] + 1;
^
user.cpp: In function ‘void RMQ_build()’:
user.cpp:39:47: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses]
for (l = s - (1 << i) + 1, d = 1 << i - 1, j = 1; j <= l; ++j)
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 12ms | 4656kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
| 2 | 8ms | 4652kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
| 3 | 96ms | 4748kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
| 4 | 96ms | 4752kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
| 5 | 140ms | 9176kb | oho! ai bifat solutia ;) | 10 |
| 6 | 144ms | 9180kb | oho! ai bifat solutia ;) | 10 |
| 7 | 140ms | 9180kb | oho! ai bifat solutia ;) | 10 |
| 8 | 396ms | 9180kb | oho! ai bifat solutia ;) | 10 |
| 9 | 404ms | 9284kb | oho! ai bifat solutia ;) | 10 |
| 10 | 224ms | 9176kb | oho! ai bifat solutia ;) | 10 |
| Punctaj total | 100 |
Aiordachioaei Marius Flameingo