#2873
SortMatrixLin
Se dă o matrice cu n
linii și m
coloane și un caracter c
care poate fi +
sau -
. Să se sorteze, după linii, matricea crescător dacă semnul este +
sau descrescător dacă semnul este -
.
Sortarea matricei după linii este rearanjarea elementelor astfel încât, parcurgând matricea pe linii, de sus în jos și de la stânga la dreapta, elementele sunt în ordine crescătoare/descrescătoare.
Problema | SortMatrixLin | Operații I/O | tastatură/ecran |
---|---|---|---|
Limita timp | 0.2 secunde | Limita memorie |
Total: 1 MB
/
Stivă 1 MB
|
Id soluție | #50420060 | Utilizator | |
Fișier | sortmatrixlin.cpp | Dimensiune | 538 B |
Data încărcării | 09 Aprilie 2024, 07:33 | Scor / rezultat | Eroare de compilare |
In file included from /usr/include/c++/4.8/bits/stl_pair.h:59:0, from /usr/include/c++/4.8/bits/stl_algobase.h:64, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/sstream:38, from /usr/include/c++/4.8/complex:45, from /usr/include/c++/4.8/ccomplex:38, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from sortmatrixlin.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator) [with _RandomAccessIterator = int (*)[101]]': /usr/include/c++/4.8/bits/stl_algo.h:2211:62: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator) [with _RandomAccessIterator = int (*)[101]]' /usr/include/c++/4.8/bits/stl_algo.h:5462:47: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = int (*)[101]]' sortmatrixlin.cpp:13:36: required from here /usr/include/c++/4.8/bits/stl_algo.h:2140:11: error: array must be initialized with a brace-enclosed initializer __val = _GLIBCXX_MOVE(*__i); ^ 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 sortmatrixlin.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2142:17: error: invalid array assignment *__first = _GLIBCXX_MOVE(__val); ^ In file included from /usr/include/c++/4.8/bits/stl_pair.h:59:0, from /usr/include/c++/4.8/bits/stl_algobase.h:64, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/sstream:38, from /usr/include/c++/4.8/complex:45, from /usr/include/c++/4.8/ccomplex:38, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from sortmatrixlin.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::make_heap(_RAIter, _RAIter) [with _RAIter = int (*)[101]]': /usr/include/c++/4.8/bits/stl_algo.h:1933:39: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator) [with _RandomAccessIterator = int (*)[101]]' /usr/include/c++/4.8/bits/stl_algo.h:5308:51: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter) [with _RAIter = int (*)[101]]' /usr/include/c++/4.8/bits/stl_algo.h:2310:60: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size) [with _RandomAccessIterator = int (*)[101]; _Size = int]' /usr/include/c++/4.8/bits/stl_algo.h:5461:36: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = int (*)[101]]' sortmatrixlin.cpp:13:36: required from here /usr/include/c++/4.8/bits/stl_heap.h:406:25: error: array must be initialized with a brace-enclosed initializer _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent)); ^ /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator) [with _RandomAccessIterator = int (*)[101]]': /usr/include/c++/4.8/bits/stl_algo.h:1936:42: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator) [with _RandomAccessIterator = int (*)[101]]' /usr/include/c++/4.8/bits/stl_algo.h:5308:51: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter) [with _RAIter = int (*)[101]]' /usr/include/c++/4.8/bits/stl_algo.h:2310:60: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size) [with _RandomAccessIterator = int (*)[101]; _Size = int]' /usr/include/c++/4.8/bits/stl_algo.h:5461:36: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = int (*)[101]]' sortmatrixlin.cpp:13:36: required from here /usr/include/c++/4.8/bits/stl_heap.h:261:28: error: array must be initialized with a brace-enclosed initializer _ValueType __value = _GLIBCXX_MOVE(*__result); ^ 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 sortmatrixlin.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h:262:17: error: invalid array assignment *__result = _GLIBCXX_MOVE(*__first); ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema SortMatrixLin 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ă.