#685
Să se determine, dacă este posibil, un șir de piese de domino care respectă o anumită regulă.
| Problema | Domino | Operații I/O |
domino.in/domino.out
|
|---|---|---|---|
| Limita timp | 1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 64 MB
|
| Id soluție | #64811932 | Utilizator | |
| Fișier | domino.cpp | Dimensiune | 693 B |
| Data încărcării | 02 Iunie 2026, 21:36 | Scor/rezultat | Eroare de compilare |
domino.cpp: In function ‘void dfs(int)’: domino.cpp:16:13: error: no match for ‘operator!’ (operand type is ‘std::vector<int>’) 16 | if (!viz[u][v]) { | ^~~~~~~~~~ domino.cpp:16:13: note: candidate: ‘operator!(bool)’ (built-in) domino.cpp:16:13: note: no known conversion for argument 1 from ‘std::vector<int>’ to ‘bool’ domino.cpp:17:37: error: no match for ‘operator=’ (operand types are ‘std::vector<int>’ and ‘int’) 17 | viz[u][v] = viz[v][u] = 1; | ^ In file included from /usr/include/c++/13/vector:72, from domino.cpp:2: /usr/include/c++/13/bits/vector.tcc:210:5: note: candidate: ‘std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = int; _Alloc = std::allocator<int>]’ 210 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/vector.tcc:211:42: note: no known conversion for argument 1 from ‘int’ to ‘const std::vector<int>&’ 211 | operator=(const vector<_Tp, _Alloc>& __x) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ In file included from /usr/include/c++/13/vector:66: /usr/include/c++/13/bits/stl_vector.h:766:7: note: candidate: ‘std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(std::vector<_Tp, _Alloc>&&) [with _Tp = int; _Alloc = std::allocator<int>]’ 766 | operator=(vector&& __x) noexcept(_Alloc_traits::_S_nothrow_move()) | ^~~~~~~~ /usr/include/c++/13/bits/stl_vector.h:766:26: note: no known conversion for argument 1 from ‘int’ to ‘std::vector<int>&&’ 766 | operator=(vector&& __x) noexcept(_Alloc_traits::_S_nothrow_move()) | ~~~~~~~~~^~~ /usr/include/c++/13/bits/stl_vector.h:788:7: note: candidate: ‘std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(std::initializer_list<_Tp>) [with _Tp = int; _Alloc = std::allocator<int>]’ 788 | operator=(initializer_list<value_type> __l) | ^~~~~~~~ /usr/include/c++/13/bits/stl_vector.h:788:46: note: no known conversion for argument 1 from ‘int’ to ‘std::initializer_list<int>’ 788 | operator=(initializer_list<value_type> __l) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Domino 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ă.