Borderou de evaluare (job #3170606)
Utilizator | Data | 17 noiembrie 2023 20:31:56 | |
---|---|---|---|
Problema | Camionas | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In constructor 'Graf::Graf(int, std::unordered_map<int, std::vector<int> >&)':
main.cpp:22:9: warning: 'Graf::nr_noduri' will be initialized after [-Wreorder]
22 | int nr_noduri;
| ^~~~~~~~~
main.cpp:14:37: warning: 'std::unordered_map<int, std::vector<int> > Graf::lista_adiac' [-Wreorder]
14 | unordered_map<int, vector<int>> lista_adiac;
| ^~~~~~~~~~~
main.cpp:30:5: warning: when initialized here [-Wreorder]
30 | Graf(int nr_noduri, unordered_map<int,vector<int>>&lista_adiac) : nr_noduri(nr_noduri), lista_adiac(lista_adiac){};
| ^~~~
main.cpp: In constructor 'Graf::Graf(int, std::unordered_map<int, std::vector<std::pair<int, int> > >&)':
main.cpp:22:9: warning: 'Graf::nr_noduri' will be initialized after [-Wreorder]
22 | int nr_noduri;
| ^~~~~~~~~
main.cpp:15:47: warning: 'std::unordered_map<int, std::vector<std::pair<int, int> > > Graf::lista_adiac_cost' [-Wreorder]
15 | unordered_map<int, vector<pair<int,int>>> lista_adiac_cost;
| ^~~~~~~~~~~~~~~~
main.cpp:41:5: warning: when initialized here [-Wreorder]
41 | Graf(int nr_noduri, unordered_map<int,vector<pair<int,int>>>&lista_adiac) : nr_noduri(nr_noduri), lista_adiac_cost(lista_adiac){};
| ^~~~
main.cpp: In member function 'std::vector<int> Graf::topologicalSort(std::vector<std::vector<int> >&)':
main.cpp:88:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
88 | for(int nod=0; nod<grade.size(); nod++) // pun pe stiva toate nodurile ce au gradul de intrare 0
| ~~~^~~~~~~~~~~~~
main.cpp:103:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
103 | if(ordine.size()!=nr_noduri){ // daca dimensiune lui ordine, unde se afla rezultatul, difera de nr de noduri
| ~~~~~~~~~~~~~^~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graf::dijkstra(int)':
main.cpp:172:42: error: 'INT_MAX' was not declared in this scope
172 | vector<int>distante(nr_noduri+1, INT_MAX);
| ^~~~~~~
main.cpp:9:1: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'?
8 | #include<stack>
+++ |+#include <climits>
9 |
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !