Pagini recente » Borderou de evaluare (job #496235) | Borderou de evaluare (job #587161) | Borderou de evaluare (job #59928) | Borderou de evaluare (job #1354539) | Borderou de evaluare (job #1392845)
Borderou de evaluare (job #1392845)
Raport evaluator
Compilare:
user.cpp: In function ‘void BFS(int, long long int (&)[100002], int (&)[100002])’:
user.cpp:28:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < v[nod].size(); i++)
^
user.cpp: In function ‘int main()’:
user.cpp:71:23: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
printf("%d\n", Ans);
^
user.cpp:53:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("trilant.in", "r", stdin);
^
user.cpp:54:40: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("trilant.out", "w", stdout);
^
user.cpp:55:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &m);
^
user.cpp:56:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &A, &B, &C);
^
user.cpp:59:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &x, &y, &cost);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 1468kb | Cost prea mare | 0 | 0 |
11 | 0ms | 1468kb | Nu ai afisat drumurile complet | 0 |
2 | 0ms | 1464kb | Cost prea mare | 0 | 0 |
12 | 0ms | 1464kb | Nu ai afisat drumurile complet | 0 |
3 | 16ms | 1560kb | Nu ai afisat drumurile complet | 0 | 0 |
13 | 40ms | 1940kb | Nu ai afisat drumurile complet | 0 |
4 | 12ms | 1564kb | Nu ai afisat drumurile complet | 0 | 0 |
14 | 8ms | 1680kb | Nu ai afisat drumurile complet | 0 |
5 | 100ms | 1632kb | Caractere in plus in fisier | 0 | 0 |
15 | 24ms | 1760kb | Nu ai afisat drumurile complet | 0 |
6 | Depăşit | 10148kb | Time limit exceeded. | 0 | 0 |
16 | 0ms | 1460kb | Nodul comun X trebuie sa fie prezent in toate drumurile pe prima pozitie | 0 |
7 | Depăşit | 8984kb | Time limit exceeded. | 0 | 0 |
17 | 0ms | 1464kb | Cost prea mare | 0 |
8 | Depăşit | 8312kb | Time limit exceeded. | 0 | 0 |
18 | 224ms | 7712kb | Nu ai afisat drumurile complet | 0 |
9 | Depăşit | 9700kb | Time limit exceeded. | 0 | 0 |
19 | 200ms | 7340kb | Nu ai afisat drumurile complet | 0 |
10 | Depăşit | 9848kb | Time limit exceeded. | 0 | 0 |
20 | 208ms | 7364kb | Nu ai afisat drumurile complet | 0 |
Punctaj total | 0 |