Borderou de evaluare (job #2802277)

Utilizator Tache_RoxanaTache Roxana Tache_Roxana Data 17 noiembrie 2021 21:04:43
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 10

Raport evaluator

Compilare: main.cpp: In member function 'std::vector<std::__cxx11::list<Graph::nodeStruct> > Graph::transposed()': main.cpp:20:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 20 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In constructor 'Graph::Graph(std::vector<std::tuple<int, int, int> >&, int, bool)': main.cpp:83:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' 83 | for(auto[node1, node2, cost]: data) { | ^ main.cpp: In function 'std::ostream& operator<<(std::ostream&, Graph)': main.cpp:91:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 91 | for(int i = 0; i < graph.adjacent.size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::connected()': main.cpp:102:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 102 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::stack<int> Graph::topologicalSort()': main.cpp:120:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 120 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::pair<std::vector<std::vector<int> >, std::vector<std::pair<int, int> > > Graph::biconnected()': main.cpp:131:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 131 | for (int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::vector<int> > Graph::hardConnected()': main.cpp:141:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 141 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::pair<std::vector<int>, bool> Graph::dijkstra(int)': main.cpp:171:31: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 171 | if (visited[node] >= adjacent.size() || node == start) main.cpp: In function 'int main()': main.cpp:193:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 193 | for(int i = 1; i < dijks.first.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp:182:15: warning: unused variable 'start' [-Wunused-variable] 182 | int n, m, start; | ^~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
11ms184kbOK55
21ms184kbOK55
31ms184kbIncorect00
41ms184kbIncorect00
52ms184kbIncorect00
61ms184kbIncorect00
71ms184kbOK5
820ms1499kbIncorect00
983ms2818kbIncorect0
101ms184kbOK5
1139ms2674kbIncorect00
12175ms6369kbIncorect0
13185ms4653kbIncorect0
14245ms9547kbIncorect0
15315ms10313kbIncorect00
16328ms8093kbIncorect0
172ms184kbOK5
18285ms11763kbIncorect00
19370ms13639kbIncorect0
201ms196kbOK5
Punctaj total10

Ceva nu functioneaza?