Pagini recente » Borderou de evaluare (job #662719) | Borderou de evaluare (job #3177810) | Borderou de evaluare (job #2143119) | Borderou de evaluare (job #2620655) | Borderou de evaluare (job #1772991)
Borderou de evaluare (job #1772991)
Raport evaluator
Compilare:
user.cpp: In function ‘void DFS(int)’:
user.cpp:73:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < G[x].size(); ++ i)
^
user.cpp: In function ‘int LCA(int, int)’:
user.cpp:86:12: warning: unused variable ‘j’ [-Wunused-variable]
int i, j, z = INF;
^
user.cpp: In function ‘void solution()’:
user.cpp:115:30: warning: unused variable ‘lca’ [-Wunused-variable]
int x, y, z, A, B, C, D, lca, i;
^
user.cpp: In function ‘void read()’:
user.cpp:43:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &n, &m, &p);
^
user.cpp:46:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &x, &c);
^
user.cpp: In function ‘void solution()’:
user.cpp:122:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d %d %d %d", &x, &y, &A, &B, &C, &D);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 988kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
| 2 | 0ms | 984kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
| 3 | 120ms | 1096kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
| 4 | 120ms | 1100kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
| 5 | 144ms | 5884kb | oho! ai bifat solutia ;) | 10 |
| 6 | 148ms | 5876kb | oho! ai bifat solutia ;) | 10 |
| 7 | 148ms | 5876kb | oho! ai bifat solutia ;) | 10 |
| 8 | 480ms | 5884kb | oho! ai bifat solutia ;) | 10 |
| 9 | 476ms | 5968kb | oho! ai bifat solutia ;) | 10 |
| 10 | 168ms | 5840kb | oho! ai bifat solutia ;) | 10 |
| Punctaj total | 100 |