제출 #717593

#제출 시각아이디문제언어결과실행 시간메모리
717593vjudge1JJOOII 2 (JOI20_ho_t2)C++17
0 / 100
1 ms2644 KiB
#include <bits/stdc++.h> using namespace std; vector<vector<int> > dp(2, vector<int> (200010, 0)); vector<char> word(200010), pat(70010); int n, k; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for(int i = 1; i <= n; i++) cin >> word[i]; for(int i = 1; i <= k; i++) pat[i] = 'J'; for(int i = 1; i <= k; i++) pat[i + k] = 'O'; for(int i = 1; i <= k; i++) pat[i + 2 * k] = 'I'; for(int i = 0; i <= n; i++) dp[0][i] = 0; for(int i = 1; i <= 3 * k; i++) { int now = i & 1, prev = (i - 1) & 1; dp[now][0] = 2e9; for(int j = 1; j <= n; j++) { if(pat[i] == word[j]) { dp[now][j] = dp[prev][j - 1]; } else { dp[now][j] = min((int)2e9, dp[now][j - 1] + 1); } } } int res = 2e9; for(int i = n; i >= 3 * k; i--) { if(word[i] == pat[3 * k]) { res = min(res, dp[0][i]); } } cout << (res == (int)2e9 ? -1 : res) << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...