Submission #255121

#TimeUsernameProblemLanguageResultExecution timeMemory
255121AM1648JJOOII 2 (JOI20_ho_t2)C++17
0 / 100
1 ms384 KiB
/* be name khoda */ #include <bits/stdc++.h> using namespace std; typedef int ll; #define forifrom(i, s, n) for (ll i = s; i < n; ++i) #define fori(i, n) forifrom(i, 0, n) // ------------------------------------------------------------------ const ll maxn = 200010; ll n, k, cnt[3][maxn], mapp[128]; string S; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); mapp['J'] = 0, mapp['O'] = 1, mapp['I'] = 2; cin >> n >> k >> S; fori (i, n) ++cnt[mapp[S[i]]][i + 1]; fori (i, 3) fori (j, n + 1) cnt[i][j + 1] += cnt[i][j]; ll ans = -1; fori (i, n) { ll i1 = lower_bound(cnt[0], cnt[0] + n + 1, k + cnt[0][i]) - cnt[0]; ll i2 = lower_bound(cnt[1], cnt[1] + n + 1, k + cnt[1][i1]) - cnt[1]; ll i3 = lower_bound(cnt[2], cnt[2] + n + 1, k + cnt[2][i2]) - cnt[2]; if (i3 <= n) ans = max(ans, i + n - i3); } cout << ans << '\n'; }

Compilation message (stderr)

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:22:32: warning: array subscript has type 'char' [-Wchar-subscripts]
     fori (i, n) ++cnt[mapp[S[i]]][i + 1];
                                ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...