oj.uz

답안 #443560

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443560 2021-07-10T19:43:18 Z MilosMilutinovic JJOOII 2 (JOI20_ho_t2) C++14
0 / 100
 1 ms 312 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  vector<int> pref(n);
  for (int i = 0; i < n; i++) {
    if (i > 0) {
      pref[i] = pref[i - 1];
    }
    if (s[i] == 'O') {
      pref[i]++;
    }
  }
  vector<int> x, y;
  for (int i = 0; i < n; i++) {
  	if (s[i] == 'J') {
      x.push_back(i);
    }
    if (s[i] == 'I') {
      y.push_back(i);
    }
  }
  int ans = n + 1;
  for (int i = k - 1, j = 0; i < (int) x.size(); i++) {
    while (j < (int) y.size() && pref[y[j]] - pref[x[i]] < k) {
      j++;
    }
    if (j <= (int) y.size() - k && pref[y[j]] - pref[x[i]] >= k) {
      ans = min(ans, n - 3 * k - x[i] - (n - y[j] - 1));  
    }
  }
  cout << (ans > n ? -1 : ans);
  return 0;
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -