Borderou de evaluare (job #2796555)

Utilizator waren4Marius Radu waren4 Data 8 noiembrie 2021 14:15:09
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 85

Raport evaluator

Compilare: main.cpp:81: warning: ignoring '#pragma region HeapPublicMethods' [-Wunknown-pragmas] 81 | #pragma region HeapPublicMethods | main.cpp:151: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 151 | #pragma endregion | main.cpp:153: warning: ignoring '#pragma region HeapPrivateMethods' [-Wunknown-pragmas] 153 | #pragma region HeapPrivateMethods | main.cpp:238: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 238 | #pragma endregion | main.cpp:262: warning: ignoring '#pragma region DisjointSetsPublicMethods' [-Wunknown-pragmas] 262 | #pragma region DisjointSetsPublicMethods | main.cpp:297: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 297 | #pragma endregion | main.cpp:328: warning: ignoring '#pragma region GraphConstructors' [-Wunknown-pragmas] 328 | #pragma region GraphConstructors | main.cpp:351: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 351 | #pragma endregion | main.cpp:353: warning: ignoring '#pragma region GraphGetSet' [-Wunknown-pragmas] 353 | #pragma region GraphGetSet | main.cpp:408: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 408 | #pragma endregion | main.cpp:440: warning: ignoring '#pragma region GraphPublicMethods' [-Wunknown-pragmas] 440 | #pragma region GraphPublicMethods | main.cpp:879: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 879 | #pragma endregion | main.cpp:881: warning: ignoring '#pragma region GraphPrivateMethods' [-Wunknown-pragmas] 881 | #pragma region GraphPrivateMethods | main.cpp:1202: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 1202 | #pragma endregion | main.cpp: In member function 'void Graph::BellmanFord(std::vector<bool>&, std::vector<int>&, Heap<std::pair<int, int> >&, int)': main.cpp:936:24: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare] 936 | if(loopCounter > numberOfEdges * (numberOfNodes - 1)) { // Too many improvements, there is a negative weight cycle | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In instantiation of 'int Heap<T>::LeftChild(int) [with T = std::pair<int, int>]': main.cpp:159:16: required from 'void Heap<T>::Descend(int) [with T = std::pair<int, int>]' main.cpp:198:5: required from 'void Heap<T>::Delete(int) [with T = std::pair<int, int>]' main.cpp:106:5: required from 'void Heap<T>::Pop() [with T = std::pair<int, int>]'
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
11ms184kbOK55
21ms184kbOK55
32ms184kbOK55
42ms184kbOK55
51ms184kbOK55
61ms184kbOK510
734ms184kbOK5
829ms1945kbOK515
954ms2654kbOK5
1041ms307kbOK5
1174ms2998kbOK520
12207ms4911kbOK5
13104ms4395kbOK5
14297ms7671kbOK5
15327ms9453kbOK515
16184ms7507kbOK5
1775ms331kbOK5
18283ms10801kbOK50
19510ms11833kbTime limit exceeded0
20226ms307kbOK5
Punctaj total85

Ceva nu functioneaza?