Pagini recente » Borderou de evaluare (job #1374102) | Borderou de evaluare (job #2950009) | Borderou de evaluare (job #531915) | Borderou de evaluare (job #2356144) | Borderou de evaluare (job #1720323)
Borderou de evaluare (job #1720323)
Raport evaluator
Compilare:
user.cpp: In function ‘void DFS(int)’:
user.cpp:12:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<g[node].size();i++)
^
user.cpp: In function ‘int main()’:
user.cpp:58:33: 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:59:35: 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:61:29: 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:63:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
user.cpp:69:44: 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 | 828kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
2 | 0ms | 836kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
3 | 148ms | 984kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
4 | 148ms | 984kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
5 | 228ms | 6652kb | oho! ai bifat solutia ;) | 10 |
6 | 232ms | 6648kb | oho! ai bifat solutia ;) | 10 |
7 | 228ms | 6644kb | oho! ai bifat solutia ;) | 10 |
8 | Depăşit | 6648kb | Time limit exceeded. | 0 |
9 | Depăşit | 6648kb | Time limit exceeded. | 0 |
10 | 596ms | 6588kb | oho! ai bifat solutia ;) | 10 |
Punctaj total | 80 |