Borderou de evaluare (job #3216898)

Utilizator adiadi11Adrian Ariton adiadi11 Data 20 martie 2024 11:44:19
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 20

Raport evaluator

Compilare: main.cpp: In constructor 'EdgeEntry::EdgeEntry()': main.cpp:46:19: warning: 'EdgeEntry::cost' will be initialized after [-Wreorder] 46 | long long cost; | ^~~~ main.cpp:45:19: warning: 'long long int EdgeEntry::node' [-Wreorder] 45 | long long node; | ^~~~ main.cpp:47:5: warning: when initialized here [-Wreorder] 47 | EdgeEntry() : cost(0), node(0) {} | ^~~~~~~~~ main.cpp: In function 'std::vector<int> dijkstra(Graph, long long int)': main.cpp:75:13: warning: unused variable 'min_neigh' [-Wunused-variable] 75 | int min_neigh = -1, min_dist = 1e9; | ^~~~~~~~~ main.cpp:75:29: warning: unused variable 'min_dist' [-Wunused-variable] 75 | int min_neigh = -1, min_dist = 1e9; | ^~~~~~~~ main.cpp: In instantiation of 'void logvec(std::vector<_Tp>, int) [with T = int]': main.cpp:115:11: required from here main.cpp:99:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 99 | for (int i = offset; i < vec.size(); ++i) { | ~~^~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms303kbOK10
20ms303kbIncorect0
31ms557kbIncorect0
41ms557kbIncorect0
59ms2387kbIncorect0
624ms4005kbIncorect0
734ms5763kbIncorect0
849ms12419kbMemory limit exceeded0
969ms9609kbOK10
1078ms12578kbMemory limit exceeded0
Punctaj total20

Ceva nu functioneaza?