Rezumat problemă

A-ManhattanDeBuget

#3832

Dându-se N puncte laticiale, care este distanța Manhattan de buget minimă dintre două puncte de coordonate a b respectiv x y cu proprietatea că a-y >= x-b?

infoleague.net runda antrenament 2, problema A.

Fișiere Iacob Tudor (IacobTudor) Tudor Iacob concurs

Clasa 9 Probleme diverse Probleme diverse Sortare

Rezolvă

Detalii

Problema	A-ManhattanDeBuget	Operații I/O	mman.in/mman.out
Limita timp	0.1 secunde	Limita memorie	Total: 16 MB / Stivă 8 MB
Id soluție	#61468666	Utilizator	Saleh Nadir (Al_Nadir)
Fișier	a-manhattandebuget.cpp	Dimensiune	682 B
Data încărcării	28 Noiembrie 2025, 14:39	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from a-manhattandebuget.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 = punct*; _Tp = punct; _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 = punct*; _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 = punct*; _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 = punct*; _Compare = main()::__lambda0]'
a-manhattandebuget.cpp:25:116:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (punct&, const punct&)'
    while (__comp(*__first, __pivot))
                                   ^
a-manhattandebuget.cpp:25:19: note: candidates are:
     sort(a, a+n, [](punct &a, punct &b) {return manhattan(-1e9, -1e9, a.x, a.y) < manhattan(-1e9, -1e9, b.x, b.y);});

                   ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from a-manhattandebuget.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(punct&, punct&) <conversion>
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note:   candidate expects 3 arguments, 3 provided
a-manhattandebuget.cpp:25:39: note: main()::__lambda0
     sort(a, a+n, [](punct &a, punct &b) {return manhattan(-1e9, -1e9, a.x, a.y) < manhattan(-1e9, -1e9, b.x, b.y);});

                                       ^
a-manhattandebuget.cpp:25:39: note:   no known conversion for argument 2 from 'const punct' to 'punct&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from a-manhattandebuget.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const punct&, punct&)'
    while (__comp(__pivot, *__last))
                                  ^
a-manhattandebuget.cpp:25:19: note: candidates are:
     sort(a, a+n, [](punct &a, punct &b) {return manhattan(-1e9, -1e9, a.x, a.y) < manhattan(-1e9, -1e9, b.x, b.y);});

                   ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from a-manhattandebuget.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(punct&, punct&) <conversion>
    while (__comp(__pivot, *__last))
                                  ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note:   candidate expects 3 arguments, 3 provided
a-manhattandebuget.cpp:25:39: note: main()::__lambda0
     sort(a, a+n, [](punct &a, punct &b) {return manhattan(-1e9, -1e9, a.x, a.y) < manhattan(-1e9, -1e9, b.x, b.y);});

                                       ^
a-manhattandebuget.cpp:25:39: note:   no known conversion for argument 1 from 'const punct' to 'punct&'

Cum funcționează evaluarea?