Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #57285082
Rezumat problemă
Zapada
#616
Orașul Kruskal are n intersecții unite prin m străzi bidirecționale. Datorită ninsorii de peste noapte, străzile sunt acoperite cu zăpadă. Administratorul orașului, Gigel, a determinat cu mari eforturi pentru fiecare stradă costul deszăpezirii ei și acum dorește deszăpezirea unor străzi astfel încât costul total al deszăpezirii lor să fie minim, și să se poată circula între oricare două intersecții pe străzi deszăpezite.
Maleficul Costel îl forțează pe Gigel să deszăpezească numite străzi, din motive doar de el știute. Ajutați-l pe Gigel să determine costul minim pentru deszăpezirea orașului, astfel încât să fie deszăpezite străzile dorite de Costel și să se poată circula între oricare două intersecții pe străzi deszăpezite.
Candale Silviu (silviu) Detalii
| Problema | Zapada | Operații I/O |
zapada.in/zapada.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #57285082 | Utilizator |
Nicola Stefan (schema2007)
|
| Fișier | zapada.cpp | Dimensiune | 1.80 KB |
| Data încărcării | 24 Martie 2025, 12:20 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
zapada.cpp: In function 'int main()': zapada.cpp:77:47: error: parameter declared 'auto' sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:56: error: parameter declared 'auto' sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp: In lambda function: zapada.cpp:79:16: error: 'a' was not declared in this scope return a.cost < b.cost; ^ zapada.cpp:79:25: error: 'b' was not declared in this scope return a.cost < b.cost; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' zapada.cpp:80:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (Edge&, Edge&)' if (__comp(*__i, *__first)) ^ zapada.cpp:77:39: note: candidates are: sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 1 argument, 3 provided zapada.cpp:77:57: note: main()::__lambda0 sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Size = int; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' zapada.cpp:80:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (Edge&, Edge&)' if (__comp(*__i, *__first)) ^ zapada.cpp:77:39: note: candidates are: sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 1 argument, 3 provided zapada.cpp:77:57: note: main()::__lambda0 sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:2295:13: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Size = int; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' zapada.cpp:80:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (Edge&, Edge&)' if (__comp(*__a, *__b)) ^ zapada.cpp:77:39: note: candidates are: sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: void (*)() <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 1 argument, 3 provided zapada.cpp:77:57: note: main()::__lambda0 sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (Edge&, Edge&)' if (__comp(*__b, *__c)) ^ zapada.cpp:77:39: note: candidates are: sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: void (*)() <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 1 argument, 3 provided zapada.cpp:77:57: note: main()::__lambda0 sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (Edge&, Edge&)' else if (__comp(*__a, *__c)) ^ zapada.cpp:77:39: note: candidates are: sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 1 argument, 3 provided zapada.cpp:77:57: note: main()::__lambda0 sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (Edge&, Edge&)' else if (__comp(*__a, *__c)) ^ zapada.cpp:77:39: note: candidates are: sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 1 argument, 3 provided zapada.cpp:77:57: note: main()::__lambda0 sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (Edge&, Edge&)' else if (__comp(*__b, *__c)) ^ zapada.cpp:77:39: note: candidates are: sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: void (*)() <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 1 argument, 3 provided zapada.cpp:77:57: note: main()::__lambda0 sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Tp = Edge; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Size = int; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' zapada.cpp:80:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (Edge&, const Edge&)' while (__comp(*__first, __pivot)) ^ zapada.cpp:77:39: note: candidates are: sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: void (*)() <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 1 argument, 3 provided zapada.cpp:77:57: note: main()::__lambda0 sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const Edge&, Edge&)' while (__comp(__pivot, *__last)) ^ zapada.cpp:77:39: note: candidates are: sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: void (*)() <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 1 argument, 3 provided zapada.cpp:77:57: note: main()::__lambda0 sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Distance = int; _Tp = Edge; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Size = int; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]' zapada.cpp:80:6: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (Edge&, Edge&)' *(__first + (__secondChild - 1)))) ^ zapada.cpp:77:39: note: candidates are: sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: void (*)() <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 1 argument, 3 provided zapada.cpp:77:57: note: main()::__lambda0 sort(edges.begin(), edges.end(), [](auto &a, auto &b) ^ zapada.cpp:77:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: At global scope: /usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', is used but never defined [-fpermissive] __unguarded_linear_insert(_RandomAccessIterator __last, ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from zapada.cpp:3: /usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', is used but never defined [-fpermissive] __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, ^ /usr/include/c++/4.8/bits/stl_heap.h:178:5: error: 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Distance = int; _Tp = Edge; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', is used but never defined [-fpermissive] __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, ^
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 Zapada 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ă.