Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #57646550
Rezumat problemă
Calafat
#1692
Se dă un șir format din N numere naturale. Pentru fiecare valoare distinctă dintr-o subsecvență cuprinsă între doi indici st si dr considerăm distanța dintre indicii primei și ultimei apariții ale acesteia în cadrul subsecvenței. Dându-se M subsecvențe de forma [st,dr], se cere să se calculeze suma distanțelor corespunzătoare tuturor valorilor distincte din subsecvență.
ONI 2016, clasele XI-XII
Candale Silviu (silviu) Detalii
| Problema | Calafat | Operații I/O |
calafat.in/calafat.out
|
|---|---|---|---|
| Limita timp | 1.5 secunde | Limita memorie |
Total: 64 MB
/
Stivă 64 MB
|
| Id soluție | #57646550 | Utilizator |
Nicolae Luca (luca7)
|
| Fișier | calafat.cpp | Dimensiune | 1.49 KB |
| Data încărcării | 08 Aprilie 2025, 21:17 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
calafat.cpp:38:1: error: 'unordered_map' does not name a type unordered_map<int,deque<int>> vpos; ^ calafat.cpp: In function 'int main()': calafat.cpp:50:13: error: 'vpos' was not declared in this scope if(!vpos[nr].empty()){ ^ calafat.cpp:53:9: error: 'vpos' was not declared in this scope vpos[nr].push_back(i); ^ calafat.cpp:61:48: error: parameter declared 'auto' sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:57: error: parameter declared 'auto' sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp: In lambda function: calafat.cpp:62:16: error: 'q1' was not declared in this scope return q1.l < q2.l; ^ calafat.cpp:62:23: error: 'q2' was not declared in this scope return q1.l < q2.l; ^ calafat.cpp: In function 'int main()': calafat.cpp:68:15: error: 'vpos' was not declared in this scope i=vpos[v[prev]].front(); ^ calafat.cpp:41:10: warning: unused variable 'j' [-Wunused-variable] ll i,j,n,m,nr,l,r,prev; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _Compare = main()::__lambda0]' calafat.cpp:63:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (Query&, Query&)' if (__comp(*__i, *__first)) ^ calafat.cpp:61:41: note: candidates are: sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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 calafat.cpp:61:59: note: main()::__lambda0 sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:59: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _Compare = main()::__lambda0]' calafat.cpp:63:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (Query&, Query&)' if (__comp(*__i, *__first)) ^ calafat.cpp:61:41: note: candidates are: sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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 calafat.cpp:61:59: note: main()::__lambda0 sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:59: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _Compare = main()::__lambda0]' calafat.cpp:63:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (Query&, Query&)' if (__comp(*__a, *__b)) ^ calafat.cpp:61:41: note: candidates are: sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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 calafat.cpp:61:59: note: main()::__lambda0 sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:59: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (Query&, Query&)' if (__comp(*__b, *__c)) ^ calafat.cpp:61:41: note: candidates are: sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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 calafat.cpp:61:59: note: main()::__lambda0 sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:59: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (Query&, Query&)' else if (__comp(*__a, *__c)) ^ calafat.cpp:61:41: note: candidates are: sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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 calafat.cpp:61:59: note: main()::__lambda0 sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:59: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (Query&, Query&)' else if (__comp(*__a, *__c)) ^ calafat.cpp:61:41: note: candidates are: sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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 calafat.cpp:61:59: note: main()::__lambda0 sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:59: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (Query&, Query&)' else if (__comp(*__b, *__c)) ^ calafat.cpp:61:41: note: candidates are: sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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 calafat.cpp:61:59: note: main()::__lambda0 sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:59: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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<Query*, std::vector<Query> >; _Tp = Query; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _Compare = main()::__lambda0]' calafat.cpp:63:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (Query&, const Query&)' while (__comp(*__first, __pivot)) ^ calafat.cpp:61:41: note: candidates are: sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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 calafat.cpp:61:59: note: main()::__lambda0 sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:59: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const Query&, Query&)' while (__comp(__pivot, *__last)) ^ calafat.cpp:61:41: note: candidates are: sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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 calafat.cpp:61:59: note: main()::__lambda0 sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:59: 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 calafat.cpp:5: /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<Query*, std::vector<Query> >; _Distance = int; _Tp = Query; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _Compare = main()::__lambda0]' calafat.cpp:63:6: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (Query&, Query&)' *(__first + (__secondChild - 1)))) ^ calafat.cpp:61:41: note: candidates are: sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from calafat.cpp:5: /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 calafat.cpp:61:59: note: main()::__lambda0 sort(queries.begin(),queries.end(),[](auto q1, auto q2) { ^ calafat.cpp:61:59: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from calafat.cpp:5: /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<Query*, std::vector<Query> >; _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 calafat.cpp:5: /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<Query*, std::vector<Query> >; _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<Query*, std::vector<Query> >; _Distance = int; _Tp = Query; _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 Calafat 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ă.