oj.uz

Submission #788259

# Submission time Handle Problem Language Result Execution time Memory
788259 2023-07-20T03:56:42 Z winter0101 JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 14 ms 2204 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define pil pair<int,long long>
vector<int>pos[3];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    int n,k;
    cin>>n>>k;
    string s;
    cin>>s;
    s=" "+s;
    int ans=n+1;
    for1(i,1,n){
    if (s[i]=='J')pos[0].pb(i);
    if (s[i]=='O')pos[1].pb(i);
    if (s[i]=='I')pos[2].pb(i);
    }
    for1(i,1,n){
    if (s[i]=='J'){
        int id=lower_bound(pos[0].begin(),pos[0].end(),i)-pos[0].begin();
        if (id+k-1>=sz(pos[0]))continue;
        int l1=i,r1=pos[0][id+k-1];
        //if (i==2)cout<<l1<<" "<<r1<<'\n';
        int id2=upper_bound(pos[1].begin(),pos[1].end(),r1)-pos[1].begin();
        if (id2==sz(pos[1])||id2+k-1>=sz(pos[1]))continue;
        int l2=pos[1][id2],r2=pos[1][id2+k-1];
        //if (i==2)cout<<l2<<" "<<r2<<'\n';
        int id3=upper_bound(pos[2].begin(),pos[2].end(),r2)-pos[2].begin();
        if (id3==sz(pos[2])||id3+k-1>=sz(pos[2]))continue;
        int l3=pos[2][id3],r3=pos[2][id3+k-1];
        //if (i==2)cout<<l3<<" "<<r3<<'\n';
        ans=min(ans,r3-l1+1-3*k);
    }
    }
    if (ans>n)ans=-1;
    cout<<ans;

}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:43:13: warning: unused variable 'l2' [-Wunused-variable]
   43 |         int l2=pos[1][id2],r2=pos[1][id2+k-1];
      |             ^~
ho_t2.cpp:47:13: warning: unused variable 'l3' [-Wunused-variable]
   47 |         int l3=pos[2][id3],r3=pos[2][id3+k-1];
      |             ^~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 320 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 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 320 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 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 272 KB Output is correct
33 Correct 1 ms 316 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 320 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 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 272 KB Output is correct
33 Correct 1 ms 316 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 13 ms 1672 KB Output is correct
37 Correct 14 ms 2076 KB Output is correct
38 Correct 14 ms 1940 KB Output is correct
39 Correct 13 ms 1948 KB Output is correct
40 Correct 11 ms 1948 KB Output is correct
41 Correct 12 ms 2040 KB Output is correct
42 Correct 14 ms 2080 KB Output is correct
43 Correct 6 ms 1356 KB Output is correct
44 Correct 8 ms 1480 KB Output is correct
45 Correct 10 ms 2204 KB Output is correct
46 Correct 11 ms 1948 KB Output is correct
47 Correct 10 ms 1936 KB Output is correct
48 Correct 10 ms 1948 KB Output is correct
49 Correct 8 ms 1472 KB Output is correct
50 Correct 12 ms 2192 KB Output is correct
51 Correct 10 ms 1968 KB Output is correct
52 Correct 7 ms 1688 KB Output is correct
53 Correct 8 ms 1948 KB Output is correct
54 Correct 7 ms 1932 KB Output is correct
55 Correct 6 ms 1984 KB Output is correct
56 Correct 5 ms 1940 KB Output is correct