#4337
normalizare
Se dă un șir de n
numere întregi a = (a[1], a[2], ..., a[n])
. Trebuie să construiți un nou vector b
de lungime n
în care valorile sunt cuprinse între 1
și n
astfel: toate elementele a[i]
care memorează valoarea minimă se înlocuiesc în b[i]
cu 1
, toate elementele a[j]
imediat mai mari decât minimele se înlocuiesc în b[j]
cu 2
, ș.a.m.d.
Folclorul informatic
Problema | normalizare | Operații I/O | tastatură/ecran |
---|---|---|---|
Limita timp | 0.3 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #50557384 | Utilizator | |
Fișier | normalizare.cpp | Dimensiune | 1.02 KB |
Data încărcării | 15 Aprilie 2024, 10:24 | Scor / rezultat | Eroare de compilare |
normalizare.cpp:16:9: error: reference to 'vector' is ambiguous int cmp(vector a,vector b){ ^ normalizare.cpp:10:8: note: candidates are: struct vector struct vector{ ^ In file included from /usr/include/c++/4.8/vector:64:0, from /usr/include/c++/4.8/bits/random.h:34, from /usr/include/c++/4.8/random:50, from /usr/include/c++/4.8/bits/stl_algo.h:65, from /usr/include/c++/4.8/algorithm:62, from normalizare.cpp:3: /usr/include/c++/4.8/bits/stl_vector.h:210:11: note: template<class _Tp, class _Alloc> class std::vector class vector : protected _Vector_base<_Tp, _Alloc> ^ normalizare.cpp:16:18: error: reference to 'vector' is ambiguous int cmp(vector a,vector b){ ^ normalizare.cpp:10:8: note: candidates are: struct vector struct vector{ ^ In file included from /usr/include/c++/4.8/vector:64:0, from /usr/include/c++/4.8/bits/random.h:34, from /usr/include/c++/4.8/random:50, from /usr/include/c++/4.8/bits/stl_algo.h:65, from /usr/include/c++/4.8/algorithm:62, from normalizare.cpp:3: /usr/include/c++/4.8/bits/stl_vector.h:210:11: note: template<class _Tp, class _Alloc> class std::vector class vector : protected _Vector_base<_Tp, _Alloc> ^ normalizare.cpp:16:26: error: expression list treated as compound expression in initializer [-fpermissive] int cmp(vector a,vector b){ ^ normalizare.cpp:16:27: error: expected ',' or ';' before '{' token int cmp(vector a,vector b){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from normalizare.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = vector*; _Compare = int]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = vector*; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = vector*; _Compare = int]' normalizare.cpp:48:23: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: '__comp' cannot be used as a function if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = vector*; _Compare = int]': /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = vector*; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = vector*; _Size = int; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = vector*; _Compare = int]' normalizare.cpp:48:23: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: '__comp' cannot be used as a function if (__comp(*__i, *__first)) ^ /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 = vector*; _Compare = int]': /usr/include/c++/4.8/bits/stl_algo.h:2295:13: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = vector*; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = vector*; _Size = int; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = vector*; _Compare = int]' normalizare.cpp:48:23: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: '__comp' cannot be used as a function if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: '__comp' cannot be used as a function if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: '__comp' cannot be used as a function else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: '__comp' cannot be used as a function else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: '__comp' cannot be used as a function else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = vector*; _Tp = vector; _Compare = int]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = vector*; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = vector*; _Size = int; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = vector*; _Compare = int]' normalizare.cpp:48:23: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: '__comp' cannot be used as a function while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: '__comp' cannot be used as a function while (__comp(__pivot, *__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 normalizare.cpp:3: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = vector*; _Distance = int; _Tp = vector; _Compare = int]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = vector*; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = vector*; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = vector*; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = vector*; _Size = int; _Compare = int]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = vector*; _Compare = int]' normalizare.cpp:48:23: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: '__comp' cannot be used as a function *(__first + (__secondChild - 1)))) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema normalizare 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ă.