Pagini recente » Borderou de evaluare (job #2444428) | Borderou de evaluare (job #2613751) | Borderou de evaluare (job #52143) | Borderou de evaluare (job #806348) | Borderou de evaluare (job #2831380)
Borderou de evaluare (job #2831380)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::dfs_ctc(int, std::vector<std::vector<int> >&, std::vector<int>&, std::stack<int>&)':
main.cpp:172:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
172 | for (int j = 0; j < adj_list[varf].size(); j++) // aleg mereu primul vecin nevizitat anterior al varfului curent
| ~~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::transpose(int, std::vector<std::vector<int> >&, std::vector<int>&, std::vector<std::vector<int> >&, int)':
main.cpp:183:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
183 | for (int j = 0; j < adj_list_trans[varf].size(); j++) // aleg mereu primul vecin nevizitat anterior al varfului curent
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::strongly_connected_components(std::ifstream&, std::ofstream&)':
main.cpp:225:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
225 | for (int j = 0; j < strongly_con_comp[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::hamilton()':
main.cpp:280:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
280 | for (int k = 0; k < adj_list_costs[j].size(); k++) // Get through all the neighbours of the node
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:292:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
292 | for (int i = 0; i < adj_list_costs[0].size(); ++i)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::tree_diameter(int, int&, int&)':
main.cpp:355:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
355 | for (int i = 0; i < adj_list[parent_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bellman_ford(int)':
main.cpp:387:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
387 | for (int i = 0; i < adj_list_costs[source].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:546:7: warning: unused variable 'ok' [-Wunused-variable]
546 | int ok = 1;
| ^~
main.cpp:655:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
655 | for (int i = 0; i < euler_list.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 184kb | OK | 10 |
2 | 2ms | 184kb | OK | 10 |
3 | 2ms | 184kb | OK | 10 |
4 | 6ms | 286kb | OK | 10 |
5 | 11ms | 446kb | OK | 10 |
6 | 54ms | 2084kb | OK | 10 |
7 | 169ms | 5193kb | OK | 10 |
8 | 164ms | 8314kb | OK | 10 |
9 | 822ms | 14123kb | OK | 10 |
10 | 821ms | 14086kb | OK | 10 |
Punctaj total | 100 |