Pagini recente » Borderou de evaluare (job #122070) | Borderou de evaluare (job #1389921) | Cod sursa (job #2985607) | Borderou de evaluare (job #2007660) | Borderou de evaluare (job #2832584)
Borderou de evaluare (job #2832584)
Raport evaluator
Compilare:
main.cpp: In function 'void dijkstra(int)':
main.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<muchie>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
31 | for (int i = 0; i < lista_vecini[nod].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:41:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
41 | for (int i = 1; i < Q.size(); i++) //determin index varf din Q cu dist minima cf wikipedia https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
| ~~^~~~~~~~~~
main.cpp:47:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<muchie>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
47 | for (int i = 0; i < lista_vecini[nodnou].size(); i++) // pt fiecare vecin v al noului u ramas in Q
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 184kb | OK | 10 |
2 | 2ms | 184kb | OK | 10 |
3 | 6ms | 1486kb | OK | 10 |
4 | 6ms | 1388kb | OK | 10 |
5 | 228ms | 2068kb | OK | 10 |
6 | 547ms | 2600kb | OK | 10 |
7 | 1001ms | 2834kb | Time limit exceeded | 0 |
8 | 1000ms | 4653kb | Time limit exceeded | 0 |
9 | 1001ms | 4059kb | Time limit exceeded | 0 |
10 | 1004ms | 7204kb | Time limit exceeded | 0 |
Punctaj total | 60 |