Pagini recente » Borderou de evaluare (job #2084040) | Borderou de evaluare (job #2761241) | Borderou de evaluare (job #688176) | Borderou de evaluare (job #70131) | Borderou de evaluare (job #1531847)
Borderou de evaluare (job #1531847)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:32:67: warning: array subscript is above array bounds [-Warray-bounds]
if(j >= 0 && j <= 49999 && locuri[j][1] == 0)
^
user.cpp:40:63: warning: array subscript is above array bounds [-Warray-bounds]
if(j >= 0 && j <= 49999 && locuri[j][1] == 0)
^
user.cpp:41:41: warning: array subscript is above array bounds [-Warray-bounds]
{locuri[j][1] = 1; out << 2 * j + 2 << "\n";}
^
user.cpp:51:84: warning: array subscript is above array bounds [-Warray-bounds]
if(j >= 0 && j <= 49999 && locuri[j][0] == 0 && locuri[j][1] == 0)
^
user.cpp:57:32: warning: array subscript is above array bounds [-Warray-bounds]
locuri[j][1] = 1;
^
user.cpp:70:60: warning: array subscript is above array bounds [-Warray-bounds]
if(locuri[j][0] == 0 && locuri[j][1] == 0){
^
user.cpp:72:59: warning: array subscript is above array bounds [-Warray-bounds]
locuri[j][0] = locuri[j][1] = locuri[j - 1][0] = 1;
^
user.cpp:77:60: warning: array subscript is above array bounds [-Warray-bounds]
if(j > 0 && locuri[j - 1][1] == 0){
^
user.cpp:78:82: warning: array subscript is above array bounds [-Warray-bounds]
locuri[j][0] = locuri[j][1] = locuri[j - 1][1] = 1;
^
user.cpp:78:63: warning: array subscript is above array bounds [-Warray-bounds]
locuri[j][0] = locuri[j][1] = locuri[j - 1][1] = 1;
^
user.cpp:84:67: warning: array subscript is above array bounds [-Warray-bounds]
locuri[j][0] = locuri[j][1] = locuri[j + 1][0] = 1;
^
user.cpp:89:72: warning: array subscript is above array bounds [-Warray-bounds]
if(j < 49999 && locuri[j + 1][1] == 0){
^
user.cpp:90:90: warning: array subscript is above array bounds [-Warray-bounds]
locuri[j][0] = locuri[j][1] = locuri[j + 1][1] = 1;
^
user.cpp:90:71: warning: array subscript is above array bounds [-Warray-bounds]
locuri[j][0] = locuri[j][1] = locuri[j + 1][1] = 1;
^
 | Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
✓ | 1 | 0ms | 444kb | Incorect | 0 |
✓ | 2 | 0ms | 472kb | Incorect | 0 |
✓ | 3 | 8ms | 532kb | Incorect | 0 |
✓ | 4 | 16ms | 600kb | Incorect | 0 |
✓ | 5 | Depăşit | 604kb | Time limit exceeded. | 0 |
✓ | 6 | Depăşit | 608kb | Time limit exceeded. | 0 |
✓ | 7 | Depăşit | 600kb | Time limit exceeded. | 0 |
✓ | 8 | Depăşit | 608kb | Time limit exceeded. | 0 |
✓ | 9 | Depăşit | 604kb | Time limit exceeded. | 0 |
✓ | 10 | Depăşit | 604kb | Time limit exceeded. | 0 |
Punctaj total | 0 |