Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #64148598
Rezumat problemă
#1887
Dijkstra are nevoie de ajutorul vostru pentru a-și duce la bun sfârșit datoria. Acesta vrea să afle drumurile de lungime minimă de la casa prietenului său Vlad la celelalte case ale vecinilor. Nu are foarte mult timp la dispoziție așa ca trebuie să vă mișcați repede. Îl veți ajuta?
Munteanu Vlad (vladm98) Detalii
| Problema | Dijkstra2 | Operații I/O |
dijkstra2.in/dijkstra2.out
|
|---|---|---|---|
| Limita timp | 0.2 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64148598 | Utilizator |
Constantin Darius (darius091)
|
| Fișier | dijkstra2.cpp | Dimensiune | 1.06 KB |
| Data încărcării | 20 Aprilie 2026, 14:34 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
dijkstra2.cpp: In function ‘int main()’: dijkstra2.cpp:13:12: warning: statement has no effect [-Wunused-value] 13 | f>>n>>m>>p; | ~~~~~~~^~~ dijkstra2.cpp:16:16: warning: statement has no effect [-Wunused-value] 16 | f>>c>>d>>v; | ~~~~~~~^~~ dijkstra2.cpp:17:10: error: invalid types ‘int[int]’ for array subscript 17 | v[c].push.back({v,d}); | ^ dijkstra2.cpp:18:10: error: invalid types ‘int[int]’ for array subscript 18 | v[d].push.back({v,c}); | ^ dijkstra2.cpp:28:9: error: ‘it’ was not declared in this scope; did you mean ‘t’? 28 | it=se.begin(); | ^~ | t dijkstra2.cpp:31:9: error: ‘cost’ was not declared in this scope; did you mean ‘cosl’? 31 | cost=a.first; | ^~~~ | cosl dijkstra2.cpp:31:16: error: request for member ‘first’ in ‘a’, which is of non-class type ‘int’ 31 | cost=a.first; | ^~~~~ dijkstra2.cpp:32:9: error: ‘nod’ was not declared in this scope 32 | nod=a.second; | ^~~ dijkstra2.cpp:32:15: error: request for member ‘second’ in ‘a’, which is of non-class type ‘int’ 32 | nod=a.second; | ^~~~~~ dijkstra2.cpp:35:41: error: invalid types ‘int[int]’ for array subscript 35 | if(s[v[nod][x].first]>cost+v[x].second) | ^ dijkstra2.cpp:39:37: error: no matching function for call to ‘std::set<std::pair<int, int> >::find(<brace-enclosed initializer list>)’ 39 | se.erase(se.find({s[v[nod][x].first,v[nod][x].first]}) | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/set:63, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:158, from dijkstra2.cpp:1: /usr/include/c++/13/bits/stl_set.h:796: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>]’ 796 | find(const key_type& __x) | ^~~~ /usr/include/c++/13/bits/stl_set.h:796:28: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘const std::set<std::pair<int, int> >::key_type&’ {aka ‘const std::pair<int, int>&’} 796 | find(const key_type& __x) | ~~~~~~~~~~~~~~~~^~~ /usr/include/c++/13/bits/stl_set.h:800: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>]’ 800 | find(const key_type& __x) const | ^~~~ /usr/include/c++/13/bits/stl_set.h:800:28: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘const std::set<std::pair<int, int> >::key_type&’ {aka ‘const std::pair<int, int>&’} 800 | find(const key_type& __x) const | ~~~~~~~~~~~~~~~~^~~ dijkstra2.cpp:41:66: error: expected ‘]’ before ‘}’ token 41 | se.insert({s[v[nod][x].first,v[nod][x].first}) | ^ | ] dijkstra2.cpp:41:31: error: no matching function for call to ‘std::set<std::pair<int, int> >::insert(<brace-enclosed initializer list>)’ 41 | se.insert({s[v[nod][x].first,v[nod][x].first}) | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_set.h:568:9: note: candidate: ‘template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _Key = std::pair<int, int>; _Compare = std::less<std::pair<int, int> >; _Alloc = std::allocator<std::pair<int, int> >]’ 568 | insert(_InputIterator __first, _InputIterator __last) | ^~~~~~ /usr/include/c++/13/bits/stl_set.h:568:9: note: template argument deduction/substitution failed: dijkstra2.cpp:41:31: note: candidate expects 2 arguments, 1 provided 41 | se.insert({s[v[nod][x].first,v[nod][x].first}) | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_set.h:511:7: note: candidate: ‘std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = std::pair<int, int>; _Compare = std::less<std::pair<int, int> >; _Alloc = std::allocator<std::pair<int, int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::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; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other = std::allocator<std::pair<int, int> >; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key> = __gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::rebind<std::pair<int, int> >; typename _Alloc::value_type = std::pair<int, int>; value_type = std::pair<int, int>]’ 511 | insert(const value_type& __x) | ^~~~~~ /usr/include/c++/13/bits/stl_set.h:511:32: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘const std::set<std::pair<int, int> >::value_type&’ {aka ‘const std::pair<int, int>&’} 511 | insert(const value_type& __x) | ~~~~~~~~~~~~~~~~~~^~~ /usr/include/c++/13/bits/stl_set.h:520:7: note: candidate: ‘std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(value_type&&) [with _Key = std::pair<int, int>; _Compare = std::less<std::pair<int, int> >; _Alloc = std::allocator<std::pair<int, int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::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; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other = std::allocator<std::pair<int, int> >; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key> = __gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::rebind<std::pair<int, int> >; typename _Alloc::value_type = std::pair<int, int>; value_type = std::pair<int, int>]’ 520 | insert(value_type&& __x) | ^~~~~~ /usr/include/c++/13/bits/stl_set.h:520:27: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘std::set<std::pair<int, int> >::value_type&&’ {aka ‘std::pair<int, int>&&’} 520 | insert(value_type&& __x) | ~~~~~~~~~~~~~^~~ /usr/include/c++/13/bits/stl_set.h:548:7: note: candidate: ‘std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(const_iterator, const value_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; 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; value_type = std::pair<int, int>]’ 548 | insert(const_iterator __position, const value_type& __x) | ^~~~~~ /usr/include/c++/13/bits/stl_set.h:548:7: note: candidate expects 2 arguments, 1 provided /usr/include/c++/13/bits/stl_set.h:553:7: note: candidate: ‘std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(const_iterator, value_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; 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; value_type = std::pair<int, int>]’ 553 | insert(const_iterator __position, value_type&& __x) | ^~~~~~ /usr/include/c++/13/bits/stl_set.h:553:7: note: candidate expects 2 arguments, 1 provided /usr/include/c++/13/bits/stl_set.h:580:7: note: candidate: ‘void std::set<_Key, _Compare, _Alloc>::insert(std::initializer_list<_Tp>) [with _Key = std::pair<int, int>; _Compare = std::less<std::pair<int, int> >; _Alloc = std::allocator<std::pair<int, int> >]’ 580 | insert(initializer_list<value_type> __l) | ^~~~~~ /usr/include/c++/13/bits/stl_set.h:580:43: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘std::initializer_list<std::pair<int, int> >’ 580 | insert(initializer_list<value_type> __l) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ dijkstra2.cpp:11:11: warning: unused variable ‘b’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:17: warning: unused variable ‘e’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:21: warning: unused variable ‘g’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:23: warning: unused variable ‘h’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:25: warning: unused variable ‘i’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:27: warning: unused variable ‘j’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:29: warning: unused variable ‘k’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:31: warning: unused variable ‘l’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:37: warning: unused variable ‘o’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:41: warning: unused variable ‘q’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:43: warning: unused variable ‘r’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:45: warning: unused variable ‘t’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:47: warning: unused variable ‘u’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:51: warning: unused variable ‘w’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:55: warning: unused variable ‘y’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^ dijkstra2.cpp:11:57: warning: unused variable ‘z’ [-Wunused-variable] 11 | int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,t,u,v,w,x,y,z; | ^
Cum funcționează evaluarea?
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
- probleme la care rezolvarea presupune scrierea unui program complet
- probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.
Problema Dijkstra2 face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
- Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
- Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.