Rezumat problemă

bingo

#4390

Fie S un șir de caractere de lungime N indexat de la 1. Pe un astfel de șir se definește operația swap: se alege un indice i (1 ≤ i < N) și se interschimbă caracterele S[i] și S[i + 1]. Numărul norocos corespunzător unui șir S este egal cu numărul minim de operații swap ce trebuie efectuate succesiv pentru a obține cel puțin o subsecvență bingo în șirul S. Dacă subsecvența bingo apare în șirul inițial, numărul norocos este egal cu 0. Se dă un număr natural T și T șiruri de caractere. Să se determine pentru fiecare șir dat S[i] (1 ≤ i ≤ T), numărul său norocos.

OJI 2023, clasa a X-a

Fișiere Pracsiu Dan (dnprx) Sebastian Popa concurs

Clasa 10 Şiruri de caractere Probleme diverse

Rezolvă

Detalii

Problema	bingo	Operații I/O	bingo.in/bingo.out
Limita timp	0.6 secunde	Limita memorie	Total: 32 MB / Stivă 8 MB
Id soluție	#57333156	Utilizator	Timar Raul (raultimar)
Fișier	bingo.cpp	Dimensiune	3.89 KB
Data încărcării	26 Martie 2025, 14:00	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

bingo.cpp: In function 'int sum100(int, int, int, int, int)':
bingo.cpp:73:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }

 ^
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 bingo.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[100001]; _Compare = bool (*)(element, element)]':
/usr/include/c++/4.8/bits/stl_algo.h:2226:70:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[100001]; _Compare = bool (*)(element, element)]'
/usr/include/c++/4.8/bits/stl_algo.h:5500:55:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int (*)[100001]; _Compare = bool (*)(element, element)]'
bingo.cpp:32:23:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: could not convert '(int*)__i' from 'int*' to 'element'
    if (__comp(*__i, *__first))
                             ^
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 bingo.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2162: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 bingo.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2164:17: error: invalid array assignment
        *__first = _GLIBCXX_MOVE(__val);
                 ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[100001]; _Compare = bool (*)(element, element)]':
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = int (*)[100001]; _Compare = bool (*)(element, element)]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int (*)[100001]; _Size = int; _Compare = bool (*)(element, element)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int (*)[100001]; _Compare = bool (*)(element, element)]'
bingo.cpp:32:23:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: could not convert '(int*)__i' from 'int*' to 'element'
  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 = int (*)[100001]; _Compare = bool (*)(element, element)]':
/usr/include/c++/4.8/bits/stl_algo.h:2295:13:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[100001]; _Compare = bool (*)(element, element)]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int (*)[100001]; _Size = int; _Compare = bool (*)(element, element)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int (*)[100001]; _Compare = bool (*)(element, element)]'
bingo.cpp:32:23:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: could not convert '(int*)__a' from 'int*' to 'element'
       if (__comp(*__a, *__b))
                            ^
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: could not convert '(int*)__b' from 'int*' to 'element'
    if (__comp(*__b, *__c))
                         ^
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: could not convert '(int*)__a' from 'int*' to 'element'
    else if (__comp(*__a, *__c))
                              ^
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: could not convert '(int*)__a' from 'int*' to 'element'
       else if (__comp(*__a, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: could not convert '(int*)__b' from 'int*' to 'element'
       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 = int (*)[100001]; _Tp = int [100001]; _Compare = bool (*)(element, element)]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[100001]; _Compare = bool (*)(element, element)]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int (*)[100001]; _Size = int; _Compare = bool (*)(element, element)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int (*)[100001]; _Compare = bool (*)(element, element)]'
bingo.cpp:32:23:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: could not convert '(int*)__first' from 'int*' to 'element'
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: could not convert '(const int*)__pivot' from 'const int*' to 'element'
    while (__comp(__pivot, *__last))
                                  ^
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 bingo.cpp:1:
/usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = int (*)[100001]; _Compare = bool (*)(element, element)]':
/usr/include/c++/4.8/bits/stl_algo.h:1946:47:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[100001]; _Compare = bool (*)(element, element)]'
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = int (*)[100001]; _Compare = bool (*)(element, element)]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int (*)[100001]; _Size = int; _Compare = bool (*)(element, element)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int (*)[100001]; _Compare = bool (*)(element, element)]'
bingo.cpp:32:23:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:446:25: error: array must be initialized with a brace-enclosed initializer
    _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent));
                         ^

Cum funcționează evaluarea?