Borderou de evaluare (job #2802451)

Utilizator stefdascalescuStefan Dascalescu stefdascalescu Data 18 noiembrie 2021 10:46:52
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'void Graph_Solver::dfs_biconex(int, int)': main.cpp:44:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 44 | for(int i = 0; i < v[nod].size(); ++i) | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph_Solver::solve_biconex()': main.cpp:85:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 85 | for(int j = 0; j < sol[i].size(); ++j) | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph_Solver::solve_scc()': main.cpp:123:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 123 | for(int j = 0; j < sol[i].size(); ++j) | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph_Solver::solve_toposort()': main.cpp:141:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 141 | for (int j = 0; j < v[p].size(); j++) | ~~^~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbCorect10
21ms192kbCorect10
31ms196kbCorect10
41ms196kbCorect10
51ms184kbCorect10
6124ms4915kbCorect10
7238ms11431kbCorect10
845ms2076kbCorect10
995ms1855kbCorect10
10255ms9097kbCorect10
Punctaj total100

Ceva nu functioneaza?