Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #58686024
Rezumat problemă
#4181
În anul de grație 6983 (1475), armata turcească condusă de Suleiman Pașa a fost învinsă de armatele aliate creștine moldo-maghiaro-polone conduse de Ștefan cel Mare. Bătălia a avut loc lângă Vaslui în locul numit Podu Înalt. Terenul în care s-au desfășurat luptele poate fi reprezentat ca un tablou bidimensional cu N linii și M coloane, numerotate începând de la 1. Poziția unui element din matrice este identificată prin linia și coloana corespunzătoare. La luptă au participat P oșteni, în poziții distincte, pozițiile acestora în teren fiind cunoscute.
- Determinaţi o diagonală tactică astfel încât terenul de luptă să fie împărțit în două zone care conţin acelaşi număr de oșteni. Dacă nu există soluție, se va scrie doar valoarea
-1. - Determinaţi două diagonale tactice perpendiculare care împart terenul de luptă în patru zone care conţin, fiecare, acelaşi număr de oșteni. Dacă nu există soluție, se va scrie doar valoarea
-1.
Lot juniori, Cluj-Napoca 2022
Pracsiu Dan (dnprx) Detalii
| Problema | Vaslui1475 | Operații I/O |
vaslui1475.in/vaslui1475.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #58686024 | Utilizator |
Raduta Mihail (Mihailraduta)
|
| Fișier | vaslui1475.cpp | Dimensiune | 5.77 KB |
| Data încărcării | 17 Iulie 2025, 09:30 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
vaslui1475.cpp: In function 'Diagonal get_endpoints(long long int, long long int, int, long long int)': vaslui1475.cpp:31:61: error: 'S' was not declared in this scope if (val - M >= 1 && val - M <= N) points.push_back({S - M, M}); ^ vaslui1475.cpp:31:70: error: no matching function for call to 'std::vector<std::pair<long long int, long long int> >::push_back(<brace-enclosed initializer list>)' if (val - M >= 1 && val - M <= N) points.push_back({S - M, M}); ^ vaslui1475.cpp:31:70: note: candidates are: In file included from /usr/include/c++/4.8/vector:64:0, from vaslui1475.cpp:2: /usr/include/c++/4.8/bits/stl_vector.h:901:7: note: void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >; std::vector<_Tp, _Alloc>::value_type = std::pair<long long int, long long int>] push_back(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_vector.h:901:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<long long int, long long int>&}' /usr/include/c++/4.8/bits/stl_vector.h:919:7: note: void std::vector<_Tp, _Alloc>::push_back(std::vector<_Tp, _Alloc>::value_type&&) [with _Tp = std::pair<long long int, long long int>; _Alloc = std::allocator<std::pair<long long int, long long int> >; std::vector<_Tp, _Alloc>::value_type = std::pair<long long int, long long int>] push_back(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_vector.h:919:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::vector<std::pair<long long int, long long int> >::value_type&& {aka std::pair<long long int, long long int>&&}' vaslui1475.cpp:47:34: error: could not convert '{0, 0, 0, 0, false}' from '<brace-enclosed initializer list>' to 'Diagonal' return {0, 0, 0, 0, false}; ^ vaslui1475.cpp:51:55: error: parameter declared 'auto' sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:70: error: parameter declared 'auto' sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp: In lambda function: vaslui1475.cpp:52:13: error: 'a' was not declared in this scope if (a.second != b.second) return a.second < b.second; ^ vaslui1475.cpp:52:25: error: 'b' was not declared in this scope if (a.second != b.second) return a.second < b.second; ^ vaslui1475.cpp:53:16: error: 'a' was not declared in this scope return a.first < b.first; ^ vaslui1475.cpp:53:26: error: 'b' was not declared in this scope return a.first < b.first; ^ vaslui1475.cpp: In function 'Diagonal get_endpoints(long long int, long long int, int, long long int)': vaslui1475.cpp:56:105: error: could not convert '{points.std::vector<_Tp, _Alloc>::front<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >().std::pair<long long int, long long int>::first, points.std::vector<_Tp, _Alloc>::front<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >().std::pair<long long int, long long int>::second, points.std::vector<_Tp, _Alloc>::back<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >().std::pair<long long int, long long int>::first, points.std::vector<_Tp, _Alloc>::back<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >().std::pair<long long int, long long int>::second, true}' from '<brace-enclosed initializer list>' to 'Diagonal' return {points.front().first, points.front().second, points.back().first, points.back().second, true}; ^ vaslui1475.cpp: In function 'int main()': vaslui1475.cpp:75:39: error: could not convert '{0, 0, 0, 0, false}' from '<brace-enclosed initializer list>' to 'Diagonal' Diagonal sol1 = {0, 0, 0, 0, false}; ^ vaslui1475.cpp:111:42: error: could not convert '{0, 0, 0, 0, false}' from '<brace-enclosed initializer list>' to 'Diagonal' Diagonal sol2_d1 = {0, 0, 0, 0, false}, sol2_d2 = {0, 0, 0, 0, false}; ^ vaslui1475.cpp:111:73: error: could not convert '{0, 0, 0, 0, false}' from '<brace-enclosed initializer list>' to 'Diagonal' Diagonal sol2_d1 = {0, 0, 0, 0, false}, sol2_d2 = {0, 0, 0, 0, false}; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__lambda0]' vaslui1475.cpp:54:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(get_endpoints(long long int, long long int, int, long long int)::__lambda0) (std::pair<long long int, long long int>&, std::pair<long long int, long long int>&)' if (__comp(*__i, *__first)) ^ vaslui1475.cpp:51:41: note: candidates are: sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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 vaslui1475.cpp:51:71: note: get_endpoints(long long int, long long int, int, long long int)::__lambda0 sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:71: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Size = int; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__lambda0]' vaslui1475.cpp:54:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(get_endpoints(long long int, long long int, int, long long int)::__lambda0) (std::pair<long long int, long long int>&, std::pair<long long int, long long int>&)' if (__comp(*__i, *__first)) ^ vaslui1475.cpp:51:41: note: candidates are: sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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 vaslui1475.cpp:51:71: note: get_endpoints(long long int, long long int, int, long long int)::__lambda0 sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:71: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Size = int; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__lambda0]' vaslui1475.cpp:54:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(get_endpoints(long long int, long long int, int, long long int)::__lambda0) (std::pair<long long int, long long int>&, std::pair<long long int, long long int>&)' if (__comp(*__a, *__b)) ^ vaslui1475.cpp:51:41: note: candidates are: sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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 vaslui1475.cpp:51:71: note: get_endpoints(long long int, long long int, int, long long int)::__lambda0 sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:71: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(get_endpoints(long long int, long long int, int, long long int)::__lambda0) (std::pair<long long int, long long int>&, std::pair<long long int, long long int>&)' if (__comp(*__b, *__c)) ^ vaslui1475.cpp:51:41: note: candidates are: sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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 vaslui1475.cpp:51:71: note: get_endpoints(long long int, long long int, int, long long int)::__lambda0 sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:71: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(get_endpoints(long long int, long long int, int, long long int)::__lambda0) (std::pair<long long int, long long int>&, std::pair<long long int, long long int>&)' else if (__comp(*__a, *__c)) ^ vaslui1475.cpp:51:41: note: candidates are: sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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 vaslui1475.cpp:51:71: note: get_endpoints(long long int, long long int, int, long long int)::__lambda0 sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:71: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(get_endpoints(long long int, long long int, int, long long int)::__lambda0) (std::pair<long long int, long long int>&, std::pair<long long int, long long int>&)' else if (__comp(*__a, *__c)) ^ vaslui1475.cpp:51:41: note: candidates are: sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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 vaslui1475.cpp:51:71: note: get_endpoints(long long int, long long int, int, long long int)::__lambda0 sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:71: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(get_endpoints(long long int, long long int, int, long long int)::__lambda0) (std::pair<long long int, long long int>&, std::pair<long long int, long long int>&)' else if (__comp(*__b, *__c)) ^ vaslui1475.cpp:51:41: note: candidates are: sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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 vaslui1475.cpp:51:71: note: get_endpoints(long long int, long long int, int, long long int)::__lambda0 sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:71: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Tp = std::pair<long long int, long long int>; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Size = int; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__lambda0]' vaslui1475.cpp:54:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(get_endpoints(long long int, long long int, int, long long int)::__lambda0) (std::pair<long long int, long long int>&, const std::pair<long long int, long long int>&)' while (__comp(*__first, __pivot)) ^ vaslui1475.cpp:51:41: note: candidates are: sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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 vaslui1475.cpp:51:71: note: get_endpoints(long long int, long long int, int, long long int)::__lambda0 sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:71: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(get_endpoints(long long int, long long int, int, long long int)::__lambda0) (const std::pair<long long int, long long int>&, std::pair<long long int, long long int>&)' while (__comp(__pivot, *__last)) ^ vaslui1475.cpp:51:41: note: candidates are: sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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 vaslui1475.cpp:51:71: note: get_endpoints(long long int, long long int, int, long long int)::__lambda0 sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:71: 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 vaslui1475.cpp:4: /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::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Distance = int; _Tp = std::pair<long long int, long long int>; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Size = int; _Compare = get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__lambda0]' vaslui1475.cpp:54:6: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(get_endpoints(long long int, long long int, int, long long int)::__lambda0) (std::pair<long long int, long long int>&, std::pair<long long int, long long int>&)' *(__first + (__secondChild - 1)))) ^ vaslui1475.cpp:51:41: note: candidates are: sort(points.begin(), points.end(), [](const auto& a, const 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 vaslui1475.cpp:4: /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 vaslui1475.cpp:51:71: note: get_endpoints(long long int, long long int, int, long long int)::__lambda0 sort(points.begin(), points.end(), [](const auto& a, const auto& b) { ^ vaslui1475.cpp:51:71: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from vaslui1475.cpp:4: /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::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__lambda0]', declared using local type 'get_endpoints(long long int, long long int, int, long long int)::__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 vaslui1475.cpp:4: /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::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Compare = get_endpoints(long long int, long long int, int, long long int)::__lambda0]', declared using local type 'get_endpoints(long long int, long long int, int, long long int)::__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<std::pair<long long int, long long int>*, std::vector<std::pair<long long int, long long int> > >; _Distance = int; _Tp = std::pair<long long int, long long int>; _Compare = get_endpoints(long long int, long long int, int, long long int)::__lambda0]', declared using local type 'get_endpoints(long long int, long long int, int, long long int)::__lambda0', is used but never defined [-fpermissive] __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, ^ vaslui1475.cpp: In function 'Diagonal get_endpoints(long long int, long long int, int, long long int)': vaslui1475.cpp:57:1: warning: control reaches end of non-void function [-Wreturn-type] } ^
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 Vaslui1475 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ă.