Borderou de evaluare (job #2239030)

Utilizator AndreiVisoiuAndrei Visoiu AndreiVisoiu Data 8 septembrie 2018 17:42:44
Problema Robot2 Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 2

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:48:37: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] freopen("robot2.in", "r", stdin); ^ user.cpp:49:39: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] freopen("robot2.out", "w", stdout); ^ user.cpp:51:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%i", &N); ^ user.cpp:54:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%hi", &A[i][j]); ^ user.cpp:61:57: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%hi %hi %hi %hi", &L[1], &C[1], &L[2], &C[2]); ^ user.cpp:62:30: warning: array subscript is above array bounds [-Warray-bounds] lee(L[1], C[1], L[2], C[2], P); ~~~^ user.cpp:62:24: warning: array subscript is above array bounds [-Warray-bounds] lee(L[1], C[1], L[2], C[2], P); ~~~^ user.cpp:63:24: warning: array subscript is above array bounds [-Warray-bounds] printf("%i ", P[L[2]][C[2]]-1); ~~~^ user.cpp:63:30: warning: array subscript is above array bounds [-Warray-bounds] printf("%i ", P[L[2]][C[2]]-1); ~~~^
Test Timp executie Memorie folosita Mesaj Punctaj/test
18ms2804kbb) si c) lipsa!2
28ms3188kbb) si c) lipsa!0
312ms3680kbb) si c) lipsa!0
436ms5644kbb) si c) lipsa!0
536ms5644kbb) si c) lipsa!0
684ms8164kbb) si c) lipsa!0
784ms7924kbb) si c) lipsa!0
8272ms16304kbWall time limit exceeded.0
9188ms11476kbb) si c) lipsa!0
1076ms7600kbb) si c) lipsa!0
Punctaj total2

Ceva nu functioneaza?