Borderou de evaluare (job #2802429)

Utilizator Tache_RoxanaTache Roxana Tache_Roxana Data 18 noiembrie 2021 09:19:31
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 20

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::dijkstraBellman(int)': main.cpp:167:44: 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] 167 | if(visited[i.node] >= adjacent.size()) main.cpp: In function 'int main()': main.cpp:194:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 194 | else for(int i = 1; i < dijks.first.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp:181:15: warning: unused variable 'start' [-Wunused-variable] 181 | int n, m, start; | ^~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbOK10
21ms184kbIncorect0
31ms184kbIncorect0
41ms184kbIncorect0
533ms1617kbIncorect0
645ms2875kbIncorect0
760ms3809kbIncorect0
81003ms8388kbTime limit exceeded0
9123ms5664kbOK10
10195ms12304kbMemory limit exceeded0
Punctaj total20

Ceva nu functioneaza?