oj.uz

답안 #748738

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
748738 2023-05-26T20:27:58 Z Desh03 JJOOII 2 (JOI20_ho_t2) C++17
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

const int INF = 1e9;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, k, ans = INF;
    cin >> n >> k;
    string s;
    cin >> s;
    vector<int> v(n);
    for (int i = 0; i < n; i++) v[i] = s[i] == 'J' ? 0 : s[i] == 'O' ? 1 : 2;
    vector<vector<int>> p(3, vector<int> (n + 1));
    for (int i = 0; i < 3; i++)
        for (int j = 0; j < n; j++)
            p[i][j + 1] = p[i][j] + (v[j] == i);
    for (int i = 0; i < n; i++) {
        if (v[i] == 0) {
            int s = i;
            for (int j = 0; j < 3; j++) {
                if (p[j][n] - p[j][s] < k) break;
                int l = s + 1, r = n;
                while (l < r) {
                    int m = l + r >> 1;
                    if (p[j][m] - p[j][s] < k) l = m + 1;
                    else if (p[j][m] - p[j][s] == k) {
                        s = m;
                        break;
                    } else r = m - 1;
                }
                if (j == 2) ans = min(ans, s - i);
            }
        }
    }
    cout << (ans == INF ? -1 : ans - 3 * k) << '\n';
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:26:31: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |                     int m = l + r >> 1;
      |                             ~~^~~

Subtask #1
0 / 1.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 87.0

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