답안 #887999

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887999	2023-12-15T17:42:42 Z	oviyan_gandhi	JJOOII 2 (JOI20_ho_t2)	C++17	13 / 100	2000 ms	8032 KB

ho_t2

#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int> vi; typedef vector<vector<int>> vvi;

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, k; cin >> n >> k;
    string s; cin >> s;
    vi bo(n), ao(n), co(n); // nearest O before i, nearest O after i, count of O
    bo[0] = (s[0] == 'O') - 1;
    co[0] = (s[0] == 'O');
    for (int i = 1; i < n; i++){
        bo[i] = (s[i] == 'O') ? i : bo[i-1];
        co[i] = co[i-1] + (s[i] == 'O');
    }
    ao[n-1] = (s[n-1] == 'O') ? n-1 : -1;
    for (int i = n-2; i >= 0; i--)
        ao[i] = (s[i] == 'O') ? i : ao[i+1];
    vi jc(n, -1); // cost if last J is at i
    deque<int> d; int cost = 0;
    for (int i = 0; i < n; i++){
        if (s[i] != 'J') continue;
        if (!d.empty())
            cost += i - d.back() - 1;
        d.push_back(i);
        if ((int)d.size() == k+1){
            int f = d.front();
            d.pop_front();
            cost -= d.front() - f - 1;
        }
        if ((int)d.size() == k)
            jc[i] = cost;
    }
    vi ic(n, -1); // cost if last I is at i
    d.clear(); cost = 0;
    for (int i = n-1; i >= 0; i--){
        if (s[i] != 'I') continue;
        if (!d.empty())
            cost += d.back() - i - 1;
        d.push_back(i);
        if ((int)d.size() == k+1){
            int f = d.front();
            d.pop_front();
            cost -= f - d.front() - 1;
        }
        if ((int)d.size() == k)
            ic[i] = cost;
    }
    int ans = -1;
    for (int i = 0; i < n; i++){
        if (jc[i] == -1) continue;
        for (int j = i+2; j < n; j++){
            if (ic[j] == -1 || co[j-1] - co[i] < k) continue;
            int cost = jc[i] + ic[j] + (j - i - 1 - k);
            if (ans == -1 || ans > cost)
                ans = cost;
        }
    }
    cout << ans << endl;
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	460 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	2 ms	600 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	2 ms	460 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	580 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	452 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	2 ms	344 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct

Subtask #3
0 / 87.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	460 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	2 ms	600 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	2 ms	460 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	580 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	452 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	2 ms	344 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Execution timed out	2037 ms	8032 KB	Time limit exceeded
37	Halted	0 ms	0 KB	-

답안 #887999

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 87.0

Subtask #1
1.0 / 1.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 87.0