Rezumat problemă

dominoes

#4661

Se dă o matrice cu 2 linii si n coloane care are k celule ocupate. Se dau q interogări de forma (x1, y1, x2, y2), cu următoarea semnificație: dacă se ocupă două celule libere distincte ale matricii inițiale, (x1, y1) și (x2, y2), se poate pava complet matricea cu piese de domino de dimensiuni 2 x 1 și 1 x 2? După efectuarea unei interogări celulele ocupate asociate acesteia vor deveni din nou libere (modificările aduse matricei nu persistă între interogări). Să se determine, pentru fiecare interogare, dacă este posibil ca matricea să fie pavată complet cu piese de domino de dimensiuni 2 x 1 și 1 x 2.

ONI 2024, clasa a 10-a

Fișiere Pracsiu Dan (dnprx) Ilie-Daniel Apostol concurs

Clasa 10 Probleme diverse Diverse

Rezolvă

Detalii

Problema	dominoes	Operații I/O	dominoes.in/dominoes.out
Limita timp	0.5 secunde	Limita memorie	Total: 256 MB / Stivă 32 MB
Id soluție	#63480594	Utilizator	Rotaru Elena (elena_rotaru)
Fișier	dominoes.cpp	Dimensiune	996 B
Data încărcării	05 Martie 2026, 09:35	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

dominoes.cpp: In function 'int main()':
dominoes.cpp:12:5: error: reference to 'cin' is ambiguous
     cin.tie(nullptr);

     ^
dominoes.cpp:3:10: note: candidates are: std::ifstream cin
 ifstream cin ("dominoes.in");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from dominoes.cpp:1:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
dominoes.cpp:16:5: error: reference to 'cin' is ambiguous
     cin >> n >> k;

     ^
dominoes.cpp:3:10: note: candidates are: std::ifstream cin
 ifstream cin ("dominoes.in");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from dominoes.cpp:1:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
dominoes.cpp:23:9: error: reference to 'cin' is ambiguous
         cin >> x >> y;

         ^
dominoes.cpp:3:10: note: candidates are: std::ifstream cin
 ifstream cin ("dominoes.in");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from dominoes.cpp:1:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
dominoes.cpp:30:36: error: parameter declared 'auto'
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                    ^
dominoes.cpp:30:43: error: parameter declared 'auto'
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                           ^
dominoes.cpp: In lambda function:
dominoes.cpp:30:53: error: 'a' was not declared in this scope
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                                     ^
dominoes.cpp:30:57: error: 'b' was not declared in this scope
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                                         ^
dominoes.cpp: In function 'int main()':
dominoes.cpp:41:5: error: reference to 'cin' is ambiguous
     cin >> q;

     ^
dominoes.cpp:3:10: note: candidates are: std::ifstream cin
 ifstream cin ("dominoes.in");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from dominoes.cpp:1:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
dominoes.cpp:48:9: error: reference to 'cin' is ambiguous
         cin >> x1 >> y1 >> x2 >> y2;

         ^
dominoes.cpp:3:10: note: candidates are: std::ifstream cin
 ifstream cin ("dominoes.in");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from dominoes.cpp:1:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
dominoes.cpp:53:20: error: reference to 'cout' is ambiguous
         if(v1!=v2) cout<<1<<"\n";

                    ^
dominoes.cpp:4:10: note: candidates are: std::ofstream cout
 ofstream cout ("dominoes.out");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from dominoes.cpp:1:
/usr/include/c++/4.8/iostream:61:18: note:                 std::ostream std::cout
   extern ostream cout;  /// Linked to standard output
                  ^
dominoes.cpp:54:14: error: reference to 'cout' is ambiguous
         else cout<<0<<"\n";

              ^
dominoes.cpp:4:10: note: candidates are: std::ofstream cout
 ofstream cout ("dominoes.out");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from dominoes.cpp:1:
/usr/include/c++/4.8/iostream:61:18: note:                 std::ostream std::cout
   extern ostream cout;  /// Linked to standard output
                  ^
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 dominoes.cpp:1:
/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<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _Compare = main()::__lambda4]'
/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<Cell*, std::vector<Cell> >; _Compare = main()::__lambda4]'
dominoes.cpp:30:62:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda4) (Cell&, Cell&)'
    if (__comp(*__i, *__first))
                             ^
dominoes.cpp:30:29: note: candidates are:
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                             ^
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 dominoes.cpp:1:
/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
dominoes.cpp:30:44: note: main()::__lambda4
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                            ^
dominoes.cpp:30:44: 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 dominoes.cpp:1:
/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<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _Compare = main()::__lambda4]'
dominoes.cpp:30:62:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda4) (Cell&, Cell&)'
  if (__comp(*__i, *__first))
                           ^
dominoes.cpp:30:29: note: candidates are:
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                             ^
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 dominoes.cpp:1:
/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
dominoes.cpp:30:44: note: main()::__lambda4
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                            ^
dominoes.cpp:30:44: 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 dominoes.cpp:1:
/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<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _Compare = main()::__lambda4]'
dominoes.cpp:30:62:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda4) (Cell&, Cell&)'
       if (__comp(*__a, *__b))
                            ^
dominoes.cpp:30:29: note: candidates are:
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                             ^
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 dominoes.cpp:1:
/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
dominoes.cpp:30:44: note: main()::__lambda4
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                            ^
dominoes.cpp:30:44: 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 dominoes.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda4) (Cell&, Cell&)'
    if (__comp(*__b, *__c))
                         ^
dominoes.cpp:30:29: note: candidates are:
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                             ^
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 dominoes.cpp:1:
/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
dominoes.cpp:30:44: note: main()::__lambda4
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                            ^
dominoes.cpp:30:44: 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 dominoes.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda4) (Cell&, Cell&)'
    else if (__comp(*__a, *__c))
                              ^
dominoes.cpp:30:29: note: candidates are:
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                             ^
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 dominoes.cpp:1:
/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
dominoes.cpp:30:44: note: main()::__lambda4
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                            ^
dominoes.cpp:30:44: 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 dominoes.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda4) (Cell&, Cell&)'
       else if (__comp(*__a, *__c))
                                 ^
dominoes.cpp:30:29: note: candidates are:
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                             ^
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 dominoes.cpp:1:
/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
dominoes.cpp:30:44: note: main()::__lambda4
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                            ^
dominoes.cpp:30:44: 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 dominoes.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda4) (Cell&, Cell&)'
       else if (__comp(*__b, *__c))
                                 ^
dominoes.cpp:30:29: note: candidates are:
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                             ^
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 dominoes.cpp:1:
/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
dominoes.cpp:30:44: note: main()::__lambda4
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                            ^
dominoes.cpp:30:44: 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 dominoes.cpp:1:
/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<Cell*, std::vector<Cell> >; _Tp = Cell; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _Compare = main()::__lambda4]'
dominoes.cpp:30:62:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda4) (Cell&, const Cell&)'
    while (__comp(*__first, __pivot))
                                   ^
dominoes.cpp:30:29: note: candidates are:
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                             ^
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 dominoes.cpp:1:
/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
dominoes.cpp:30:44: note: main()::__lambda4
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                            ^
dominoes.cpp:30:44: 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 dominoes.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda4) (const Cell&, Cell&)'
    while (__comp(__pivot, *__last))
                                  ^
dominoes.cpp:30:29: note: candidates are:
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                             ^
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 dominoes.cpp:1:
/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
dominoes.cpp:30:44: note: main()::__lambda4
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                            ^
dominoes.cpp:30:44: 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 dominoes.cpp:1:
/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<Cell*, std::vector<Cell> >; _Distance = int; _Tp = Cell; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _Compare = main()::__lambda4]'
dominoes.cpp:30:62:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda4) (Cell&, Cell&)'
        *(__first + (__secondChild - 1))))
                                        ^
dominoes.cpp:30:29: note: candidates are:
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                             ^
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 dominoes.cpp:1:
/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
dominoes.cpp:30:44: note: main()::__lambda4
     sort(v.begin(),v.end(),[](auto a,auto b){return a.y<b.y;});

                                            ^
dominoes.cpp:30:44: 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 dominoes.cpp:1:
/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<Cell*, std::vector<Cell> >; _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 dominoes.cpp:1:
/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<Cell*, std::vector<Cell> >; _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 = __gnu_cxx::__normal_iterator<Cell*, std::vector<Cell> >; _Distance = int; _Tp = Cell; _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?