oj.uz

답안 #556533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
556533 2022-05-03T10:07:43 Z alextodoran JJOOII 2 (JOI20_ho_t2) C++17
0 / 100
 1 ms 340 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 200000;

int N, K;
string S;

int first[CHAR_MAX];
int nxt[N_MAX];

deque <int> dq[CHAR_MAX];

bool fix (char c, int pref) {
    int aux = nxt[dq[c].back()];
    while (dq[c].empty() == false && dq[c].front() <= pref) {
        dq[c].pop_front();
    }
    while ((int) dq[c].size() < K) {
        dq[c].push_back(aux);
        aux = nxt[dq[c].back()];
    }
    return (dq[c].back() != N);
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> N >> K;
    cin >> S;

    first['J'] = first['O'] = first['I'] = N;
    nxt[N] = N;
    for (int i = N - 1; i >= 0; i--) {
        nxt[i] = first[S[i]];
        first[S[i]] = i;
    }

    for (int i = 0; i < N; i++) {
        if ((int) dq['J'].size() < K) {
            if (S[i] == 'J') {
                dq['J'].push_back(i);
            }
        } else if ((int) dq['O'].size() < K) {
            if (S[i] == 'O') {
                dq['O'].push_back(i);
            }
        } else if ((int) dq['I'].size() < K) {
            if (S[i] == 'I') {
                dq['I'].push_back(i);
            }
        }
    }

    if ((int) dq['I'].size() < K) {
        cout << -1 << "\n";
        return 0;
    }

    int maxDel = 0;
    for (int pref = 0; pref < N; pref++) {
        maxDel = max(maxDel, pref + (N - 1) - dq['I'].back());
        if (S[pref] == 'J') {
            if (fix('J', pref) == false) {
                break;
            }
            if (fix('O', dq['J'].back()) == false) {
                break;
            }
            if (fix('I', dq['O'].back()) == false) {
                break;
            }
        }
    }
    cout << N - K * 3 - maxDel << "\n";

    return 0;
}

Compilation message

ho_t2.cpp: In function 'bool fix(char, int)':
ho_t2.cpp:26:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   26 |     int aux = nxt[dq[c].back()];
      |                      ^
ho_t2.cpp:27:15: warning: array subscript has type 'char' [-Wchar-subscripts]
   27 |     while (dq[c].empty() == false && dq[c].front() <= pref) {
      |               ^
ho_t2.cpp:27:41: warning: array subscript has type 'char' [-Wchar-subscripts]
   27 |     while (dq[c].empty() == false && dq[c].front() <= pref) {
      |                                         ^
ho_t2.cpp:28:12: warning: array subscript has type 'char' [-Wchar-subscripts]
   28 |         dq[c].pop_front();
      |            ^
ho_t2.cpp:30:21: warning: array subscript has type 'char' [-Wchar-subscripts]
   30 |     while ((int) dq[c].size() < K) {
      |                     ^
ho_t2.cpp:31:12: warning: array subscript has type 'char' [-Wchar-subscripts]
   31 |         dq[c].push_back(aux);
      |            ^
ho_t2.cpp:32:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   32 |         aux = nxt[dq[c].back()];
      |                      ^
ho_t2.cpp:34:16: warning: array subscript has type 'char' [-Wchar-subscripts]
   34 |     return (dq[c].back() != N);
      |                ^
ho_t2.cpp: In function 'int main()':
ho_t2.cpp:48:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   48 |         nxt[i] = first[S[i]];
      |                            ^
ho_t2.cpp:49:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   49 |         first[S[i]] = i;
      |                   ^

Subtask #1
0 / 1.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 87.0

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