Pagini recente » Borderou de evaluare (job #474495) | Borderou de evaluare (job #3176114) | Borderou de evaluare (job #677551) | Borderou de evaluare (job #2979690) | Borderou de evaluare (job #1295003)
Borderou de evaluare (job #1295003)
Raport evaluator
Compilare:
user.cpp: In function ‘void DFS(int)’:
user.cpp:16:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < G[Node].size(); ++ i)
^
user.cpp: In function ‘int main()’:
user.cpp:72:35: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("atac.in", "r", stdin);
^
user.cpp:73:37: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("atac.out", "w", stdout);
^
user.cpp:75:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%i %i %i", &N, &M, &P);
^
user.cpp:78:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%i %i", &U, &V);
^
user.cpp:82:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%i %i %i %i %i %i", &X, &Y, &A, &B, &C, &D);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 720kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
2 | 0ms | 720kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
3 | 148ms | 844kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
4 | 152ms | 848kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
5 | 160ms | 5428kb | oho! ai bifat solutia ;) | 10 |
6 | 164ms | 5432kb | oho! ai bifat solutia ;) | 10 |
7 | 164ms | 5428kb | oho! ai bifat solutia ;) | 10 |
8 | 504ms | 5436kb | oho! ai bifat solutia ;) | 10 |
9 | 540ms | 5444kb | oho! ai bifat solutia ;) | 10 |
10 | 200ms | 5332kb | oho! ai bifat solutia ;) | 10 |
Punctaj total | 100 |