Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #62238664
Rezumat problemă
#1955
Personajul acestei probleme este Lucian. Lucian locuiește în tara lui Verde Împărat, această tară având n orașe, numerotate de la 1 la n. Cum în orice poveste cu împărați există și o prințesă, și în problema noastră avem o prințesă, să o numim Maria. Maria este fiica lui Verde Împărat și în același timp prietena lui Lucian.
În tara lui Verde Împărat se apropie sărbătorile, iar ca să fie sigur de un nou mandat, împăratul a promis că va repara câteva drumuri, astfel încât să se poată ajunge din orice oraș, în oricare alt oraș, mergând doar pe drumuri care nu sunt stricate. Fiecare drum care este stricat are un cost de reparație , și având în vedere că se apropie sărbătorile, Împăratul ar vrea să repare drumurile optim, astfel încât să obțină un cost cât mai mic. Știind că Lucian vrea să-i ceară mâna Mariei, Împăratul i-a încredințat lui Lucian această sarcină, iar în cazul în care nu va putea să o îndeplinească îl va izgoni din tară. Lucian nu a fost prezent mai deloc la orele de algoritmică din liceu și vă cere vouă ajutorul pentru această problema complicată. Având la dispoziție lista drumurilor, precum și lista drumurilor stricate, voi trebuie să-i spuneți lui Lucian care este suma minimă pe care trebuie să o folosească pentru a se putea ajunge din orice oraș în oricare alt oraș.
Concurs "Stefan Dartu" Vatra Dornei
Mihalut Filip (mihalutafilip) Detalii
| Problema | plimbare1 | Operații I/O |
plimbare1.in/plimbare1.out
|
|---|---|---|---|
| Limita timp | 0.35 secunde | Limita memorie |
Total: 64 MB
/
Stivă 4 MB
|
| Id soluție | #62238664 | Utilizator |
Dascalu Vladimir (DascaluVladimir)
|
| Fișier | plimbare1.cpp | Dimensiune | 1.70 KB |
| Data încărcării | 14 Ianuarie 2026, 16:43 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edges*, std::vector<Edges> >; _Tp = Edges]': /usr/include/c++/4.8/bits/stl_algo.h:2283:70: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edges*, std::vector<Edges> >]' /usr/include/c++/4.8/bits/stl_algo.h:2315:54: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edges*, std::vector<Edges> >; _Size = int]' /usr/include/c++/4.8/bits/stl_algo.h:5461:36: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<Edges*, std::vector<Edges> >]' plimbare1.cpp:53:36: required from here /usr/include/c++/4.8/bits/stl_algo.h:2242:20: error: no match for 'operator<' (operand types are 'Edges' and 'const Edges') while (*__first < __pivot) ^ /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: candidates are: plimbare1.cpp:15:10: note: bool Edges::operator<(Edges&) bool operator<(Edges& other) ^ plimbare1.cpp:15:10: note: no known conversion for argument 1 from 'const Edges' to 'Edges&' In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from plimbare1.cpp:1: /usr/include/c++/4.8/bits/stl_pair.h:220:5: note: template<class _T1, class _T2> constexpr bool std::operator<(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) ^ /usr/include/c++/4.8/bits/stl_pair.h:220:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: 'Edges' is not derived from 'const std::pair<_T1, _T2>' while (*__first < __pivot) ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from plimbare1.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:297:5: note: template<class _Iterator> bool std::operator<(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&) operator<(const reverse_iterator<_Iterator>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:297:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: 'Edges' is not derived from 'const std::reverse_iterator<_Iterator>' while (*__first < __pivot) ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from plimbare1.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:347:5: note: template<class _IteratorL, class _IteratorR> bool std::operator<(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_IteratorR>&) operator<(const reverse_iterator<_IteratorL>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:347:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: 'Edges' is not derived from 'const std::reverse_iterator<_Iterator>' while (*__first < __pivot) ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from plimbare1.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:1055:5: note: template<class _IteratorL, class _IteratorR> bool std::operator<(const std::move_iterator<_Iterator>&, const std::move_iterator<_IteratorR>&) operator<(const move_iterator<_IteratorL>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:1055:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: 'Edges' is not derived from 'const std::move_iterator<_Iterator>' while (*__first < __pivot) ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from plimbare1.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:1061:5: note: template<class _Iterator> bool std::operator<(const std::move_iterator<_Iterator>&, const std::move_iterator<_Iterator>&) operator<(const move_iterator<_Iterator>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:1061:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: 'Edges' is not derived from 'const std::move_iterator<_Iterator>' while (*__first < __pivot) ^ In file included from /usr/include/c++/4.8/string:52:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from plimbare1.cpp:1: /usr/include/c++/4.8/bits/basic_string.h:2569:5: note: template<class _CharT, class _Traits, class _Alloc> bool std::operator<(const std::basic_string<_CharT, _Traits, _Alloc>&, const std::basic_string<_CharT, _Traits, _Alloc>&) operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, ^ /usr/include/c++/4.8/bits/basic_string.h:2569:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: 'Edges' is not derived from 'const std::basic_string<_CharT, _Traits, _Alloc>' while (*__first < __pivot) ^ In file included from /usr/include/c++/4.8/string:52:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from plimbare1.cpp:1: /usr/include/c++/4.8/bits/basic_string.h:2581:5: note: template<class _CharT, class _Traits, class _Alloc> bool std::operator<(const std::basic_string<_CharT, _Traits, _Alloc>&, const _CharT*) operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, ^ /usr/include/c++/4.8/bits/basic_string.h:2581:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: 'Edges' is not derived from 'const std::basic_string<_CharT, _Traits, _Alloc>' while (*__first < __pivot) ^ In file included from /usr/include/c++/4.8/string:52:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from plimbare1.cpp:1: /usr/include/c++/4.8/bits/basic_string.h:2593:5: note: template<class _CharT, class _Traits, class _Alloc> bool std::operator<(const _CharT*, const std::basic_string<_CharT, _Traits, _Alloc>&) operator<(const _CharT* __lhs, ^ /usr/include/c++/4.8/bits/basic_string.h:2593:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: mismatched types 'const _CharT*' and 'Edges' while (*__first < __pivot) ^ In file included from /usr/include/c++/4.8/vector:64:0, from plimbare1.cpp:2: /usr/include/c++/4.8/bits/stl_vector.h:1421:5: note: template<class _Tp, class _Alloc> bool std::operator<(const std::vector<_Tp, _Alloc>&, const std::vector<_Tp, _Alloc>&) operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) ^ /usr/include/c++/4.8/bits/stl_vector.h:1421:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: 'Edges' is not derived from 'const std::vector<_Tp, _Alloc>' while (*__first < __pivot) ^ In file included from /usr/include/c++/4.8/tuple:39:0, from /usr/include/c++/4.8/functional:55, from /usr/include/c++/4.8/bits/stl_algo.h:66, from /usr/include/c++/4.8/algorithm:62, from plimbare1.cpp:3: /usr/include/c++/4.8/array:238:5: note: template<class _Tp, unsigned int _Nm> bool std::operator<(const std::array<_Tp, _Nm>&, const std::array<_Tp, _Nm>&) operator<(const array<_Tp, _Nm>& __a, const array<_Tp, _Nm>& __b) ^ /usr/include/c++/4.8/array:238:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: 'Edges' is not derived from 'const std::array<_Tp, _Nm>' while (*__first < __pivot) ^ In file included from /usr/include/c++/4.8/functional:55:0, from /usr/include/c++/4.8/bits/stl_algo.h:66, from /usr/include/c++/4.8/algorithm:62, from plimbare1.cpp:3: /usr/include/c++/4.8/tuple:824:5: note: template<class ... _TElements, class ... _UElements> constexpr bool std::operator<(const std::tuple<_Elements ...>&, const std::tuple<_Elements ...>&) operator<(const tuple<_TElements...>& __t, ^ /usr/include/c++/4.8/tuple:824:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/4.8/algorithm:62:0, from plimbare1.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2242:20: note: 'Edges' is not derived from 'const std::tuple<_Elements ...>' while (*__first < __pivot) ^ /usr/include/c++/4.8/bits/stl_algo.h:2245:19: error: passing 'const Edges' as 'this' argument of 'bool Edges::operator<(Edges&)' discards qualifiers [-fpermissive] while (__pivot < *__last) ^
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 plimbare1 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ă.