Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.

Detalii evaluare #58670048

Rezumat problemă

vsecvente
#2510

Considerăm un șir de numere naturale nenule a[1], a[2], …, a[n]. În acest șir o V-secvență este o secvență maximală de forma a[x], a[x+1], …, a[y] cu proprietatea că toate numerele din secvență au valori mai mici sau egale cu V. Este maximală pentru că nu poate fi extinsă spre stânga sau spre dreapta. De exemplu, șirul a = 2, 2, 6, 4, 3, 14, 7, 4, 3, 36 are două 7-secvențe: 2, 2, 6, 4, 3 și 7, 4, 3. De asemenea, șirul are trei 4-secvențe: 2,2; 4,3; 4,3. De notat că 2,6,4,3 nu este 7-secvență, deoarece poate fi extinsă la capătul său stâng cu numărul 2.
Pentru un șir de numere dat, trebuie să răspundeți la Q întrebări notate V[1], V[2],…, V[Q]. Pentru fiecare întrebare i, dată prin numărul natural V[i], trebuie să aflați câte V[i]-secvențe sunt în șir.

Lot juniori Câmpulung Muscel, 2018
Fișiere Pracsiu Dan (dnprx) Dana Lica concurs
Clasa 9 Tablouri unidimensionale (vectori) Probleme cu secvențe Păduri de mulțimi disjuncte
Rezolvă

Detalii

Problema vsecvente Operații I/O vsecvente.in/vsecvente.out
Limita timp 0.3 secunde Limita memorie Total: 8 MB / Stivă 8 MB
Id soluție #58670048 Utilizator Info enjoyer (pregatireoji)
Fișier vsecvente.cpp Dimensiune 1.40 KB
Data încărcării 14 Iulie 2025, 02:57 Scor/rezultat Eroare de compilare

Evaluare

Mesaj compilare

vsecvente.cpp: In function 'int main()':
vsecvente.cpp:33:49: error: parameter declared 'auto'
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                 ^
vsecvente.cpp:33:66: error: parameter declared 'auto'
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                  ^
vsecvente.cpp: In lambda function:
vsecvente.cpp:34:16: error: 'lhs' was not declared in this scope
         return lhs[0].to_ulong() < rhs[0].to_ulong();

                ^
vsecvente.cpp:34:36: error: 'rhs' was not declared in this scope
         return lhs[0].to_ulong() < rhs[0].to_ulong();

                                    ^
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 vsecvente.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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__lambda4]'
vsecvente.cpp:35:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda4) (std::array<std::bitset<22u>, 2u>&, std::array<std::bitset<22u>, 2u>&)'
    if (__comp(*__i, *__first))
                             ^
vsecvente.cpp:33:35: note: candidates are:
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                   ^
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 vsecvente.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
vsecvente.cpp:33:69: note: main()::__lambda4
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                     ^
vsecvente.cpp:33:69: 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 vsecvente.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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Size = int; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__lambda4]'
vsecvente.cpp:35:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda4) (std::array<std::bitset<22u>, 2u>&, std::array<std::bitset<22u>, 2u>&)'
  if (__comp(*__i, *__first))
                           ^
vsecvente.cpp:33:35: note: candidates are:
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                   ^
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 vsecvente.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
vsecvente.cpp:33:69: note: main()::__lambda4
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                     ^
vsecvente.cpp:33:69: 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 vsecvente.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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Size = int; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__lambda4]'
vsecvente.cpp:35:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda4) (std::array<std::bitset<22u>, 2u>&, std::array<std::bitset<22u>, 2u>&)'
       if (__comp(*__a, *__b))
                            ^
vsecvente.cpp:33:35: note: candidates are:
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                   ^
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 vsecvente.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
vsecvente.cpp:33:69: note: main()::__lambda4
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                     ^
vsecvente.cpp:33:69: 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 vsecvente.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda4) (std::array<std::bitset<22u>, 2u>&, std::array<std::bitset<22u>, 2u>&)'
    if (__comp(*__b, *__c))
                         ^
vsecvente.cpp:33:35: note: candidates are:
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                   ^
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 vsecvente.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
vsecvente.cpp:33:69: note: main()::__lambda4
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                     ^
vsecvente.cpp:33:69: 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 vsecvente.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda4) (std::array<std::bitset<22u>, 2u>&, std::array<std::bitset<22u>, 2u>&)'
    else if (__comp(*__a, *__c))
                              ^
vsecvente.cpp:33:35: note: candidates are:
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                   ^
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 vsecvente.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
vsecvente.cpp:33:69: note: main()::__lambda4
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                     ^
vsecvente.cpp:33:69: 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 vsecvente.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda4) (std::array<std::bitset<22u>, 2u>&, std::array<std::bitset<22u>, 2u>&)'
       else if (__comp(*__a, *__c))
                                 ^
vsecvente.cpp:33:35: note: candidates are:
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                   ^
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 vsecvente.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
vsecvente.cpp:33:69: note: main()::__lambda4
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                     ^
vsecvente.cpp:33:69: 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 vsecvente.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda4) (std::array<std::bitset<22u>, 2u>&, std::array<std::bitset<22u>, 2u>&)'
       else if (__comp(*__b, *__c))
                                 ^
vsecvente.cpp:33:35: note: candidates are:
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                   ^
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 vsecvente.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
vsecvente.cpp:33:69: note: main()::__lambda4
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                     ^
vsecvente.cpp:33:69: 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 vsecvente.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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Tp = std::array<std::bitset<22u>, 2u>; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Size = int; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__lambda4]'
vsecvente.cpp:35:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda4) (std::array<std::bitset<22u>, 2u>&, const std::array<std::bitset<22u>, 2u>&)'
    while (__comp(*__first, __pivot))
                                   ^
vsecvente.cpp:33:35: note: candidates are:
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                   ^
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 vsecvente.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
vsecvente.cpp:33:69: note: main()::__lambda4
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                     ^
vsecvente.cpp:33:69: 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 vsecvente.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda4) (const std::array<std::bitset<22u>, 2u>&, std::array<std::bitset<22u>, 2u>&)'
    while (__comp(__pivot, *__last))
                                  ^
vsecvente.cpp:33:35: note: candidates are:
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                   ^
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 vsecvente.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
vsecvente.cpp:33:69: note: main()::__lambda4
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                     ^
vsecvente.cpp:33:69: 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 vsecvente.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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Distance = int; _Tp = std::array<std::bitset<22u>, 2u>; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Size = int; _Compare = main()::__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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__lambda4]'
vsecvente.cpp:35:6:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda4) (std::array<std::bitset<22u>, 2u>&, std::array<std::bitset<22u>, 2u>&)'
        *(__first + (__secondChild - 1))))
                                        ^
vsecvente.cpp:33:35: note: candidates are:
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                   ^
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 vsecvente.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
vsecvente.cpp:33:69: note: main()::__lambda4
     sort(poz.begin(), poz.end(), [](const auto &lhs, const auto &rhs) {

                                                                     ^
vsecvente.cpp:33:69: 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 vsecvente.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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', 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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from vsecvente.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<std::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', 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::array<std::bitset<22u>, 2u>*, std::vector<std::array<std::bitset<22u>, 2u> > >; _Distance = int; _Tp = std::array<std::bitset<22u>, 2u>; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', 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 vsecvente 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ă.

Du-te sus!