Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #56872277
Rezumat problemă
Prim
#590
Se dă un graf neorientat ponderat conex cu n vârfuri și m muchii – în care fiecare muchie are asociat un cost, număr natural strict pozitiv. Folosind algoritmul lui Prim, determinați un arbore parțial de cost minim, cu rădăcina în vârful 1.
Candale Silviu (silviu) Detalii
| Problema | Prim | Operații I/O |
prim.in/prim.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #56872277 | Utilizator |
Ovidiu Daniel (Danyel)
|
| Fișier | prim.cpp | Dimensiune | 1.51 KB |
| Data încărcării | 09 Martie 2025, 13:48 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
prim.cpp: In function 'int main()': prim.cpp:31:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] while (index < pq.size()) { ^ prim.cpp:54:55: error: parameter declared 'auto' sort(pq.begin(), pq.end(), [](const auto& t1, ^ prim.cpp:55:55: error: parameter declared 'auto' const auto& t2) { ^ prim.cpp: In lambda function: prim.cpp:56:24: error: 't1' was not declared in this scope return t1.c < t2.c; ^ prim.cpp:56:31: error: 't2' was not declared in this scope return t1.c < t2.c; ^ prim.cpp: In function 'int main()': prim.cpp:17:32: warning: unused variable 'previousNode' [-Wunused-variable] int result = 0, index = 0, previousNode = 0; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _Compare = main()::__lambda0]' prim.cpp:57:14: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (Tuple&, Tuple&)' if (__comp(*__i, *__first)) ^ prim.cpp:54:41: note: candidates are: sort(pq.begin(), pq.end(), [](const auto& t1, ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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 prim.cpp:55:57: note: main()::__lambda0 const auto& t2) { ^ prim.cpp:55:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _Compare = main()::__lambda0]' prim.cpp:57:14: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (Tuple&, Tuple&)' if (__comp(*__i, *__first)) ^ prim.cpp:54:41: note: candidates are: sort(pq.begin(), pq.end(), [](const auto& t1, ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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 prim.cpp:55:57: note: main()::__lambda0 const auto& t2) { ^ prim.cpp:55:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _Compare = main()::__lambda0]' prim.cpp:57:14: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (Tuple&, Tuple&)' if (__comp(*__a, *__b)) ^ prim.cpp:54:41: note: candidates are: sort(pq.begin(), pq.end(), [](const auto& t1, ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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 prim.cpp:55:57: note: main()::__lambda0 const auto& t2) { ^ prim.cpp:55:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (Tuple&, Tuple&)' if (__comp(*__b, *__c)) ^ prim.cpp:54:41: note: candidates are: sort(pq.begin(), pq.end(), [](const auto& t1, ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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 prim.cpp:55:57: note: main()::__lambda0 const auto& t2) { ^ prim.cpp:55:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (Tuple&, Tuple&)' else if (__comp(*__a, *__c)) ^ prim.cpp:54:41: note: candidates are: sort(pq.begin(), pq.end(), [](const auto& t1, ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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 prim.cpp:55:57: note: main()::__lambda0 const auto& t2) { ^ prim.cpp:55:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (Tuple&, Tuple&)' else if (__comp(*__a, *__c)) ^ prim.cpp:54:41: note: candidates are: sort(pq.begin(), pq.end(), [](const auto& t1, ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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 prim.cpp:55:57: note: main()::__lambda0 const auto& t2) { ^ prim.cpp:55:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (Tuple&, Tuple&)' else if (__comp(*__b, *__c)) ^ prim.cpp:54:41: note: candidates are: sort(pq.begin(), pq.end(), [](const auto& t1, ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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 prim.cpp:55:57: note: main()::__lambda0 const auto& t2) { ^ prim.cpp:55:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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<Tuple*, std::vector<Tuple> >; _Tp = Tuple; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _Compare = main()::__lambda0]' prim.cpp:57:14: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (Tuple&, const Tuple&)' while (__comp(*__first, __pivot)) ^ prim.cpp:54:41: note: candidates are: sort(pq.begin(), pq.end(), [](const auto& t1, ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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 prim.cpp:55:57: note: main()::__lambda0 const auto& t2) { ^ prim.cpp:55:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const Tuple&, Tuple&)' while (__comp(__pivot, *__last)) ^ prim.cpp:54:41: note: candidates are: sort(pq.begin(), pq.end(), [](const auto& t1, ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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 prim.cpp:55:57: note: main()::__lambda0 const auto& t2) { ^ prim.cpp:55: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 prim.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<Tuple*, std::vector<Tuple> >; _Distance = int; _Tp = Tuple; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _Compare = main()::__lambda0]' prim.cpp:57:14: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (Tuple&, Tuple&)' *(__first + (__secondChild - 1)))) ^ prim.cpp:54:41: note: candidates are: sort(pq.begin(), pq.end(), [](const auto& t1, ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from prim.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 prim.cpp:55:57: note: main()::__lambda0 const auto& t2) { ^ prim.cpp:55:57: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from prim.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<Tuple*, std::vector<Tuple> >; _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 prim.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<Tuple*, std::vector<Tuple> >; _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<Tuple*, std::vector<Tuple> >; _Distance = int; _Tp = Tuple; _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 Prim 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ă.