Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #63117061
Rezumat problemă
#4785
Se consideră şirul crescător 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, ..., în care fiecare număr natural nenul i apare de 2i-1 ori. Elementele unei matrice A cu M linii şi N coloane au valori astfel încât, parcurgând matricea de sus în jos, pe linii, și de la stânga la dreapta pe fiecare linie, se obțin primii M x N termeni ai șirului precizat. O submatrice a lui A este definită de patru valori, l1, c1, l2, c2 şi este formată din elementele Ai,j cu proprietatea că l1 ≤ i ≤ l2 și c1 ≤ j ≤ c2. Determinaţi suma elementelor pentru fiecare dintre Q submatrice date ale lui A.
OJI 2025, clasa a 9-a
Pracsiu Dan (dnprx) Detalii
| Problema | summat | Operații I/O |
summat.in/summat.out
|
|---|---|---|---|
| Limita timp | 0.9 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #63117061 | Utilizator |
Baragan Andrei (elev01)
|
| Fișier | summat.cpp | Dimensiune | 2.40 KB |
| Data încărcării | 15 Februarie 2026, 15:44 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
summat.cpp:36:8: error: redefinition of 'struct Range' struct Range { ^ summat.cpp:32:8: error: previous definition of 'struct Range' struct Range { ^ summat.cpp: In function 'std::vector<Range> mergeRanges(std::vector<Range>)': summat.cpp:43:39: error: parameter declared 'auto' sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:48: error: parameter declared 'auto' sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp: In lambda function: summat.cpp:44:16: error: 'x' was not declared in this scope return x.a < y.a; ^ summat.cpp:44:22: error: 'y' was not declared in this scope return x.a < y.a; ^ 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 summat.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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__lambda4]' summat.cpp:45:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(mergeRanges(std::vector<Range>)::__lambda4) (Range&, Range&)' if (__comp(*__i, *__first)) ^ summat.cpp:43:31: note: candidates are: sort(v.begin(), v.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 summat.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 summat.cpp:43:49: note: mergeRanges(std::vector<Range>)::__lambda4 sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:49: 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 summat.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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Size = int; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__lambda4]' summat.cpp:45:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(mergeRanges(std::vector<Range>)::__lambda4) (Range&, Range&)' if (__comp(*__i, *__first)) ^ summat.cpp:43:31: note: candidates are: sort(v.begin(), v.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 summat.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 summat.cpp:43:49: note: mergeRanges(std::vector<Range>)::__lambda4 sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:49: 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 summat.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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Size = int; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__lambda4]' summat.cpp:45:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(mergeRanges(std::vector<Range>)::__lambda4) (Range&, Range&)' if (__comp(*__a, *__b)) ^ summat.cpp:43:31: note: candidates are: sort(v.begin(), v.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 summat.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 summat.cpp:43:49: note: mergeRanges(std::vector<Range>)::__lambda4 sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:49: 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 summat.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(mergeRanges(std::vector<Range>)::__lambda4) (Range&, Range&)' if (__comp(*__b, *__c)) ^ summat.cpp:43:31: note: candidates are: sort(v.begin(), v.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 summat.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 summat.cpp:43:49: note: mergeRanges(std::vector<Range>)::__lambda4 sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:49: 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 summat.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(mergeRanges(std::vector<Range>)::__lambda4) (Range&, Range&)' else if (__comp(*__a, *__c)) ^ summat.cpp:43:31: note: candidates are: sort(v.begin(), v.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 summat.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 summat.cpp:43:49: note: mergeRanges(std::vector<Range>)::__lambda4 sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:49: 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 summat.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(mergeRanges(std::vector<Range>)::__lambda4) (Range&, Range&)' else if (__comp(*__a, *__c)) ^ summat.cpp:43:31: note: candidates are: sort(v.begin(), v.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 summat.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 summat.cpp:43:49: note: mergeRanges(std::vector<Range>)::__lambda4 sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:49: 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 summat.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(mergeRanges(std::vector<Range>)::__lambda4) (Range&, Range&)' else if (__comp(*__b, *__c)) ^ summat.cpp:43:31: note: candidates are: sort(v.begin(), v.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 summat.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 summat.cpp:43:49: note: mergeRanges(std::vector<Range>)::__lambda4 sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:49: 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 summat.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<Range*, std::vector<Range> >; _Tp = Range; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Size = int; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__lambda4]' summat.cpp:45:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(mergeRanges(std::vector<Range>)::__lambda4) (Range&, const Range&)' while (__comp(*__first, __pivot)) ^ summat.cpp:43:31: note: candidates are: sort(v.begin(), v.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 summat.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 summat.cpp:43:49: note: mergeRanges(std::vector<Range>)::__lambda4 sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:49: 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 summat.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(mergeRanges(std::vector<Range>)::__lambda4) (const Range&, Range&)' while (__comp(__pivot, *__last)) ^ summat.cpp:43:31: note: candidates are: sort(v.begin(), v.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 summat.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 summat.cpp:43:49: note: mergeRanges(std::vector<Range>)::__lambda4 sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:49: 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 summat.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<Range*, std::vector<Range> >; _Distance = int; _Tp = Range; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Size = int; _Compare = mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__lambda4]' summat.cpp:45:6: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(mergeRanges(std::vector<Range>)::__lambda4) (Range&, Range&)' *(__first + (__secondChild - 1)))) ^ summat.cpp:43:31: note: candidates are: sort(v.begin(), v.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 summat.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 summat.cpp:43:49: note: mergeRanges(std::vector<Range>)::__lambda4 sort(v.begin(), v.end(), [](auto &x, auto &y){ ^ summat.cpp:43:49: 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 summat.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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__lambda4]', declared using local type 'mergeRanges(std::vector<Range>)::__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 summat.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<Range*, std::vector<Range> >; _Compare = mergeRanges(std::vector<Range>)::__lambda4]', declared using local type 'mergeRanges(std::vector<Range>)::__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<Range*, std::vector<Range> >; _Distance = int; _Tp = Range; _Compare = mergeRanges(std::vector<Range>)::__lambda4]', declared using local type 'mergeRanges(std::vector<Range>)::__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 summat 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ă.