oj.uz

답안 #403104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403104 2021-05-12T18:35:04 Z bigDuck JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 21 ms 17152 KB 
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll

int t, n, m, k, a[300010], q, l, r;

int ord[300010][3], p[300010][3];
char s[200010];



int32_t main(){
INIT
cin>>n>>k;

for(int i=1; i<=(2*n); i++){
    ord[i][0]=ord[i][1]=ord[i][2]=0;
    p[i][0]=p[i][1]=p[i][2]=0;
}

for(int i=1; i<=n; i++){
    p[i][0]=p[i-1][0];
    p[i][1]=p[i-1][1];
    p[i][2]=p[i-1][2];

    cin>>s[i];
    if(s[i]=='J'){
        p[i][0]++;
        ord[p[i][0] ][0]=i;
    }
    if(s[i]=='O'){
        p[i][1]++;
        ord[p[i][1] ][1]=i;
    }
    if(s[i]=='I'){
        p[i][2]++;
        ord[p[i][2] ][2]=i;
    }

}



int res=-1;
for(int i=1; i<=n; i++){
    int r0=ord[p[i-1][0]+k ][0];
    int r1=ord[p[r0][1]+k  ][1];
    int r2=ord[p[r1][2]+k ][2];
    //int r=ord[p[ord[p[ord[p[i-1][0]+k ][0] ][1]+k  ][1] ][2]+k ][2];
    //cout<<r2<<" "<<res<<"\n";
    //cout<<r0<<" "<<r1<<" "<<r2<<"\n";
    if( (r2!=0) && (r1!=0) && (r0!=0) ){
        if(res==-1){
            res=r2-i+1-3*k;
        }
        else{
            res=min(res, r2-i+1-3*k);
        }
    }
}
cout<<res;



return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 1 ms 588 KB Output is correct
23 Correct 1 ms 456 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 1 ms 584 KB Output is correct
26 Correct 1 ms 588 KB Output is correct
27 Correct 1 ms 588 KB Output is correct
28 Correct 1 ms 588 KB Output is correct
29 Correct 1 ms 584 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 2 ms 600 KB Output is correct
33 Correct 1 ms 588 KB Output is correct
34 Correct 1 ms 588 KB Output is correct
35 Correct 1 ms 588 KB Output is correct
36 Correct 15 ms 16468 KB Output is correct
37 Correct 21 ms 17100 KB Output is correct
38 Correct 16 ms 17140 KB Output is correct
39 Correct 16 ms 17044 KB Output is correct
40 Correct 16 ms 17104 KB Output is correct
41 Correct 16 ms 17124 KB Output is correct
42 Correct 16 ms 17080 KB Output is correct
43 Correct 11 ms 12184 KB Output is correct
44 Correct 13 ms 14924 KB Output is correct
45 Correct 16 ms 17152 KB Output is correct
46 Correct 16 ms 17144 KB Output is correct
47 Correct 15 ms 17036 KB Output is correct
48 Correct 18 ms 17136 KB Output is correct
49 Correct 12 ms 13004 KB Output is correct
50 Correct 18 ms 17100 KB Output is correct
51 Correct 15 ms 17152 KB Output is correct
52 Correct 15 ms 16716 KB Output is correct
53 Correct 15 ms 17148 KB Output is correct
54 Correct 14 ms 17100 KB Output is correct
55 Correct 14 ms 17100 KB Output is correct
56 Correct 14 ms 17028 KB Output is correct