Pagini recente » Borderou de evaluare (job #769162) | Borderou de evaluare (job #3128066) | Borderou de evaluare (job #1209230) | Borderou de evaluare (job #705083) | Borderou de evaluare (job #2831663)
Borderou de evaluare (job #2831663)
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:185:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
185 | for (int j = 0; j < adj_list[varf].size(); j++) // choose the first neighbour and compute DFS
| ~~^~~~~~~~~~~~~~~~~~~~~~~
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:196:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
196 | for (int j = 0; j < adj_list_trans[varf].size(); j++) // choose the first neighbour and compute DFS
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::strongly_connected_components(std::ifstream&, std::ofstream&)':
main.cpp:238:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
238 | for (int j = 0; j < strongly_con_comp[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::hamilton()':
main.cpp:293: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]
293 | for (int k = 0; k < adj_list_costs[j].size(); k++) // Get through all the neighbours of the node
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:305: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]
305 | 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:368:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
368 | 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:400: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]
400 | for (int i = 0; i < adj_list_costs[source].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:573:7: warning: unused variable 'ok' [-Wunused-variable]
573 | int ok = 1;
| ^~
main.cpp:686:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
686 | for (int i = 0; i < euler_list.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 184kb | OK | 5 |
2 | 2ms | 184kb | OK | 5 |
3 | 2ms | 184kb | OK | 5 |
4 | 11ms | 409kb | OK | 5 |
5 | 2ms | 184kb | OK | 5 |
6 | 2ms | 184kb | OK | 5 |
7 | 2ms | 184kb | OK | 5 |
8 | 2ms | 184kb | OK | 5 |
9 | 2ms | 184kb | OK | 5 |
10 | 2ms | 184kb | OK | 5 |
11 | 30ms | 1728kb | OK | 5 |
12 | 25ms | 2084kb | OK | 5 |
13 | 35ms | 2969kb | OK | 5 |
14 | 44ms | 4096kb | OK | 5 |
15 | 59ms | 4538kb | OK | 5 |
16 | 73ms | 5361kb | OK | 5 |
17 | 102ms | 13488kb | OK | 5 |
18 | 11ms | 5304kb | OK | 5 |
19 | 16ms | 5533kb | OK | 5 |
20 | 87ms | 7729kb | OK | 5 |
Punctaj total | 100 |