Pagini recente » Borderou de evaluare (job #193802) | Borderou de evaluare (job #2527113) | Borderou de evaluare (job #2572916) | Borderou de evaluare (job #2557887) | Borderou de evaluare (job #2831276)
Borderou de evaluare (job #2831276)
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:171:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
171 | 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:182:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
182 | 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:224:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
224 | for (int j = 0; j < strongly_con_comp[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::hamilton()':
main.cpp:279: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]
279 | for (int k = 0; k < adj_list_costs[j].size(); k++) // Get through all the neighbours of the node
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:291: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]
291 | for (int i = 0; i < adj_list_costs[0].size(); ++i)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bellman_ford(int)':
main.cpp:359: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]
359 | for (int i = 0; i < adj_list_costs[source].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:518:7: warning: unused variable 'ok' [-Wunused-variable]
518 | int ok = 1;
| ^~
main.cpp:602:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
602 | for (int i = 0; i < euler_list.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 2ms | 184kb | OK | 5 | 5 |
2 | 2ms | 184kb | OK | 5 | 5 |
3 | 2ms | 184kb | OK | 5 | 5 |
4 | 2ms | 184kb | OK | 5 | 5 |
5 | 1ms | 184kb | OK | 5 | 5 |
6 | 2ms | 184kb | OK | 5 | 10 |
7 | 6ms | 282kb | OK | 5 |
8 | 49ms | 1904kb | OK | 5 | 15 |
9 | 49ms | 1675kb | OK | 5 |
10 | 6ms | 200kb | OK | 5 |
11 | 78ms | 3117kb | OK | 5 | 20 |
12 | 121ms | 3022kb | OK | 5 |
13 | 88ms | 2850kb | OK | 5 |
14 | 164ms | 3964kb | OK | 5 |
15 | 212ms | 4722kb | OK | 5 | 15 |
16 | 169ms | 4116kb | OK | 5 |
17 | 21ms | 303kb | OK | 5 |
18 | 250ms | 6369kb | OK | 5 | 15 |
19 | 302ms | 7073kb | OK | 5 |
20 | 35ms | 323kb | OK | 5 |
Punctaj total | 100 |