Rezumat problemă

fsecv

#3085

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

Clasa 9 Tablouri unidimensionale (vectori) Probleme cu secvențe Șmenul lui Batog (Square Root Decomposition) Algoritmul lui Mo

Rezolvă

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	#63489100	Utilizator	Arghira Radu (radeuoj)
Fișier	fsecv.cpp	Dimensiune	1.63 KB
Data încărcării	05 Martie 2026, 13:03	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from fsecv.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 = Query*; _Tp = Query; _Compare = read_and_sort_queries()::__lambda0]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = Query*; _Compare = read_and_sort_queries()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = Query*; _Size = int; _Compare = read_and_sort_queries()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = Query*; _Compare = read_and_sort_queries()::__lambda0]'
fsecv.cpp:34:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(read_and_sort_queries()::__lambda0) (Query&, const Query&)'
    while (__comp(*__first, __pivot))
                                   ^
fsecv.cpp:31:46: note: candidates are:
     std::sort(queries + 1, queries + q + 1, [](Query& a, Query& b) {

                                              ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from fsecv.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(Query&, Query&) <conversion>
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note:   candidate expects 3 arguments, 3 provided
fsecv.cpp:31:66: note: read_and_sort_queries()::__lambda0
     std::sort(queries + 1, queries + q + 1, [](Query& a, Query& b) {

                                                                  ^
fsecv.cpp:31:66: note:   no known conversion for argument 2 from 'const Query' to 'Query&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from fsecv.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(read_and_sort_queries()::__lambda0) (const Query&, Query&)'
    while (__comp(__pivot, *__last))
                                  ^
fsecv.cpp:31:46: note: candidates are:
     std::sort(queries + 1, queries + q + 1, [](Query& a, Query& b) {

                                              ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from fsecv.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(Query&, Query&) <conversion>
    while (__comp(__pivot, *__last))
                                  ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note:   candidate expects 3 arguments, 3 provided
fsecv.cpp:31:66: note: read_and_sort_queries()::__lambda0
     std::sort(queries + 1, queries + q + 1, [](Query& a, Query& b) {

                                                                  ^
fsecv.cpp:31:66: note:   no known conversion for argument 1 from 'const Query' to 'Query&'
fsecv.cpp: In function 'int main()':
fsecv.cpp:77:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen("fsecv.in", "r", stdin);

                                    ^
fsecv.cpp:78:38: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen("fsecv.out", "w", stdout);

                                      ^

Cum funcționează evaluarea?