답안 #761842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
761842	2023-06-20T10:24:01 Z	sysia	JJOOII 2 (JOI20_ho_t2)	C++17	100 / 100	19 ms	11692 KB

ho_t2

//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

int change(char c){
    if (c == 'J') return 0;
    if (c == 'O') return 1;
    return 2;
}

void solve(){
    int n, k; cin >> n >> k;
    string s; cin >> s;
    s = "$" + s;
    vector nxt(n+1, vector<int>(3, -1));
    for (int rep = 0; rep < 3; rep++){
        int R = 1;
        int cnt = (change(s[1]) == rep);    
        for (int L = 1; L <= n; L++){
            while (R+1 <= n && cnt < k){
                R++;
                cnt += (change(s[R]) == rep);
            } 
            if (cnt == k){
                nxt[L][rep] = R;
            }
            cnt -= (change(s[L]) == rep);
        }
    }
    for (int i = 1; i<=n; i++){
        debug(i, nxt[i]);
    }
    int ans = oo;
    for (int i = 1; i<=n; i++){
        if (nxt[i][0] == -1) break;
        int x = nxt[i][0]+1;
        if (x > n || nxt[x][1] == -1) continue;
        int y = nxt[x][1]+1;
        if (y > n || nxt[y][2] == -1) continue;
        int j = nxt[y][2];
        debug(i, j);
        ans = min(ans, (j-i+1));
    }
    if (ans == oo) cout << "-1\n";
    else cout << ans - 3 * k << "\n";
}

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

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

Subtask #1
1.0 / 1.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	468 KB	Output is correct
20	Correct	1 ms	468 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	448 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	468 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	1 ms	468 KB	Output is correct
28	Correct	1 ms	468 KB	Output is correct
29	Correct	1 ms	456 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	468 KB	Output is correct
33	Correct	1 ms	468 KB	Output is correct
34	Correct	1 ms	468 KB	Output is correct
35	Correct	1 ms	468 KB	Output is correct

Subtask #3
87.0 / 87.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	468 KB	Output is correct
20	Correct	1 ms	468 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	448 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	468 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	1 ms	468 KB	Output is correct
28	Correct	1 ms	468 KB	Output is correct
29	Correct	1 ms	456 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	468 KB	Output is correct
33	Correct	1 ms	468 KB	Output is correct
34	Correct	1 ms	468 KB	Output is correct
35	Correct	1 ms	468 KB	Output is correct
36	Correct	15 ms	10876 KB	Output is correct
37	Correct	19 ms	11592 KB	Output is correct
38	Correct	18 ms	11676 KB	Output is correct
39	Correct	18 ms	11432 KB	Output is correct
40	Correct	17 ms	11572 KB	Output is correct
41	Correct	17 ms	11632 KB	Output is correct
42	Correct	18 ms	11692 KB	Output is correct
43	Correct	11 ms	7380 KB	Output is correct
44	Correct	13 ms	9124 KB	Output is correct
45	Correct	17 ms	11644 KB	Output is correct
46	Correct	17 ms	11676 KB	Output is correct
47	Correct	17 ms	11688 KB	Output is correct
48	Correct	17 ms	11676 KB	Output is correct
49	Correct	12 ms	7892 KB	Output is correct
50	Correct	16 ms	11676 KB	Output is correct
51	Correct	17 ms	11664 KB	Output is correct
52	Correct	16 ms	11184 KB	Output is correct
53	Correct	15 ms	11676 KB	Output is correct
54	Correct	12 ms	11676 KB	Output is correct
55	Correct	12 ms	11648 KB	Output is correct
56	Correct	12 ms	11676 KB	Output is correct

답안 #761842

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 12.0 / 12.0

Subtask #3 87.0 / 87.0

Subtask #1
1.0 / 1.0

Subtask #2
12.0 / 12.0

Subtask #3
87.0 / 87.0