Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #55022244
Rezumat problemă
#3085
fsecv
Se consideră un șir A format din N numere întregi, numerotate de la 1 la N. Numim secvență a șirului A orice succesiune de elemente consecutive din șir de forma A[i], A[i+1], …, A[j], cu 0 < i < j ≤ N. Fiind dat șirul A cu N numere întregi se cere să se răspundă la Q întrebări de forma: i j k (0 < i < j ≤ N). Pentru fiecare întrebare se cere să se determine câte numere din secvența A[i], …, A[j] au frecvența de apariții egală cu k.
Lot Național Juniori 2019
- Fișiere
-
Pracsiu Dan (dnprx)
- Eugen Nodea
- concurs
Detalii
| Problema | fsecv | Operații I/O |
fsecv.in/fsecv.out
|
|---|---|---|---|
| Limita timp | 0.4 secunde | Limita memorie |
Total: 128 MB
/
Stivă 8 MB
|
| Id soluție | #55022244 | Utilizator |
Iuoras Andrei (IuorasAndrei)
|
| Fișier | fsecv.cpp | Dimensiune | 4.55 KB |
| Data încărcării | 16 Decembrie 2024, 23:16 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
fsecv.cpp: In member function 'void Solution::mo()': fsecv.cpp:114:40: error: parameter declared 'auto' sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:55: error: parameter declared 'auto' sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp: In lambda function: fsecv.cpp:116:20: error: 'a' was not declared in this scope return make_pair(a.l / len, a.r) < make_pair(b.l / len, b.r); ^ fsecv.cpp:116:48: error: 'b' was not declared in this scope return make_pair(a.l / len, a.r) < make_pair(b.l / len, b.r); ^ fsecv.cpp: In member function 'void Solution::mo()': fsecv.cpp:131:12: error: expected unqualified-id before '[' token for(auto& [ql, qr, qk, qind, qans] : queries) ^ fsecv.cpp:131:12: error: expected ';' before '[' token fsecv.cpp:131:13: error: 'ql' was not declared in this scope for(auto& [ql, qr, qk, qind, qans] : queries) ^ fsecv.cpp:131:17: error: 'qr' was not declared in this scope for(auto& [ql, qr, qk, qind, qans] : queries) ^ fsecv.cpp:131:21: error: 'qk' was not declared in this scope for(auto& [ql, qr, qk, qind, qans] : queries) ^ fsecv.cpp:131:25: error: 'qind' was not declared in this scope for(auto& [ql, qr, qk, qind, qans] : queries) ^ fsecv.cpp:131:31: error: 'qans' was not declared in this scope for(auto& [ql, qr, qk, qind, qans] : queries) ^ fsecv.cpp: In lambda function: fsecv.cpp:131:37: error: expected '{' before ':' token for(auto& [ql, qr, qk, qind, qans] : queries) ^ fsecv.cpp: In member function 'void Solution::mo()': fsecv.cpp:131:37: error: expected ';' before ':' token fsecv.cpp:131:37: error: expected primary-expression before ':' token fsecv.cpp:131:37: error: expected ')' before ':' token fsecv.cpp:131:37: error: expected primary-expression before ':' token fsecv.cpp:131:37: error: expected ';' before ':' token fsecv.cpp:139:36: error: parameter declared 'auto' sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:51: error: parameter declared 'auto' sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp: In lambda function: fsecv.cpp:141:10: error: 'a' was not declared in this scope return a.ind < b.ind; ^ fsecv.cpp:141:18: error: 'b' was not declared in this scope return a.ind < b.ind; ^ fsecv.cpp: In member function 'void Solution::mo()': fsecv.cpp:119:5: warning: unused variable 'l' [-Wunused-variable] ll l = 0, r = -1, ans = 0; ^ fsecv.cpp:119:12: warning: unused variable 'r' [-Wunused-variable] ll l = 0, r = -1, ans = 0; ^ fsecv.cpp:119:20: warning: unused variable 'ans' [-Wunused-variable] ll l = 0, r = -1, ans = 0; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]': /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' fsecv.cpp:117:3: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(Solution::mo()::__lambda4) (Solution::Query&, Solution::Query&)' if (__comp(*__i, *__first)) ^ fsecv.cpp:114:26: note: candidate is: sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: Solution::mo()::__lambda4 sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]': /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' fsecv.cpp:142:3: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(Solution::mo()::__lambda8) (Solution::Query&, Solution::Query&)' if (__comp(*__i, *__first)) ^ fsecv.cpp:139:22: note: candidates are: sort(all(queries), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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 fsecv.cpp:139:52: note: Solution::mo()::__lambda8 sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:52: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]': /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Size = int; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' fsecv.cpp:117:3: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(Solution::mo()::__lambda4) (Solution::Query&, Solution::Query&)' if (__comp(*__i, *__first)) ^ fsecv.cpp:114:26: note: candidate is: sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: Solution::mo()::__lambda4 sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]': /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Size = int; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' fsecv.cpp:117:3: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(Solution::mo()::__lambda4) (Solution::Query&, Solution::Query&)' if (__comp(*__a, *__b)) ^ fsecv.cpp:114:26: note: candidate is: sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: Solution::mo()::__lambda4 sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(Solution::mo()::__lambda4) (Solution::Query&, Solution::Query&)' if (__comp(*__b, *__c)) ^ fsecv.cpp:114:26: note: candidate is: sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: Solution::mo()::__lambda4 sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(Solution::mo()::__lambda4) (Solution::Query&, Solution::Query&)' else if (__comp(*__a, *__c)) ^ fsecv.cpp:114:26: note: candidate is: sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: Solution::mo()::__lambda4 sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(Solution::mo()::__lambda4) (Solution::Query&, Solution::Query&)' else if (__comp(*__a, *__c)) ^ fsecv.cpp:114:26: note: candidate is: sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: Solution::mo()::__lambda4 sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(Solution::mo()::__lambda4) (Solution::Query&, Solution::Query&)' else if (__comp(*__b, *__c)) ^ fsecv.cpp:114:26: note: candidate is: sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: Solution::mo()::__lambda4 sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Tp = Solution::Query; _Compare = Solution::mo()::__lambda4]': /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Size = int; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' fsecv.cpp:117:3: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(Solution::mo()::__lambda4) (Solution::Query&, const Solution::Query&)' while (__comp(*__first, __pivot)) ^ fsecv.cpp:114:26: note: candidate is: sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: Solution::mo()::__lambda4 sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(Solution::mo()::__lambda4) (const Solution::Query&, Solution::Query&)' while (__comp(__pivot, *__last)) ^ fsecv.cpp:114:26: note: candidate is: sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: Solution::mo()::__lambda4 sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]': /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Size = int; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' fsecv.cpp:142:3: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(Solution::mo()::__lambda8) (Solution::Query&, Solution::Query&)' if (__comp(*__i, *__first)) ^ fsecv.cpp:139:22: note: candidates are: sort(all(queries), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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 fsecv.cpp:139:52: note: Solution::mo()::__lambda8 sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:52: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]': /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Size = int; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' fsecv.cpp:142:3: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(Solution::mo()::__lambda8) (Solution::Query&, Solution::Query&)' if (__comp(*__a, *__b)) ^ fsecv.cpp:139:22: note: candidates are: sort(all(queries), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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 fsecv.cpp:139:52: note: Solution::mo()::__lambda8 sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:52: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(Solution::mo()::__lambda8) (Solution::Query&, Solution::Query&)' if (__comp(*__b, *__c)) ^ fsecv.cpp:139:22: note: candidates are: sort(all(queries), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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 fsecv.cpp:139:52: note: Solution::mo()::__lambda8 sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:52: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(Solution::mo()::__lambda8) (Solution::Query&, Solution::Query&)' else if (__comp(*__a, *__c)) ^ fsecv.cpp:139:22: note: candidates are: sort(all(queries), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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 fsecv.cpp:139:52: note: Solution::mo()::__lambda8 sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:52: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(Solution::mo()::__lambda8) (Solution::Query&, Solution::Query&)' else if (__comp(*__a, *__c)) ^ fsecv.cpp:139:22: note: candidates are: sort(all(queries), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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 fsecv.cpp:139:52: note: Solution::mo()::__lambda8 sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:52: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(Solution::mo()::__lambda8) (Solution::Query&, Solution::Query&)' else if (__comp(*__b, *__c)) ^ fsecv.cpp:139:22: note: candidates are: sort(all(queries), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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 fsecv.cpp:139:52: note: Solution::mo()::__lambda8 sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:52: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Tp = Solution::Query; _Compare = Solution::mo()::__lambda8]': /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Size = int; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' fsecv.cpp:142:3: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(Solution::mo()::__lambda8) (Solution::Query&, const Solution::Query&)' while (__comp(*__first, __pivot)) ^ fsecv.cpp:139:22: note: candidates are: sort(all(queries), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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 fsecv.cpp:139:52: note: Solution::mo()::__lambda8 sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:52: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(Solution::mo()::__lambda8) (const Solution::Query&, Solution::Query&)' while (__comp(__pivot, *__last)) ^ fsecv.cpp:139:22: note: candidates are: sort(all(queries), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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 fsecv.cpp:139:52: note: Solution::mo()::__lambda8 sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:52: 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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Distance = int; _Tp = Solution::Query; _Compare = Solution::mo()::__lambda4]': /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Size = int; _Compare = Solution::mo()::__lambda4]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]' fsecv.cpp:117:3: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(Solution::mo()::__lambda4) (Solution::Query&, Solution::Query&)' *(__first + (__secondChild - 1)))) ^ fsecv.cpp:114:26: note: candidate is: sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: note: Solution::mo()::__lambda4 sort(all(queries), [&len](const auto& a, const auto& b) ^ fsecv.cpp:114:56: 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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Distance = int; _Tp = Solution::Query; _Compare = Solution::mo()::__lambda8]': /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Size = int; _Compare = Solution::mo()::__lambda8]' /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]' fsecv.cpp:142:3: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(Solution::mo()::__lambda8) (Solution::Query&, Solution::Query&)' *(__first + (__secondChild - 1)))) ^ fsecv.cpp:139:22: note: candidates are: sort(all(queries), [](const auto& a, const 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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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 fsecv.cpp:139:52: note: Solution::mo()::__lambda8 sort(all(queries), [](const auto& a, const auto& b) ^ fsecv.cpp:139:52: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]', declared using local type 'Solution::mo()::__lambda4', is used but never defined [-fpermissive] __unguarded_linear_insert(_RandomAccessIterator __last, ^ /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]', declared using local type 'Solution::mo()::__lambda8', is used but never defined [-fpermissive] In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from fsecv.cpp:1: /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda4]', declared using local type 'Solution::mo()::__lambda4', is used but never defined [-fpermissive] __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, ^ /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<Solution::Query*, std::vector<Solution::Query> >; _Compare = Solution::mo()::__lambda8]', declared using local type 'Solution::mo()::__lambda8', is used but never defined [-fpermissive] /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<Solution::Query*, std::vector<Solution::Query> >; _Distance = int; _Tp = Solution::Query; _Compare = Solution::mo()::__lambda4]', declared using local type 'Solution::mo()::__lambda4', is used but never defined [-fpermissive] __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, ^ /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<Solution::Query*, std::vector<Solution::Query> >; _Distance = int; _Tp = Solution::Query; _Compare = Solution::mo()::__lambda8]', declared using local type 'Solution::mo()::__lambda8', is used but never defined [-fpermissive]
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 fsecv 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ă.