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

Detalii evaluare #57579783

Rezumat problemă

experimente

#4816

Dexter și-a deschis un laborator nou în care vrea să efectueze o serie de experimente pe șoareci pentru a descoperi leacul pentru cancer. În laborator există N șoareci, care se află așezați într-un cerc și sunt numerotați în ordine de la 0 la N-1. Dexter efectuează, pe rând, M experimente. Pentru fiecare experiment șoarecii care participă la al i-lea experiment formează întotdeauna un interval continuu, exprimat sub forma unei perechi de numere (S[i], F[i]), având semnificația:

  • dacă S[i] ≤ F[i], atunci șoarecii S[i], S[i]+1, ..., F[i] participă la experimentul i;
  • dacă S[i] > F[i], atunci șoarecii S[i], S[i]+1, ..., N-2, N-1, 0, ..., F[i] participă la experimentul i.

La fiecare pas, Dexter vrea să știe câți din cei N șoareci au participat la toate experimentele efectuate până atunci. Altfel spus, după fiecare al i-lea experiment efectuat, să se determine numărul de șoareci care au participat la toate experimentele 1, 2, ..., i.

OJI 2025, clasele 11-12

Fișiere Pracsiu Dan (dnprx) Andrei Grigorean concurs
Clasa 11 Structuri de date arborescente Structuri de date
Rezolvă

Detalii

Problema experimente Operații I/O experimente.in/experimente.out
Limita timp 1 secunde Limita memorie Total: 256 MB / Stivă 64 MB
Id soluție #57579783 Utilizator Ioja Andrei Iosif (andiosif14)
Fișier experimente.cpp Dimensiune 4.85 KB
Data încărcării 06 Aprilie 2025, 00:10 Scor / rezultat Eroare de compilare

Evaluare

Mesaj compilare

experimente.cpp: In function 'std::set<Interval> unite(const std::set<Interval>&, const std::set<Interval>&)':
experimente.cpp:66:43: error: parameter declared 'auto'
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                           ^
experimente.cpp:66:52: error: parameter declared 'auto'
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                    ^
experimente.cpp: In lambda function:
experimente.cpp:67:16: error: 'x' was not declared in this scope
         return x.l < y.l;

                ^
experimente.cpp:67:22: error: 'y' was not declared in this scope
         return x.l < y.l;

                      ^
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 experimente.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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4]'
experimente.cpp:68:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4) (Interval&, Interval&)'
    if (__comp(*__i, *__first))
                             ^
experimente.cpp:66:35: note: candidates are:
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                   ^
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 experimente.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
experimente.cpp:66:53: note: unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                     ^
experimente.cpp:66:53: 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 experimente.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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Size = int; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4]'
experimente.cpp:68:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4) (Interval&, Interval&)'
  if (__comp(*__i, *__first))
                           ^
experimente.cpp:66:35: note: candidates are:
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                   ^
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 experimente.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
experimente.cpp:66:53: note: unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                     ^
experimente.cpp:66:53: 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 experimente.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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Size = int; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4]'
experimente.cpp:68:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4) (Interval&, Interval&)'
       if (__comp(*__a, *__b))
                            ^
experimente.cpp:66:35: note: candidates are:
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                   ^
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 experimente.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
experimente.cpp:66:53: note: unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                     ^
experimente.cpp:66:53: 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 experimente.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4) (Interval&, Interval&)'
    if (__comp(*__b, *__c))
                         ^
experimente.cpp:66:35: note: candidates are:
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                   ^
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 experimente.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
experimente.cpp:66:53: note: unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                     ^
experimente.cpp:66:53: 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 experimente.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4) (Interval&, Interval&)'
    else if (__comp(*__a, *__c))
                              ^
experimente.cpp:66:35: note: candidates are:
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                   ^
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 experimente.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
experimente.cpp:66:53: note: unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                     ^
experimente.cpp:66:53: 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 experimente.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4) (Interval&, Interval&)'
       else if (__comp(*__a, *__c))
                                 ^
experimente.cpp:66:35: note: candidates are:
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                   ^
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 experimente.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
experimente.cpp:66:53: note: unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                     ^
experimente.cpp:66:53: 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 experimente.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4) (Interval&, Interval&)'
       else if (__comp(*__b, *__c))
                                 ^
experimente.cpp:66:35: note: candidates are:
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                   ^
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 experimente.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
experimente.cpp:66:53: note: unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                     ^
experimente.cpp:66:53: 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 experimente.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<Interval*, std::vector<Interval> >; _Tp = Interval; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Size = int; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4]'
experimente.cpp:68:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4) (Interval&, const Interval&)'
    while (__comp(*__first, __pivot))
                                   ^
experimente.cpp:66:35: note: candidates are:
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                   ^
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 experimente.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
experimente.cpp:66:53: note: unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                     ^
experimente.cpp:66:53: 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 experimente.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4) (const Interval&, Interval&)'
    while (__comp(__pivot, *__last))
                                  ^
experimente.cpp:66:35: note: candidates are:
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                   ^
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 experimente.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
experimente.cpp:66:53: note: unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                     ^
experimente.cpp:66:53: 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 experimente.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<Interval*, std::vector<Interval> >; _Distance = int; _Tp = Interval; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Size = int; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4]'
experimente.cpp:68:6:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4) (Interval&, Interval&)'
        *(__first + (__secondChild - 1))))
                                        ^
experimente.cpp:66:35: note: candidates are:
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                   ^
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 experimente.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
experimente.cpp:66:53: note: unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4
     sort(all.begin(), all.end(), [](auto &x, auto &y){

                                                     ^
experimente.cpp:66:53: 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 experimente.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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4]', declared using local type 'unite(const std::set<Interval>&, const std::set<Interval>&)::__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 experimente.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<Interval*, std::vector<Interval> >; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4]', declared using local type 'unite(const std::set<Interval>&, const std::set<Interval>&)::__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<Interval*, std::vector<Interval> >; _Distance = int; _Tp = Interval; _Compare = unite(const std::set<Interval>&, const std::set<Interval>&)::__lambda4]', declared using local type 'unite(const std::set<Interval>&, const std::set<Interval>&)::__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 experimente 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!