Submission #888000

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
888000	2023-12-15 18:01:52	oviyan_gandhi	JJOOII 2 (JOI20_ho_t2)	C++17	100 / 100	12 ms	8308 KiB

ho_t2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e17;
typedef vector<int> vi; typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;
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];
    vector<pii> jc;
    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);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 12 / 12
• Subtask 3: 87 / 87