Borderou de evaluare (job #2424286)
Utilizator | Data | 22 mai 2019 20:40:51 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp:7:1: error: 'vector' does not name a type
vector <int> graph[100005];
^~~~~~
main.cpp:8:1: error: 'vector' does not name a type
vector <int> graphC[100005];
^~~~~~
main.cpp:11:1: error: 'priority_queue' does not name a type
priority_queue < pair<int, int> > myheap;
^~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:24:3: error: 'graph' was not declared in this scope
graph[a].push_back(b);
^~~~~
main.cpp:25:3: error: 'graphC' was not declared in this scope
graphC[a].push_back(c);
^~~~~~
main.cpp:28:2: error: 'myheap' was not declared in this scope
myheap.push(make_pair(-dist[1], 1));
^~~~~~
main.cpp:45:14: error: 'graph' was not declared in this scope
int lim = graph[index].size();
^~~~~
main.cpp:49:16: error: 'graphC' was not declared in this scope
int cost = graphC[index][i];
^~~~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !