Pagini recente » Borderou de evaluare (job #811445) | Borderou de evaluare (job #1246108) | Borderou de evaluare (job #1256921) | Borderou de evaluare (job #2501729) | Borderou de evaluare (job #1576371)
Borderou de evaluare (job #1576371)
Raport evaluator
Compilare:
user.cpp: In function ‘void dfs(int)’:
user.cpp:61:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < list[node].size(); i++) {
^
user.cpp:78:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i = 0; i < list[node].size() ; i++) {
^
user.cpp: In function ‘int main()’:
user.cpp:92:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("arbore4.in", "r", stdin);
^
user.cpp:93:40: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("arbore4.out", "w", stdout);
^
user.cpp:96:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
user.cpp:98:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &x, &y);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 116ms | 3192kb | OK | 5 |
2 | 116ms | 3192kb | OK | 5 |
3 | 116ms | 3192kb | OK | 5 |
4 | 116ms | 3192kb | OK | 5 |
5 | 116ms | 3192kb | OK | 5 |
6 | 116ms | 3208kb | OK | 5 |
7 | 116ms | 3208kb | OK | 5 |
8 | 116ms | 3220kb | OK | 5 |
9 | 116ms | 3216kb | OK | 5 |
10 | 116ms | 3228kb | OK | 5 |
11 | 116ms | 3240kb | OK | 5 |
12 | 120ms | 3248kb | OK | 5 |
13 | 120ms | 3256kb | OK | 5 |
14 | 120ms | 3268kb | OK | 5 |
15 | 204ms | 6120kb | OK | 5 |
16 | 208ms | 6300kb | OK | 5 |
17 | 216ms | 6480kb | OK | 5 |
18 | 220ms | 6664kb | OK | 5 |
19 | 228ms | 6840kb | OK | 5 |
20 | 228ms | 6840kb | OK | 5 |
Punctaj total | 100 |