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

Fișiere Candale Silviu (silviu) Denis-Gabriel Mită concurs

Clasa 11 Probleme diverse Probleme diverse Arbori de intervale Arbori indexați binar Șmenul lui Batog (Square Root Decomposition)

Rezolvă

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	#57643826	Utilizator	Nicolae Luca (luca7)
Fișier	calafat.cpp	Dimensiune	1.46 KB
Data încărcării	08 Aprilie 2025, 19:27	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

calafat.cpp: In function 'int main()':
calafat.cpp:39: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:4:
/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:62: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:60:41: note: candidates are:
     sort(queries.begin(),queries.end(),[](Query& q1,Query& q2){

                                         ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from calafat.cpp:4:
/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
calafat.cpp:60:62: note: main()::__lambda0
     sort(queries.begin(),queries.end(),[](Query& q1,Query& q2){

                                                              ^
calafat.cpp:60:62: 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 calafat.cpp:4:
/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:60:41: note: candidates are:
     sort(queries.begin(),queries.end(),[](Query& q1,Query& q2){

                                         ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from calafat.cpp:4:
/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
calafat.cpp:60:62: note: main()::__lambda0
     sort(queries.begin(),queries.end(),[](Query& q1,Query& q2){

                                                              ^
calafat.cpp:60:62: note:   no known conversion for argument 1 from 'const Query' to 'Query&'

Cum funcționează evaluarea?