Borderou de evaluare (job #2804159)
Utilizator | Data | 21 noiembrie 2021 00:25:25 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'void solve()':
main.cpp:30:34: error: conversion from 'const int' to non-scalar type 'std::pair<int, int>' requested
30 | point node = heap.begin() -> second;
| ~~~~~~~~~~~~~~~~^~~~~~
main.cpp:33:23: error: no match for 'operator[]' (operand types are 'std::vector<std::pair<int, int> > [50001]' and 'std::pair<int, int>')
33 | for(auto it : graf[node])
| ^
main.cpp:35:30: error: no match for 'operator[]' (operand types are 'int [50001]' and 'std::pair<int, int>')
35 | if(dist[it.node] > dist[node] + it.cost)
| ^
main.cpp:39:29: error: no match for 'operator[]' (operand types are 'int [50001]' and 'std::pair<int, int>')
39 | dist[it.node] = dist[node] + it.cost;
| ^
main.cpp:40:35: error: no match for 'operator[]' (operand types are 'int [50001]' and 'std::pair<int, int>')
40 | heap.insert(make_pair(dist[node] + it.cost, it.node))
| ^
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !