Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #41300004
Rezumat problemă
#2022
gard1
Vrăjitorul Arpsod este deranjat la culme de câinii vecinului. Aceștia au prostul obicei de a veni să-și îngroape oasele în curtea vrăjitorului. Înainte de a lua măsuri drastice împotriva vecinului, Arpsod a decis să construiască un gard despărțitor între cele două curți. Gardul poate fi privit ca un segment de dreaptă de lungime N metri. Astfel, Arpsod a angajat K meseriași pentru a-i construi gardul. Fiind un tărâm cât se poate de democratic, fiecare muncitor a decis că el este dispus să construiască doar o parte din gard pornind de la al x-lea metru și pană la al y-lea metru inclusiv. Fiecare meseriaș cere o anumită sumă de bani pentru lucrarea sa.
Arpsod poate decide să angajeze o parte dintre muncitori, pentru a realiza întregul gard. Dacă doi muncitori angajați au de construit o porțiune comună a gardului, ea va fi lucrată de amândoi, dar fiecare își va primi integral suma solicitată.
Ajutați-l pe Arpsod să-și aleagă meseriașii astfel încât gardul să fie construit integral și el să plătească o sumă minimă de bani.
Empowersoft 2017
- Fișiere
-
Razvan Turtu (DysKode)
- Cristian Dospra
- concurs
Detalii
| Problema | gard1 | Operații I/O |
gard1.in/gard1.out
|
|---|---|---|---|
| Limita timp | 0.4 secunde | Limita memorie |
Total: 16 MB
/
Stivă 4 MB
|
| Id soluție | #41300004 | Utilizator |
Pirtac Eduard (ezluci)
|
| Fișier | gard1.cpp | Dimensiune | 2.81 KB |
| Data încărcării | 18 Ianuarie 2023, 16:44 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
gard1.cpp: In function 'void updateIntervalAint(int, int, long long int, int, int, int)': gard1.cpp:57:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses] int mj = st+dr >> 1; ^ gard1.cpp: In function 'long long int queryElementAint(int, int, int, int)': gard1.cpp:86:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses] int mj = st+dr >> 1; ^ gard1.cpp: In function 'int main()': gard1.cpp:105:33: error: parameter declared 'auto' sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:41: error: parameter declared 'auto' sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp: In lambda function: gard1.cpp:106:22: error: 'a' was not declared in this scope return (get<1>(a) < get<1>(b)); ^ gard1.cpp:106:34: error: 'b' was not declared in this scope return (get<1>(a) < get<1>(b)); ^ 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 gard1.cpp:6: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _Compare = main()::__lambda4]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::tuple<int, int, int>*; _Compare = main()::__lambda4]' gard1.cpp:107:5: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda4) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' if (__comp(*__i, *__first)) ^ gard1.cpp:105:26: note: candidates are: sort(v + 1, v + k+1, [](auto a, auto b) { ^ 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 gard1.cpp:6: /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 gard1.cpp:105:42: note: main()::__lambda4 sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:42: 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 gard1.cpp:6: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _Compare = main()::__lambda4]' gard1.cpp:107:5: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda4) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' if (__comp(*__i, *__first)) ^ gard1.cpp:105:26: note: candidates are: sort(v + 1, v + k+1, [](auto a, auto b) { ^ 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 gard1.cpp:6: /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 gard1.cpp:105:42: note: main()::__lambda4 sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:42: 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 gard1.cpp:6: /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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _Compare = main()::__lambda4]' gard1.cpp:107:5: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda4) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' if (__comp(*__a, *__b)) ^ gard1.cpp:105:26: note: candidates are: sort(v + 1, v + k+1, [](auto a, auto b) { ^ 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 gard1.cpp:6: /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 gard1.cpp:105:42: note: main()::__lambda4 sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:42: 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 gard1.cpp:6: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda4) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' if (__comp(*__b, *__c)) ^ gard1.cpp:105:26: note: candidates are: sort(v + 1, v + k+1, [](auto a, auto b) { ^ 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 gard1.cpp:6: /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 gard1.cpp:105:42: note: main()::__lambda4 sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:42: 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 gard1.cpp:6: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda4) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' else if (__comp(*__a, *__c)) ^ gard1.cpp:105:26: note: candidates are: sort(v + 1, v + k+1, [](auto a, auto b) { ^ 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 gard1.cpp:6: /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 gard1.cpp:105:42: note: main()::__lambda4 sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:42: 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 gard1.cpp:6: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda4) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' else if (__comp(*__a, *__c)) ^ gard1.cpp:105:26: note: candidates are: sort(v + 1, v + k+1, [](auto a, auto b) { ^ 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 gard1.cpp:6: /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 gard1.cpp:105:42: note: main()::__lambda4 sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:42: 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 gard1.cpp:6: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda4) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' else if (__comp(*__b, *__c)) ^ gard1.cpp:105:26: note: candidates are: sort(v + 1, v + k+1, [](auto a, auto b) { ^ 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 gard1.cpp:6: /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 gard1.cpp:105:42: note: main()::__lambda4 sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:42: 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 gard1.cpp:6: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = std::tuple<int, int, int>*; _Tp = std::tuple<int, int, int>; _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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _Compare = main()::__lambda4]' gard1.cpp:107:5: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda4) (std::tuple<int, int, int>&, const std::tuple<int, int, int>&)' while (__comp(*__first, __pivot)) ^ gard1.cpp:105:26: note: candidates are: sort(v + 1, v + k+1, [](auto a, auto b) { ^ 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 gard1.cpp:6: /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 gard1.cpp:105:42: note: main()::__lambda4 sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:42: 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 gard1.cpp:6: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda4) (const std::tuple<int, int, int>&, std::tuple<int, int, int>&)' while (__comp(__pivot, *__last)) ^ gard1.cpp:105:26: note: candidates are: sort(v + 1, v + k+1, [](auto a, auto b) { ^ 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 gard1.cpp:6: /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 gard1.cpp:105:42: note: main()::__lambda4 sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:42: 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 gard1.cpp:6: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = std::tuple<int, int, int>*; _Distance = int; _Tp = std::tuple<int, int, int>; _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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _Compare = main()::__lambda4]' gard1.cpp:107:5: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda4) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' *(__first + (__secondChild - 1)))) ^ gard1.cpp:105:26: note: candidates are: sort(v + 1, v + k+1, [](auto a, auto b) { ^ 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 gard1.cpp:6: /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 gard1.cpp:105:42: note: main()::__lambda4 sort(v + 1, v + k+1, [](auto a, auto b) { ^ gard1.cpp:105:42: 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 gard1.cpp:6: /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 = std::tuple<int, int, int>*; _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 gard1.cpp:6: /usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::tuple<int, int, int>*; _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 = std::tuple<int, int, int>*; _Distance = int; _Tp = std::tuple<int, int, int>; _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 gard1 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ă.