Borderou de evaluare (job #2818072)
Utilizator | Data | 15 decembrie 2021 02:45:02 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In member function 'void Graf::DFS(int, std::vector<bool>&)':
main.cpp:104:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
104 | for(int i = 1; i < lista_vecini[nod].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::hakimi(int, std::vector<int>&, std::ostream&)':
main.cpp:156:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
156 | if(aux > lista.size())
| ~~~~^~~~~~~~~~~~~~
main.cpp: In member function 'int Graf::DFS_sortaret(std::queue<int>&)':
main.cpp:176:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
176 | for(int j = 1; j < lista_vecini[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:186:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
186 | for(int i = 1; i < lista_vecini[aux].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:193:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::queue<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
193 | if(nr_noduri == lista.size())
| ~~~~~~~~~~^~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::DFS_biconex(int, int, std::vector<int>&, std::vector<int>&, std::vector<bool>&, std::stack<int>&, std::vector<std::vector<int> >&)':
main.cpp:205:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
205 | for(int i = 0; i < lista_vecini[nod].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::dijkstra(std::vector<std::pair<int, int> >&, std::vector<int>&, int)':
main.cpp:265:67: error: '__gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::value_type' {aka 'struct std::pair<int, int>'} has no member named 'begin'
265 | for(vector<pair<int, int>>::iterator it = muchii[nod].begin(); it != muchii[nod].end(); ++it)
| ^~~~~
main.cpp:265:94: error: '__gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::value_type' {aka 'struct std::pair<int, int>'} has no member named 'end'
265 | for(vector<pair<int, int>>::iterator it = muchii[nod].begin(); it != muchii[nod].end(); ++it)
| ^~~
main.cpp:263:17: warning: unused variable 'd' [-Wunused-variable]
263 | int d = s.begin()->first;
| ^
main.cpp: In function 'void biconex()':
main.cpp:361:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
361 | for(int i = 0; i < subgraf_biconex.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:362:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
362 | for(int j = 0; j < subgraf_biconex[i].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'void dijkstra()':
main.cpp:414:19: error: cannot convert 'std::vector<std::pair<int, int> > [100005]' to 'std::vector<std::pair<int, int> >&'
414 | graf.dijkstra(muchii, distante, x);
| ^~~~~~
| |
| std::vector<std::pair<int, int> > [100005]
main.cpp:255:49: note: initializing argument 1 of 'void Graf::dijkstra(std::vector<std::pair<int, int> >&, std::vector<int>&, int)'
255 | void Graf::dijkstra(vector<pair<int, int>> &muchii, vector<int> &distante, int x)
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !