Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #56461771
Rezumat problemă
raspandaci
#4768
De câte ori trebuie să transmită un mesaj URGENT!!! directorul şcolii noastre are o mare problemă. Indiferent de canalul de comunicare pe care îl foloseşte (e-mail, what’s app, site-ul şcolii etc.), întotdeauna vor exista elevi la care mesajul nu ajunge sau nu ajunge în timp util. După multe încercări, a decis să numeroteze cei n elevi din şcoală cu numere distincte de la 1 la n şi să studieze relaţiile de comunicare dintre elevi. Apoi, bazându-se pe aceste relaţii de comunicare, să aleagă un număr minim de elevi-răspândaci cărora să le transmită mesajul direct, urmând ca aceasta să fie transmis la absolut toţi elevii, prin relaţiile de comunicare dintre aceştia. Să se scrie un program care, cunoscând relaţiile de comunicare dintre elevi, determină numărul minim de răspândaci necesari pentru ca mesajul directorului să ajungă în timp util la toţi elevii din şcoală.
OMI 2025, clasele 11-12
Pracsiu Dan (dnprx) Detalii
| Problema | raspandaci | Operații I/O |
raspandaci.in/raspandaci.out
|
|---|---|---|---|
| Limita timp | 0.7 secunde | Limita memorie |
Total: 32 MB
/
Stivă 16 MB
|
| Id soluție | #56461771 | Utilizator |
Nicolae Luca (luca7)
|
| Fișier | raspandaci.cpp | Dimensiune | 1.01 KB |
| Data încărcării | 20 Februarie 2025, 10:59 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
raspandaci.cpp: In function 'int main()': raspandaci.cpp:39:38: error: parameter declared 'auto' sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:46: error: parameter declared 'auto' sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp: In lambda function: raspandaci.cpp:40:12: error: 'p1' was not declared in this scope if(p1.first == p2.first){ ^ raspandaci.cpp:40:24: error: 'p2' was not declared in this scope if(p1.first == p2.first){ ^ raspandaci.cpp:43:16: error: 'p1' was not declared in this scope return p1.first < p2.first; ^ raspandaci.cpp:43:27: error: 'p2' was not declared in this scope return p1.first < p2.first; ^ raspandaci.cpp: In function 'int main()': raspandaci.cpp:24:11: warning: unused variable 'j' [-Wunused-variable] int i,j,n,nr,u,v; ^ raspandaci.cpp:24:15: warning: unused variable 'nr' [-Wunused-variable] int i,j,n,nr,u,v; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' raspandaci.cpp:44:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__i, *__first)) ^ raspandaci.cpp:39:31: note: candidates are: sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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 raspandaci.cpp:39:48: note: main()::__lambda0 sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:48: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' raspandaci.cpp:44:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__i, *__first)) ^ raspandaci.cpp:39:31: note: candidates are: sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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 raspandaci.cpp:39:48: note: main()::__lambda0 sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:48: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' raspandaci.cpp:44:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__a, *__b)) ^ raspandaci.cpp:39:31: note: candidates are: sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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 raspandaci.cpp:39:48: note: main()::__lambda0 sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:48: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__b, *__c)) ^ raspandaci.cpp:39:31: note: candidates are: sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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 raspandaci.cpp:39:48: note: main()::__lambda0 sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:48: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__a, *__c)) ^ raspandaci.cpp:39:31: note: candidates are: sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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 raspandaci.cpp:39:48: note: main()::__lambda0 sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:48: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__a, *__c)) ^ raspandaci.cpp:39:31: note: candidates are: sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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 raspandaci.cpp:39:48: note: main()::__lambda0 sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:48: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__b, *__c)) ^ raspandaci.cpp:39:31: note: candidates are: sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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 raspandaci.cpp:39:48: note: main()::__lambda0 sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:48: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Tp = std::pair<int, int>; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' raspandaci.cpp:44:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, const std::pair<int, int>&)' while (__comp(*__first, __pivot)) ^ raspandaci.cpp:39:31: note: candidates are: sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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 raspandaci.cpp:39:48: note: main()::__lambda0 sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:48: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const std::pair<int, int>&, std::pair<int, int>&)' while (__comp(__pivot, *__last)) ^ raspandaci.cpp:39:31: note: candidates are: sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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 raspandaci.cpp:39:48: note: main()::__lambda0 sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:48: 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 raspandaci.cpp:2: /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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Distance = int; _Tp = std::pair<int, int>; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' raspandaci.cpp:44:6: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' *(__first + (__secondChild - 1)))) ^ raspandaci.cpp:39:31: note: candidates are: sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from raspandaci.cpp:2: /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 raspandaci.cpp:39:48: note: main()::__lambda0 sort(vp.begin(),vp.end(),[](auto p1,auto p2){ ^ raspandaci.cpp:39:48: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from raspandaci.cpp:2: /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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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 raspandaci.cpp:2: /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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Distance = int; _Tp = std::pair<int, int>; _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 raspandaci 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ă.