oj.uz

답안 #536029

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536029 2022-03-12T07:15:09 Z browntoad JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 23 ms 10248 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define RREP1(i,n) for (int i=(n); i>=1; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=5005;
const double PI=acos(-1);
 
ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================

vector<int> pf[3];
signed main (){
    IOS();
    int n, k; cin>>n>>k;
    REP(i, 3) pf[i].resize(n);
    string str; cin>>str;
    vector<int> pfj(n), pfo(n), pfi(n);
    REP(i,n){
        pf[0][i]=(str[i]=='J');
        pf[1][i]=(str[i]=='O');
        pf[2][i]=(str[i]=='I');
        if (i>0){
            REP(j, 3){
                pf[j][i]+=pf[j][i-1];
            }
        }
    }
    vector<char> mat(3);
    mat[0]='J'; mat[1]='O'; mat[2]='I';
    int ans=inf;
    REP(i,n){
        if (str[i]!='J') continue;
        int a=i;
        bool gg=false;
        REP(j, 3){
            if (a>=n){
                gg=1;
                break;
            }
            //cout<<a<<' '<<str[a]<<endl;
            a=lower_bound(ALL(pf[j]), pf[j][a]+k-(str[a]==mat[j]))-pf[j].begin();
            if (a>=n) {
                gg=1;
                break;
            }
            a++;
        }
        if (!gg) ans=min(ans, a-i-k*3);
    }
    if (ans==inf) ans=-1;
    cout<<ans<<endl;
}

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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 232 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 232 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 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 448 KB Output is correct
17 Correct 1 ms 448 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 1 ms 448 KB Output is correct
21 Correct 1 ms 448 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Correct 1 ms 448 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 448 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 444 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 232 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 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 448 KB Output is correct
17 Correct 1 ms 448 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 1 ms 448 KB Output is correct
21 Correct 1 ms 448 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Correct 1 ms 448 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 448 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 444 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 18 ms 9568 KB Output is correct
37 Correct 18 ms 10200 KB Output is correct
38 Correct 18 ms 10208 KB Output is correct
39 Correct 23 ms 10148 KB Output is correct
40 Correct 14 ms 10208 KB Output is correct
41 Correct 17 ms 10204 KB Output is correct
42 Correct 20 ms 10248 KB Output is correct
43 Correct 9 ms 6484 KB Output is correct
44 Correct 14 ms 8032 KB Output is correct
45 Correct 14 ms 10208 KB Output is correct
46 Correct 15 ms 10208 KB Output is correct
47 Correct 14 ms 10208 KB Output is correct
48 Correct 16 ms 10244 KB Output is correct
49 Correct 10 ms 6872 KB Output is correct
50 Correct 14 ms 10128 KB Output is correct
51 Correct 13 ms 10208 KB Output is correct
52 Correct 10 ms 9872 KB Output is correct
53 Correct 9 ms 10208 KB Output is correct
54 Correct 13 ms 10208 KB Output is correct
55 Correct 10 ms 10200 KB Output is correct
56 Correct 10 ms 10208 KB Output is correct