Borderou de evaluare (job #3162208)

Utilizator PsyDuck1914Feraru Rares-Serban PsyDuck1914 Data 28 octombrie 2023 16:19:51
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 dijkstra(int)': main.cpp:25:35: error: no matching function for call to 'std::set<std::pair<int, int> >::find(int&, int&)' 25 | q.erase(q.find(rez[ver.first], ver.first)); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/12.2.1/set:61, from /usr/include/c++/12.2.1/x86_64-pc-linux-gnu/bits/stdc++.h:87, from main.cpp:1: /usr/include/c++/12.2.1/bits/stl_set.h:804:9: note: candidate: 'template<class _Kt> decltype (std::set<_Key, _Compare, _Alloc>::iterator{((std::set<_Key, _Compare, _Alloc>*)this)->std::set<_Key, _Compare, _Alloc>::_M_t._M_find_tr(__x)}) std::set<_Key, _Compare, _Alloc>::find(const _Kt&) [with _Key = std::pair<int, int>; _Compare = std::less<std::pair<int, int> >; _Alloc = std::allocator<std::pair<int, int> >]' 804 | find(const _Kt& __x) | ^~~~ /usr/include/c++/12.2.1/bits/stl_set.h:804:9: note: template argument deduction/substitution failed: main.cpp:25:35: note: candidate expects 1 argument, 2 provided 25 | q.erase(q.find(rez[ver.first], ver.first)); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/12.2.1/bits/stl_set.h:810:9: note: candidate: 'template<class _Kt> decltype (std::set<_Key, _Compare, _Alloc>::const_iterator{((const std::set<_Key, _Compare, _Alloc>*)this)->std::set<_Key, _Compare, _Alloc>::_M_t._M_find_tr(__x)}) std::set<_Key, _Compare, _Alloc>::find(const _Kt&) const [with _Key = std::pair<int, int>; _Compare = std::less<std::pair<int, int> >; _Alloc = std::allocator<std::pair<int, int> >]' 810 | find(const _Kt& __x) const | ^~~~ /usr/include/c++/12.2.1/bits/stl_set.h:810:9: note: template argument deduction/substitution failed: main.cpp:25:35: note: candidate expects 1 argument, 2 provided 25 | q.erase(q.find(rez[ver.first], ver.first)); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/12.2.1/bits/stl_set.h:794:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::find(const key_type&) [with _Key = std::pair<int, int>; _Compare = std::less<std::pair<int, int> >; _Alloc = std::allocator<std::pair<int, int> >; iterator = 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; key_type = std::pair<int, int>]' 794 | find(const key_type& __x) | ^~~~ /usr/include/c++/12.2.1/bits/stl_set.h:794:7: note: candidate expects 1 argument, 2 provided /usr/include/c++/12.2.1/bits/stl_set.h:798:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::const_iterator std::set<_Key, _Compare, _Alloc>::find(const key_type&) const [with _Key = std::pair<int, int>; _Compare = std::less<std::pair<int, int> >; _Alloc = std::allocator<std::pair<int, int> >; const_iterator = 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; key_type = std::pair<int, int>]' 798 | find(const key_type& __x) const | ^~~~ /usr/include/c++/12.2.1/bits/stl_set.h:798:7: note: candidate expects 1 argument, 2 provided Non zero exit status: 1

Ceva nu functioneaza?