Pagini recente » Borderou de evaluare (job #1948925) | Borderou de evaluare (job #499624) | Borderou de evaluare (job #1737882) | Borderou de evaluare (job #2639609) | Borderou de evaluare (job #2907340)
Borderou de evaluare (job #2907340)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::bfs(std::queue<int>&, std::vector<bool>&, std::vector<int>&)':
main.cpp:107:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
107 | for(int i=0; i<adjacency_list[current_node].size(); i++){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'void BFSInfoarena()':
main.cpp:142:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
142 | for(int i = 1; i < rezolvare.size(); i++){
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::dfs(int, std::vector<bool>&)':
main.cpp:150:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
150 | for(int i = 0; i < adjacency_list[x].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::Topological_Sort(int, std::vector<bool>&, std::vector<int>&)':
main.cpp:184:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
184 | for(int i=0; i<adjacency_list[x].size(); i++){
| ~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::bcc(int, int, std::vector<int>&, std::vector<int>&, std::stack<edge>&, int&, std::vector<std::set<int> >&, std::vector<bool>&)':
main.cpp:218:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
218 | for(int i = 0; i < adjacency_list[x].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'void BiconexInfoarena()':
main.cpp:273:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::set<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
273 | for(int i = 0; i < bc_components.size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'void APMInfoarena()':
main.cpp:394:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
394 | for(int i = 0; i < APM.size(); i++){
| ~~^~~~~~~~~~~~
main.cpp: In member function 'void Graph::Dijkstra(std::vector<int>&, std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int> >, std::greater<std::pair<int, int> > >&)':
main.cpp:411:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge_with_cost>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
411 | for (int i = 0; i < adjacency_list_with_costs[x].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::BellmanFord(std::vector<int>&, std::queue<int>&)':
main.cpp:464:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge_with_cost>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
464 | for(int i = 0; i < adjacency_list_with_costs[x].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'void RoyFloydInfoarena()':
main.cpp:522:15: warning: unused variable 'INF' [-Wunused-variable]
522 | const int INF = 1e8;
| ^~~
main.cpp: In function 'void DarbInfoarena()':
main.cpp:558:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
558 | for(int i = 0; i < distance.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
main.cpp:564:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
564 | for(int i = 0; i < distance2.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 1ms | 184kb | OK | 10 |
2 | 2ms | 184kb | OK | 10 |
3 | 1ms | 184kb | OK | 10 |
4 | 1ms | 184kb | OK | 10 |
5 | 8ms | 966kb | OK | 10 |
6 | 44ms | 3502kb | OK | 10 |
7 | 71ms | 4780kb | OK | 10 |
8 | 119ms | 7200kb | OK | 10 |
9 | 115ms | 8306kb | OK | 10 |
10 | 209ms | 9433kb | Time limit exceeded | 0 |
Punctaj total | 90 |