Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #52896968
Rezumat problemă
#4712
aperm
Se consideră o matrice cu n linii și p coloane. Fiecare linie a matricei este o permutare a mulțimii {1, 2, ..., p}. Să se ordoneze lexicografic liniile matricei.
XOR 2015
- Fișiere
-
Pracsiu Dan (dnprx)
- Vlad-Laurențiu Nicu
- concurs
Detalii
| Problema | aperm | Operații I/O |
aperm.in/aperm.out
|
|---|---|---|---|
| Limita timp | 0.3 secunde | Limita memorie |
Total: 2 MB
/
Stivă 1 MB
|
| Id soluție | #52896968 | Utilizator |
Bostan George (bostan_george)
|
| Fișier | aperm.cpp | Dimensiune | 649 B |
| Data încărcării | 12 Octombrie 2024, 10:43 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
aperm.cpp: In function 'int main()': aperm.cpp:23:56: error: parameter declared 'auto' sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:63: error: parameter declared 'auto' sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp: In lambda function: aperm.cpp:23:73: error: 'a' was not declared in this scope sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:83: error: 'b' was not declared in this scope sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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<std::pair<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<int>, int> > >; _Compare = main()::__lambda0]' aperm.cpp:23:92: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (std::pair<std::vector<int>, int>&, std::pair<std::vector<int>, int>&)' if (__comp(*__i, *__first)) ^ aperm.cpp:23:49: note: candidates are: sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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 aperm.cpp:23:64: note: main()::__lambda0 sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:64: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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<std::pair<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<int>, int> > >; _Compare = main()::__lambda0]' aperm.cpp:23:92: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (std::pair<std::vector<int>, int>&, std::pair<std::vector<int>, int>&)' if (__comp(*__i, *__first)) ^ aperm.cpp:23:49: note: candidates are: sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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 aperm.cpp:23:64: note: main()::__lambda0 sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:64: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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<std::pair<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<int>, int> > >; _Compare = main()::__lambda0]' aperm.cpp:23:92: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (std::pair<std::vector<int>, int>&, std::pair<std::vector<int>, int>&)' if (__comp(*__a, *__b)) ^ aperm.cpp:23:49: note: candidates are: sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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 aperm.cpp:23:64: note: main()::__lambda0 sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:64: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (std::pair<std::vector<int>, int>&, std::pair<std::vector<int>, int>&)' if (__comp(*__b, *__c)) ^ aperm.cpp:23:49: note: candidates are: sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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 aperm.cpp:23:64: note: main()::__lambda0 sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:64: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (std::pair<std::vector<int>, int>&, std::pair<std::vector<int>, int>&)' else if (__comp(*__a, *__c)) ^ aperm.cpp:23:49: note: candidates are: sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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 aperm.cpp:23:64: note: main()::__lambda0 sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:64: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (std::pair<std::vector<int>, int>&, std::pair<std::vector<int>, int>&)' else if (__comp(*__a, *__c)) ^ aperm.cpp:23:49: note: candidates are: sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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 aperm.cpp:23:64: note: main()::__lambda0 sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:64: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (std::pair<std::vector<int>, int>&, std::pair<std::vector<int>, int>&)' else if (__comp(*__b, *__c)) ^ aperm.cpp:23:49: note: candidates are: sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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 aperm.cpp:23:64: note: main()::__lambda0 sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:64: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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<std::pair<std::vector<int>, int>*, std::vector<std::pair<std::vector<int>, int> > >; _Tp = std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<int>, int> > >; _Compare = main()::__lambda0]' aperm.cpp:23:92: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (std::pair<std::vector<int>, int>&, const std::pair<std::vector<int>, int>&)' while (__comp(*__first, __pivot)) ^ aperm.cpp:23:49: note: candidates are: sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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 aperm.cpp:23:64: note: main()::__lambda0 sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:64: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const std::pair<std::vector<int>, int>&, std::pair<std::vector<int>, int>&)' while (__comp(__pivot, *__last)) ^ aperm.cpp:23:49: note: candidates are: sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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 aperm.cpp:23:64: note: main()::__lambda0 sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:64: 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 aperm.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<std::pair<std::vector<int>, int>*, std::vector<std::pair<std::vector<int>, int> > >; _Distance = int; _Tp = std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<int>, int> > >; _Compare = main()::__lambda0]' aperm.cpp:23:92: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (std::pair<std::vector<int>, int>&, std::pair<std::vector<int>, int>&)' *(__first + (__secondChild - 1)))) ^ aperm.cpp:23:49: note: candidates are: sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from aperm.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 aperm.cpp:23:64: note: main()::__lambda0 sort(permutatii.begin(), permutatii.end(), [](auto a,auto b){return a.first < b.first;}); ^ aperm.cpp:23:64: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from aperm.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<std::pair<std::vector<int>, int>*, std::vector<std::pair<std::vector<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 aperm.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<std::pair<std::vector<int>, int>*, std::vector<std::pair<std::vector<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<std::vector<int>, int>*, std::vector<std::pair<std::vector<int>, int> > >; _Distance = int; _Tp = std::pair<std::vector<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 aperm 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ă.