#2861
puncte4
Zăhărel a desenat pe o foaie de hârtie N
puncte în plan. Curios din fire, şi-a ales încă M
puncte pe axa OX
şi s-a întrebat pentru fiecare dintre cele M
puncte de pe axa Ox
care dintre cele N
puncte este cel mai apropiat (situat la distanță minimă). Se consideră că distanța dintre două puncte (x1, y1)
şi (x2, y2)
este (x1-x2)
2
+ (y1-y2)
2
. Scrieți un program pentru Zăhărel care să determine pentru fiecare dintre cele M
puncte de pe axa OX
, care este distanța la cel mai apropiat punct dintre cele N
desenate pe hârtie.
ONI 2007 Baraj
Problema | puncte4 | Operații I/O |
puncte4.in /puncte4.out
|
---|---|---|---|
Limita timp | 0.4 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #47493072 | Utilizator | |
Fișier | puncte4.cpp | Dimensiune | 4.90 KB |
Data încărcării | 14 Decembrie 2023, 15:54 | Scor / rezultat | Eroare de compilare |
In file included from /usr/include/c++/4.8/algorithm:62:0, from puncte4.cpp:8: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = IndexedPair<int>*; _Tp = IndexedPair<int>; _Compare = build(KDTreeNode*, int, int, 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 = IndexedPair<int>*; _Compare = build(KDTreeNode*, int, int, 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 = IndexedPair<int>*; _Size = int; _Compare = build(KDTreeNode*, int, int, int)::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = IndexedPair<int>*; _Compare = build(KDTreeNode*, int, int, int)::__lambda0]' puncte4.cpp:148:5: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(build(KDTreeNode*, int, int, int)::__lambda0) (IndexedPair<int>&, const IndexedPair<int>&)' while (__comp(*__first, __pivot)) ^ puncte4.cpp:146:29: note: candidates are: std::sort(arr+l,arr+r+1,[](IndexedPair<int>& a, IndexedPair<int>& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puncte4.cpp:8: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(IndexedPair<int>&, IndexedPair<int>&) <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 3 arguments, 3 provided puncte4.cpp:146:71: note: build(KDTreeNode*, int, int, int)::__lambda0 std::sort(arr+l,arr+r+1,[](IndexedPair<int>& a, IndexedPair<int>& b) { ^ puncte4.cpp:146:71: note: no known conversion for argument 2 from 'const IndexedPair<int>' to 'IndexedPair<int>&' In file included from /usr/include/c++/4.8/algorithm:62:0, from puncte4.cpp:8: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(build(KDTreeNode*, int, int, int)::__lambda0) (const IndexedPair<int>&, IndexedPair<int>&)' while (__comp(__pivot, *__last)) ^ puncte4.cpp:146:29: note: candidates are: std::sort(arr+l,arr+r+1,[](IndexedPair<int>& a, IndexedPair<int>& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puncte4.cpp:8: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(IndexedPair<int>&, IndexedPair<int>&) <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 3 arguments, 3 provided puncte4.cpp:146:71: note: build(KDTreeNode*, int, int, int)::__lambda0 std::sort(arr+l,arr+r+1,[](IndexedPair<int>& a, IndexedPair<int>& b) { ^ puncte4.cpp:146:71: note: no known conversion for argument 1 from 'const IndexedPair<int>' to 'IndexedPair<int>&' In file included from /usr/include/c++/4.8/algorithm:62:0, from puncte4.cpp:8: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = IndexedPair<int>*; _Tp = IndexedPair<int>; _Compare = build(KDTreeNode*, int, int, int)::__lambda1]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = IndexedPair<int>*; _Compare = build(KDTreeNode*, int, int, int)::__lambda1]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = IndexedPair<int>*; _Size = int; _Compare = build(KDTreeNode*, int, int, int)::__lambda1]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = IndexedPair<int>*; _Compare = build(KDTreeNode*, int, int, int)::__lambda1]' puncte4.cpp:153:5: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(build(KDTreeNode*, int, int, int)::__lambda1) (IndexedPair<int>&, const IndexedPair<int>&)' while (__comp(*__first, __pivot)) ^ puncte4.cpp:151:29: note: candidates are: std::sort(arr+l,arr+r+1,[](IndexedPair<int>& a, IndexedPair<int>& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puncte4.cpp:8: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(IndexedPair<int>&, IndexedPair<int>&) <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 3 arguments, 3 provided puncte4.cpp:151:71: note: build(KDTreeNode*, int, int, int)::__lambda1 std::sort(arr+l,arr+r+1,[](IndexedPair<int>& a, IndexedPair<int>& b) { ^ puncte4.cpp:151:71: note: no known conversion for argument 2 from 'const IndexedPair<int>' to 'IndexedPair<int>&' In file included from /usr/include/c++/4.8/algorithm:62:0, from puncte4.cpp:8: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(build(KDTreeNode*, int, int, int)::__lambda1) (const IndexedPair<int>&, IndexedPair<int>&)' while (__comp(__pivot, *__last)) ^ puncte4.cpp:151:29: note: candidates are: std::sort(arr+l,arr+r+1,[](IndexedPair<int>& a, IndexedPair<int>& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puncte4.cpp:8: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(IndexedPair<int>&, IndexedPair<int>&) <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 3 arguments, 3 provided puncte4.cpp:151:71: note: build(KDTreeNode*, int, int, int)::__lambda1 std::sort(arr+l,arr+r+1,[](IndexedPair<int>& a, IndexedPair<int>& b) { ^ puncte4.cpp:151:71: note: no known conversion for argument 1 from 'const IndexedPair<int>' to 'IndexedPair<int>&' puncte4.cpp: In member function 'char fast_input::get_ch()': puncte4.cpp:18:26: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result] fread(buff,1,65536,in); ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema puncte4 face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
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ă.