Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #15452887
Rezumat problemă
#2478
laser
Determinaţi costul total minim al segmentelor care pot fi alese pentru a obtura orice fascicul de lumină care
ar pleca din origine către un punct cu ordonata pozitivă.
ONIG 2018
- Fișiere
-
Costache Radu - Mihai (radu_msk)
- Daniela Lica
- concurs
Detalii
| Problema | laser | Operații I/O |
laser.in/laser.out
|
|---|---|---|---|
| Limita timp | 1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 32 MB
|
| Id soluție | #15452887 | Utilizator |
Ardelean Alexandru (AlexAlexardelean)
|
| Fișier | laser.cpp | Dimensiune | 1.47 KB |
| Data încărcării | 15 Aprilie 2019, 17:14 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
laser.cpp: In function 'int main()': laser.cpp:43:48: error: parameter declared 'auto' sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:56: error: parameter declared 'auto' sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp: In lambda function: laser.cpp:44:13: error: 'a' was not declared in this scope if (a.dr == b.dr) ^ laser.cpp:44:21: error: 'b' was not declared in this scope if (a.dr == b.dr) ^ laser.cpp:46:16: error: 'a' was not declared in this scope return a.dr > b.dr; ^ laser.cpp:46:23: error: 'b' was not declared in this scope return a.dr > b.dr; ^ laser.cpp: In function 'int main()': laser.cpp:48:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i < d_alea.size(); ++i) { ^ laser.cpp:53:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (r + pas < d_alea.size() && d_alea[r + pas].dr + EPS < d_alea[i].st) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]': /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]' /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]' laser.cpp:47:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (blocaj&, blocaj&)' if (__comp(*__i, *__first)) ^ laser.cpp:43:41: note: candidates are: sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: bool (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 1 argument, 3 provided laser.cpp:43:62: note: main()::__lambda0 sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:62: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]': /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]' /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<blocaj*, std::vector<blocaj> >; _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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]' laser.cpp:47:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (blocaj&, blocaj&)' if (__comp(*__i, *__first)) ^ laser.cpp:43:41: note: candidates are: sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: bool (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 1 argument, 3 provided laser.cpp:43:62: note: main()::__lambda0 sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:62: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]': /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<blocaj*, std::vector<blocaj> >; _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<blocaj*, std::vector<blocaj> >; _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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]' laser.cpp:47:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (blocaj&, blocaj&)' if (__comp(*__a, *__b)) ^ laser.cpp:43:41: note: candidates are: sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: bool (*)() <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 1 argument, 3 provided laser.cpp:43:62: note: main()::__lambda0 sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:62: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (blocaj&, blocaj&)' if (__comp(*__b, *__c)) ^ laser.cpp:43:41: note: candidates are: sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: bool (*)() <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 1 argument, 3 provided laser.cpp:43:62: note: main()::__lambda0 sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:62: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (blocaj&, blocaj&)' else if (__comp(*__a, *__c)) ^ laser.cpp:43:41: note: candidates are: sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: bool (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 1 argument, 3 provided laser.cpp:43:62: note: main()::__lambda0 sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:62: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (blocaj&, blocaj&)' else if (__comp(*__a, *__c)) ^ laser.cpp:43:41: note: candidates are: sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: bool (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 1 argument, 3 provided laser.cpp:43:62: note: main()::__lambda0 sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:62: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (blocaj&, blocaj&)' else if (__comp(*__b, *__c)) ^ laser.cpp:43:41: note: candidates are: sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: bool (*)() <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 1 argument, 3 provided laser.cpp:43:62: note: main()::__lambda0 sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:62: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /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<blocaj*, std::vector<blocaj> >; _Tp = blocaj; _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<blocaj*, std::vector<blocaj> >; _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<blocaj*, std::vector<blocaj> >; _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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]' laser.cpp:47:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (blocaj&, const blocaj&)' while (__comp(*__first, __pivot)) ^ laser.cpp:43:41: note: candidates are: sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)() <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 1 argument, 3 provided laser.cpp:43:62: note: main()::__lambda0 sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:62: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const blocaj&, blocaj&)' while (__comp(__pivot, *__last)) ^ laser.cpp:43:41: note: candidates are: sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)() <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 1 argument, 3 provided laser.cpp:43:62: note: main()::__lambda0 sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:62: 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 laser.cpp:2: /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<blocaj*, std::vector<blocaj> >; _Distance = int; _Tp = blocaj; _Compare = main()::__lambda0]': /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]' /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]' /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]' /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<blocaj*, std::vector<blocaj> >; _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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]' laser.cpp:47:6: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (blocaj&, blocaj&)' *(__first + (__secondChild - 1)))) ^ laser.cpp:43:41: note: candidates are: sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from laser.cpp:2: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: bool (*)() <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 1 argument, 3 provided laser.cpp:43:62: note: main()::__lambda0 sort(d_alea.begin(), d_alea.end(), [](auto a, auto b) -> bool { ^ laser.cpp:43:62: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from laser.cpp:2: /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', 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 laser.cpp:2: /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<blocaj*, std::vector<blocaj> >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', 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<blocaj*, std::vector<blocaj> >; _Distance = int; _Tp = blocaj; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', 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 laser 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ă.