#2779
cntSQ
Se dă o matrice binară (valori 0
și 1
). Să se determine câte pătrate exista cu proprietatea că acestea au pe marginea lor doar valori 1
.
Problema | cntSQ | Operații I/O |
cntsq.in /cntsq.out
|
---|---|---|---|
Limita timp | 0.15 secunde | Limita memorie |
Total: 32 MB
/
Stivă 8 MB
|
Id soluție | #48785872 | Utilizator | |
Fișier | cntsq.cpp | Dimensiune | 3.21 KB |
Data încărcării | 05 Februarie 2024, 16:54 | Scor / rezultat | Eroare de compilare |
cntsq.cpp: In function 'int main()': cntsq.cpp:96:47: error: no matching function for call to 'min(short int&, int&)' sus[i][j] = min(sus[i][j], cnt); ^ cntsq.cpp:96:47: note: candidates are: In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from cntsq.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:193:5: note: template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&) min(const _Tp& __a, const _Tp& __b) ^ /usr/include/c++/4.8/bits/stl_algobase.h:193:5: note: template argument deduction/substitution failed: cntsq.cpp:96:47: note: deduced conflicting types for parameter 'const _Tp' ('short int' and 'int') sus[i][j] = min(sus[i][j], cnt); ^ In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from cntsq.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:239:5: note: template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare) min(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:239:5: note: template argument deduction/substitution failed: cntsq.cpp:96:47: note: deduced conflicting types for parameter 'const _Tp' ('short int' and 'int') sus[i][j] = min(sus[i][j], cnt); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from cntsq.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:4221:5: note: template<class _Tp> _Tp std::min(std::initializer_list<_Tp>) min(initializer_list<_Tp> __l) ^ /usr/include/c++/4.8/bits/stl_algo.h:4221:5: note: template argument deduction/substitution failed: cntsq.cpp:96:47: note: mismatched types 'std::initializer_list<_Tp>' and 'short int' sus[i][j] = min(sus[i][j], cnt); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from cntsq.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:4226:5: note: template<class _Tp, class _Compare> _Tp std::min(std::initializer_list<_Tp>, _Compare) min(initializer_list<_Tp> __l, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algo.h:4226:5: note: template argument deduction/substitution failed: cntsq.cpp:96:47: note: mismatched types 'std::initializer_list<_Tp>' and 'short int' sus[i][j] = min(sus[i][j], cnt); ^ cntsq.cpp:120:47: error: no matching function for call to 'min(short int&, int&)' jos[i][j] = min(jos[i][j], cnt); ^ cntsq.cpp:120:47: note: candidates are: In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from cntsq.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:193:5: note: template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&) min(const _Tp& __a, const _Tp& __b) ^ /usr/include/c++/4.8/bits/stl_algobase.h:193:5: note: template argument deduction/substitution failed: cntsq.cpp:120:47: note: deduced conflicting types for parameter 'const _Tp' ('short int' and 'int') jos[i][j] = min(jos[i][j], cnt); ^ In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from cntsq.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:239:5: note: template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare) min(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:239:5: note: template argument deduction/substitution failed: cntsq.cpp:120:47: note: deduced conflicting types for parameter 'const _Tp' ('short int' and 'int') jos[i][j] = min(jos[i][j], cnt); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from cntsq.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:4221:5: note: template<class _Tp> _Tp std::min(std::initializer_list<_Tp>) min(initializer_list<_Tp> __l) ^ /usr/include/c++/4.8/bits/stl_algo.h:4221:5: note: template argument deduction/substitution failed: cntsq.cpp:120:47: note: mismatched types 'std::initializer_list<_Tp>' and 'short int' jos[i][j] = min(jos[i][j], cnt); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from cntsq.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:4226:5: note: template<class _Tp, class _Compare> _Tp std::min(std::initializer_list<_Tp>, _Compare) min(initializer_list<_Tp> __l, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algo.h:4226:5: note: template argument deduction/substitution failed: cntsq.cpp:120:47: note: mismatched types 'std::initializer_list<_Tp>' and 'short int' jos[i][j] = min(jos[i][j], cnt); ^ cntsq.cpp:135:73: warning: narrowing conversion of 'poz' from 'int' to 'short int' inside { } [-Wnarrowing] sweep.push_back({poz, i - j + m, 2, poz + sus[i][j] - 1}); ^ cntsq.cpp:135:45: warning: narrowing conversion of '((i - j) + m)' from 'int' to 'short int' inside { } [-Wnarrowing] sweep.push_back({poz, i - j + m, 2, poz + sus[i][j] - 1}); ^ cntsq.cpp:135:69: warning: narrowing conversion of '((((int)sus[i][j]) + poz) + -1)' from 'int' to 'short int' inside { } [-Wnarrowing] sweep.push_back({poz, i - j + m, 2, poz + sus[i][j] - 1}); ^ cntsq.cpp:136:53: warning: narrowing conversion of 'poz' from 'int' to 'short int' inside { } [-Wnarrowing] sweep.push_back({poz, i - j + m, 1, poz}); ^ cntsq.cpp:136:41: warning: narrowing conversion of '((i - j) + m)' from 'int' to 'short int' inside { } [-Wnarrowing] sweep.push_back({poz, i - j + m, 1, poz}); ^ cntsq.cpp:136:53: warning: narrowing conversion of 'poz' from 'int' to 'short int' inside { } [-Wnarrowing] sweep.push_back({poz, i - j + m, 1, poz}); ^ cntsq.cpp:137:34: warning: narrowing conversion of '(poz - ((int)jos[i][j]))' from 'int' to 'short int' inside { } [-Wnarrowing] sweep.push_back({poz - jos[i][j], i - j + m, -1, poz}); ^ cntsq.cpp:137:53: warning: narrowing conversion of '((i - j) + m)' from 'int' to 'short int' inside { } [-Wnarrowing] sweep.push_back({poz - jos[i][j], i - j + m, -1, poz}); ^ cntsq.cpp:137:66: warning: narrowing conversion of 'poz' from 'int' to 'short int' inside { } [-Wnarrowing] sweep.push_back({poz - jos[i][j], i - j + m, -1, poz}); ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema cntSQ 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ă.