oj.uz

답안 #1095471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1095471 2024-10-02T10:44:29 Z stefanopulos JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 8 ms 3108 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005; 

int n, k;
string s;

queue<int> J, O, I;

int pref[mxN];
int sufi[mxN];

int f(char c){
    if(c == 'J')return 0;
    if(c == 'O')return 1;
    if(c == 'I')return 2;
    assert(false);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> k >> s; s = ' ' + s;   

    pref[0] = inf;
    ff(i,1,n){
        if(f(s[i]) == 0)J.push(i); 
        if(sz(J) > k)J.pop();

        pref[i] = pref[i - 1];
        if(sz(J) >= k){
            int l = J.front(); 
            int r = i;
            pref[i] = (r - l + 1) - k; 
        }   

    } 

    sufi[n + 1] = inf;
    fb(i,n,1){
        if(f(s[i]) == 2)I.push(i); 
        if(sz(I) > k)I.pop();

        sufi[i] = sufi[i + 1];
        if(sz(I) >= k){
            int l = i;
            int r = I.front(); 
            sufi[i] = (r - l + 1) - k; 
        }   

    }

    int rez = inf; // O
    ff(i,1,n){
        if(f(s[i]) == 1)O.push(i); 
        if(sz(O) > k)O.pop();

        if(sz(O) >= k){
            int l = O.front(); 
            int r = i;
            rez = min(rez, pref[l - 1] + sufi[r + 1] + (r - l + 1) - k);
        }        

    }

    cout << (rez == inf ? -1 : rez) << '\n';

    return 0;
}
/*
 
10 2
OJIJOIOIIJ

9 3
JJJOOOIII

9 1
IIIOOOJJJ

// probati bojenje sahovski
*/

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 408 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 468 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 408 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 468 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 2352 KB Output is correct
37 Correct 8 ms 2512 KB Output is correct
38 Correct 7 ms 2340 KB Output is correct
39 Correct 8 ms 2340 KB Output is correct
40 Correct 7 ms 2592 KB Output is correct
41 Correct 7 ms 2340 KB Output is correct
42 Correct 7 ms 2340 KB Output is correct
43 Correct 4 ms 1884 KB Output is correct
44 Correct 5 ms 2128 KB Output is correct
45 Correct 7 ms 2708 KB Output is correct
46 Correct 7 ms 2596 KB Output is correct
47 Correct 7 ms 2596 KB Output is correct
48 Correct 7 ms 2596 KB Output is correct
49 Correct 5 ms 1900 KB Output is correct
50 Correct 7 ms 2596 KB Output is correct
51 Correct 7 ms 2596 KB Output is correct
52 Correct 6 ms 2860 KB Output is correct
53 Correct 7 ms 3108 KB Output is correct
54 Correct 3 ms 2340 KB Output is correct
55 Correct 3 ms 2852 KB Output is correct
56 Correct 3 ms 3108 KB Output is correct