Pagini recente » Borderou de evaluare (job #982920) | Borderou de evaluare (job #2651331) | Borderou de evaluare (job #1277201) | Borderou de evaluare (job #920818) | Borderou de evaluare (job #2132586)
Borderou de evaluare (job #2132586)
Raport evaluator
Compilare:
user.cpp: In function ‘void inregistrare(int, int)’:
user.cpp:53:33: warning: narrowing conversion of ‘t’ from ‘int’ to ‘short int’ inside { } [-Wnarrowing]
crc.push_back({p1, p2, t, l});
^
user.cpp: In function ‘void explorare(int, int)’:
user.cpp:81:15: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses]
if((y1 == crc[ap[y1][x1]].cap1.first || y1 == crc[ap[y1][x1]].cap2.first) && (x1 == crc[ap[y1][x1]].cap1.second || x1 == crc[ap[y1][x1]].cap2.second))
^
user.cpp: In function ‘void inregistrare(int, int)’:
user.cpp:49:84: warning: array subscript is above array bounds [-Warray-bounds]
parc = std::pair <int, int> (parc.first + dy[i], parc.second + dx[i]), val[parc.first][parc.second] = -1, ap[parc.first][parc.second] = crc.size(), l++;
^
user.cpp:49:63: warning: array subscript is above array bounds [-Warray-bounds]
parc = std::pair <int, int> (parc.first + dy[i], parc.second + dx[i]), val[parc.first][parc.second] = -1, ap[parc.first][parc.second] = crc.size(), l++;
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 4ms | 7540kb | Ok! | 10 |
2 | 4ms | 11664kb | Numar gresit de circuite. | 0 |
3 | 8ms | 13748kb | Numar gresit de circuite. | 0 |
4 | 8ms | 13708kb | Numar gresit de circuite. | 0 |
5 | 44ms | 34496kb | Numar gresit de circuite. | 0 |
6 | 80ms | 34316kb | Numar gresit de circuite. | 0 |
7 | 28ms | 13784kb | Numar gresit de circuite. | 0 |
8 | 88ms | Depăşit | Memory limit exceeded. | 0 |
9 | 88ms | Depăşit | Memory limit exceeded. | 0 |
10 | 88ms | Depăşit | Memory limit exceeded. | 0 |
Punctaj total | 10 |