oj.uz

답안 #1051922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1051922 2024-08-10T10:36:46 Z fryingduc JJOOII 2 (JOI20_ho_t2) C++17
0 / 100
 0 ms 2396 KB 
#include "bits/stdc++.h"
using namespace std;

const int maxn = 2e5 + 5;
int n, k, a[maxn], pref[maxn], suf[maxn];
int ps[maxn];

string s;

void solve() {
    cin >> n >> k >> s;
    s = ' ' + s;
    vector<int> lst;
    for(int i = 1; i <= n; ++i) {
        ps[i] = ps[i - 1] + (s[i] == 'O');
        if(s[i] != 'J') continue;
        lst.push_back(i);
        if((int)lst.size() < k) continue;
        int pos = lst[(int)lst.size() - k];
        
        pref[i] = (i - pos - k + 1);
    }
    lst.clear();
    memset(suf, 0x3f, sizeof(suf));
    for(int i = n; i; --i) {
        if(s[i] != 'I') continue;
        lst.push_back(i);
        if((int)lst.size() < k) continue;
        int pos = lst[(int)lst.size() - k];
        suf[i] = (pos - i - k + 1);
    }
    for(int i = n - 1; i; --i) {
        suf[i] = min(suf[i + 1], suf[i]);
    }
    int ans = 1e9;
    for(int i = 1; i <= n; ++i) {
        if(s[i] != 'J') continue;
        int x = lower_bound(ps + 1, ps + n + 1, ps[i] + k) - ps;
        if(x > n) continue;
        ans = min(ans, (x - i - k) + pref[i] + suf[x + 1]);
    }
    
    cout << (ans == 1e9 ? -1 : ans);
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
    return 0;
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -