Borderou de evaluare (job #2806725)

Utilizator MihaelaDanilaDanila Mihaela MihaelaDanila Data 22 noiembrie 2021 22:25:27
Problema Sortare topologica Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::DFS(int, std::vector<int>&)': main.cpp:129:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 129 | for(int i = 0; i < this->graph_adjacency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::print_Biconnected_Components(char*)': main.cpp:146:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::unordered_set<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 146 | for(int i=0; i<biconnected_components.size(); i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::print_Strongly_Connected_Components(char*)': main.cpp:163:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 163 | for(int i = 0; i < strongly_connected_components.size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:165:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 165 | for(int j = 0; j < strongly_connected_components[i].size(); j++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::create_Minimum_Paths(int)': main.cpp:244:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 244 | for(int i=0; i < this->graph_adjacency_list[curent].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::DFSBiconnected(int, int, int, std::vector<int>&, std::vector<int>&, std::vector<std::unordered_set<int> >&, std::stack<std::pair<int, int> >&)': main.cpp:322:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 322 | for(int i=0; i<this->graph_adjacency_list[nodCurent].size(); i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::tarjan(int, std::stack<int>&, std::vector<int>&, std::vector<int>&, int&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:420:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 420 | for(int i=0; i<this->graph_adjacency_list[nod].size(); i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::DFSSortareTopologica(int, std::vector<int>&, std::stack<int>&)': main.cpp:471:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 471 | for(int i=0; i<this->graph_adjacency_list[nod].size();i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:517:41: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings] 517 | g.read_Oriented_Graph_Without_Costs("../sortaret.in"); | ^~~~~~~~~~~~~~~~ main.cpp:519:30: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings] 519 | g.print_Topological_Sort("../sortaret.out"); | ^~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK10
22ms184kbOK10
32ms184kbOK10
42ms184kbOK10
56ms331kbOK10
611ms507kbOK10
720ms1032kbOK10
830ms1404kbOK10
959ms2510kbOK10
1092ms3215kbOK10
Punctaj total100

Ceva nu functioneaza?