Pagini recente » Borderou de evaluare (job #1618574) | Borderou de evaluare (job #1416301) | Cod sursa (job #488596) | Borderou de evaluare (job #155559) | Borderou de evaluare (job #1405524)
Borderou de evaluare (job #1405524)
Raport evaluator
Compilare:
user.cpp: In function ‘void dijkstra(std::vector<Edge>*, int*, int*, int*, int, int, int (*)[100001])’:
user.cpp:171:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < adjList[x].size(); i++)
^
user.cpp: In function ‘int main()’:
user.cpp:83:42: warning: ‘minIndex’ may be used uninitialized in this function [-Wmaybe-uninitialized]
printPath(minIndex, parentsABC, 2, g);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
| 1 | 136ms | Depăşit | Memory limit exceeded. | 0 | 0 |
| 11 | 140ms | Depăşit | Memory limit exceeded. | 0 |
| 2 | 0ms | 424kb | Drumurile afisate trebuie sa se termine cu A, B sau C | 0 | 0 |
| 12 | 0ms | 424kb | Drumurile afisate trebuie sa se termine cu A, B sau C | 0 |
| 3 | 140ms | Depăşit | Memory limit exceeded. | 0 | 0 |
| 13 | 156ms | Depăşit | Memory limit exceeded. | 0 |
| 4 | 144ms | Depăşit | Memory limit exceeded. | 0 | 0 |
| 14 | 148ms | Depăşit | Memory limit exceeded. | 0 |
| 5 | 144ms | Depăşit | Memory limit exceeded. | 0 | 0 |
| 15 | 148ms | Depăşit | Memory limit exceeded. | 0 |
| 6 | 800ms | 10820kb | Drumurile afisate trebuie sa se termine cu A, B sau C | 0 | 0 |
| 16 | 140ms | Depăşit | Memory limit exceeded. | 0 |
| 7 | 804ms | Depăşit | Memory limit exceeded. | 0 | 0 |
| 17 | 140ms | Depăşit | Memory limit exceeded. | 0 |
| 8 | 704ms | Depăşit | Memory limit exceeded. | 0 | 0 |
| 18 | 484ms | Depăşit | Memory limit exceeded. | 0 |
| 9 | 772ms | 10336kb | Drumurile afisate trebuie sa se termine cu A, B sau C | 0 | 0 |
| 19 | 440ms | Depăşit | Memory limit exceeded. | 0 |
| 10 | 892ms | Depăşit | Memory limit exceeded. | 0 | 0 |
| 20 | 460ms | Depăşit | Memory limit exceeded. | 0 |
| Punctaj total | 0 |