제출 #1185792

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1185792		Zbyszek99	JJOOII 2 (JOI20_ho_t2)	C++20	0 / 100	0 ms	324 KiB

ho_t2

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int ans[200'001][4];
vi prev_[3];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,k;
    string s;
    cin >> n >> k >> s;
    rep(j,3) ans[n][j] = 1e7;
    int ans2 = 1e7;
    for(int i = n-1; i >= 0; i--)
    {
        int v = 0;
        if(s[i] == 'J') v = 0;
        else if(s[i] == 'O') v = 1;
        else v = 2;
        prev_[v].pb(i);
        rep(j,3) ans[i][j] = ans[i+1][j];
        if(siz(prev_[v]) >= k)
        {
            ans[i][v] = prev_[v][siz(prev_[v])-k] - i -k +1 + ans[prev_[v][siz(prev_[v])-k]][v+1];
        }
        ans2 = min(ans2,ans[i][0]);
    }
    if(ans2 != 1e7) cout << ans2 << "\n";
    else cout << "-1\n";
}

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