Mai intai trebuie sa te autentifici.
Borderou de evaluare (job #2368915)
| Utilizator |  Zediu Almos-Agoston YediuTe |
Data | 5 martie 2019 19:25:51 |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Status | done |
| Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
| Scor | 20 | ||
Raport evaluator
Compilare:
main.cpp: In function 'void shortestPath(int, int)':
main.cpp:33:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < graph[currentNode].size(); i++){
~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| Test | Timp executie | Memorie folosita | Mesaj | Punctaj/test |
|---|---|---|---|---|
| 1 | 4ms | 1572kb | Incorect | 0 |
| 2 | 5ms | 1572kb | OK | 10 |
| 3 | 7ms | 1572kb | Incorect | 0 |
| 4 | 9ms | 1572kb | Incorect | 0 |
| 5 | 41ms | 2490kb | Incorect | 0 |
| 6 | 79ms | 3145kb | Incorect | 0 |
| 7 | 97ms | 3801kb | Incorect | 0 |
| 8 | 252ms | 7057kb | Incorect | 0 |
| 9 | 148ms | 4456kb | OK | 10 |
| 10 | 402ms | 9699kb | Time limit exceeded | 0 |
| Punctaj total | 20 | |||
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
