Pagini recente » Borderou de evaluare (job #1107024) | Borderou de evaluare (job #1322129) | Borderou de evaluare (job #985718) | Borderou de evaluare (job #2307790) | Borderou de evaluare (job #1720324)
Borderou de evaluare (job #1720324)
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:61: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:62: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:64: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:66: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:72: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 | 828kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
3 | 144ms | 988kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
4 | 148ms | 988kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
5 | 212ms | 6644kb | oho! ai bifat solutia ;) | 10 |
6 | 220ms | 6644kb | oho! ai bifat solutia ;) | 10 |
7 | 216ms | 6648kb | oho! ai bifat solutia ;) | 10 |
8 | 784ms | 6652kb | oho! ai bifat solutia ;) | 10 |
9 | 784ms | 6668kb | oho! ai bifat solutia ;) | 10 |
10 | 564ms | 6588kb | oho! ai bifat solutia ;) | 10 |
Punctaj total | 100 |