Borderou de evaluare (job #2809322)
Utilizator | Data | 26 noiembrie 2021 17:49:56 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In static member function 'static std::vector<std::vector<int> > Algorithms::getComponenteBiconexe(const std::vector<std::vector<int> >&, std::vector<int>&, std::vector<int>&, std::vector<bool>&)':
main.cpp:77:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
77 | for( int i = 1; i < adjacencyList.size(); ++i )
| ~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp: In static member function 'static std::vector<std::vector<int> > Algorithms::getComponenteTareConexe(const std::vector<std::vector<int> >&, const std::vector<std::vector<int> >&, std::vector<bool>&)':
main.cpp:90:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
90 | for( int i = 1; i < adjacencyList.size(); ++i )
| ~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp: In static member function 'static std::vector<int> Algorithms::getDijkstra(const std::vector<std::vector<std::pair<int, int> > >&, int, int)':
main.cpp:110:30: error: 'INT_MAX' was not declared in this scope
110 | vector<int> d(n + 1, INT_MAX), visited(n + 1);
| ^~~~~~~
main.cpp:5:1: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'?
4 | #include <stack>
+++ |+#include <climits>
5 | #include <vector>
main.cpp: In function 'void solveDijkstra()':
main.cpp:342:17: error: 'INT_MAX' was not declared in this scope
342 | if(x == INT_MAX)
| ^~~~~~~
main.cpp:342:17: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'?
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !