Pagini recente » Borderou de evaluare (job #2629140) | Borderou de evaluare (job #3114109) | Borderou de evaluare (job #1784091) | Borderou de evaluare (job #2126607) | Borderou de evaluare (job #1453750)
Borderou de evaluare (job #1453750)
Raport evaluator
Compilare:
user.cpp: In function ‘void DFS(int, int)’:
user.cpp:43:36: 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:79:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("ct.in" ,"r", stdin );
^
user.cpp:80:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("ct.out","w", stdout);
^
user.cpp:82:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &T);
^
user.cpp:96:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &N, &Q);
^
user.cpp:99:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &X, &Y);
^
user.cpp:110:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &X, &Y);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 48ms | 22980kb | Incorect | 0 |
2 | 112ms | 23700kb | Incorect | 0 |
3 | 192ms | 24420kb | Incorect | 0 |
4 | 372ms | 27040kb | Incorect | 0 |
5 | 256ms | 27076kb | Killed by signal 11(SIGSEGV). | 0 |
6 | 120ms | 25380kb | Killed by signal 11(SIGSEGV). | 0 |
7 | 52ms | 22960kb | Incorect | 0 |
8 | 264ms | 25060kb | Incorect | 0 |
9 | Depăşit | 26596kb | Time limit exceeded. | 0 |
10 | 44ms | 22944kb | Incorect | 0 |
Punctaj total | 0 |