Pagini recente » Borderou de evaluare (job #1949133) | Borderou de evaluare (job #1356222) | Borderou de evaluare (job #513323) | Borderou de evaluare (job #1261717) | Borderou de evaluare (job #2831662)
Borderou de evaluare (job #2831662)
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:572:7: warning: unused variable 'ok' [-Wunused-variable]
572 | int ok = 1;
| ^~
main.cpp:685:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
685 | for (int i = 0; i < euler_list.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 184kb | Incorect | 0 |
2 | 2ms | 184kb | Incorect | 0 |
3 | 2ms | 184kb | OK | 5 |
4 | 11ms | 344kb | OK | 5 |
5 | 2ms | 184kb | Incorect | 0 |
6 | 3ms | 184kb | Incorect | 0 |
7 | 2ms | 184kb | Incorect | 0 |
8 | 2ms | 184kb | Incorect | 0 |
9 | 2ms | 184kb | Incorect | 0 |
10 | 2ms | 184kb | Incorect | 0 |
11 | 25ms | 1368kb | Incorect | 0 |
12 | 20ms | 1626kb | Incorect | 0 |
13 | 30ms | 2449kb | Incorect | 0 |
14 | 35ms | 3604kb | Incorect | 0 |
15 | 40ms | 3743kb | Incorect | 0 |
16 | 54ms | 4452kb | Incorect | 0 |
17 | 88ms | 13488kb | OK | 5 |
18 | 15ms | 5472kb | Incorect | 0 |
19 | 15ms | 5492kb | Incorect | 0 |
20 | 63ms | 6651kb | Incorect | 0 |
Punctaj total | 15 |