Borderou de evaluare (job #3291269)
Utilizator | Data | 3 aprilie 2025 21:27:18 | |
---|---|---|---|
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 Dijkastra(int)':
main.cpp:28:38: warning: top-level comma expression in array subscript is deprecated [-Wcomma-subscript]
28 | q.erase({cost[urm.vec, urm.vec});
| ^
main.cpp:28:35: warning: left operand of comma operator has no effect [-Wunused-value]
28 | q.erase({cost[urm.vec, urm.vec});
| ~~~~^~~
main.cpp:28:47: error: expected ']' before '}' token
28 | q.erase({cost[urm.vec, urm.vec});
| ^
| ]
main.cpp:28:24: error: converting to 'std::set<std::pair<int, int> >::const_iterator' {aka 'std::_Rb_tree<std::pair<int, int>, std::pair<int, int>, std::_Identity<std::pair<int, int> >, std::less<std::pair<int, int> >, std::allocator<std::pair<int, int> > >::const_iterator'} from initializer list would use explicit constructor 'std::_Rb_tree_const_iterator<_Tp>::_Rb_tree_const_iterator(_Base_ptr) [with _Tp = std::pair<int, int>; _Base_ptr = const std::_Rb_tree_node_base*]'
28 | q.erase({cost[urm.vec, urm.vec});
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:28:47: error: invalid conversion from 'int' to 'std::_Rb_tree_const_iterator<std::pair<int, int> >::_Base_ptr' {aka 'const std::_Rb_tree_node_base*'} [-fpermissive]
28 | q.erase({cost[urm.vec, urm.vec});
| ~~~~~~~~~~~~~~~~~~~~~^
| |
| int
In file included from /usr/include/c++/12.2.1/map:60,
from /usr/include/c++/12.2.1/x86_64-pc-linux-gnu/bits/stdc++.h:81,
from main.cpp:1:
/usr/include/c++/12.2.1/bits/stl_tree.h:347:41: note: initializing argument 1 of 'std::_Rb_tree_const_iterator<_Tp>::_Rb_tree_const_iterator(_Base_ptr) [with _Tp = std::pair<int, int>; _Base_ptr = const std::_Rb_tree_node_base*]'
347 | _Rb_tree_const_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPT
| ~~~~~~~~~~^~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !