Submission #583932

#TimeUsernameProblemLanguageResultExecution timeMemory
583932forelaxJJOOII 2 (JOI20_ho_t2)C++14
0 / 100
1 ms212 KiB
#include<bits/stdc++.h> using namespace std; int main() { string s; int n; int K; cin >> n >> K; cin >> s; int rez = n; int j, k, l, cj = 0, co = 0, ci = 0; for (j = 0;j < n && cj < K;j++) { if (s[j] == 'J')cj++; } if (cj != K) { cout << -1; return 0; } for (k = j;k < n && co < K;k++) { if (s[k] == 'O')co++; } if (co != K) { cout << -1; return 0; } for (l = k;l < n && ci < K;l++) { if (s[l] == 'I')ci++; } if (ci != K) { cout << -1; return 0; } for (int i = 0; i < n; i++) { if (s[i] == 'J') { cj--; for (;j < n && cj < K;j++) { if (s[j] == 'J')cj++; if (s[j] == 'O') for (;k < n && co < K;k++) { if (s[k] == 'O')co++; if (s[k] == 'I') for (;l < n && ci < K;l++) { if (s[l] == 'I')ci++; } } } } if (cj == K && co == K && ci == K) { rez = min(rez, l - i + 1 - 3 * K); } } cout << rez; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...