oj.uz

Submission #622297

# Submission time Handle Problem Language Result Execution time Memory
622297 2022-08-04T06:44:10 Z Urvuk3 Martian DNA (BOI18_dna) C++17
100 / 100
 33 ms 4496 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
ll INF=1e9,LINF=1e18,MOD=1e9+7;
#define fi first
#define se second
#define pii pair<int,int>
#define mid ((l+r)/2)
#define sz(a) (int((a).size()))
#define all(a) a.begin(),a.end()
#define endl "\n"
#define PRINT(x) cerr<<#x<<'-'<<x<<endl<<flush;
#define pb push_back
#define PRINTvec(x) { cerr<<#x<<"-"; for(auto h:x) cerr<<h<<" "; cerr<<endl; }

void Solve(){
    int N,K,R; cin>>N>>K>>R;
    vector<int> D(N+1);
    for(int i=1;i<=N;i++) cin>>D[i];
    vector<int> treba(K,0);
    for(int i=1;i<=R;i++){
        int x,y; cin>>x>>y;
        treba[x]=y;
    }
    vector<int> kolko(K,0);
    int i=1,j=1; kolko[D[1]]++;
    int aktivnih_dovoljno=0;
    for(int i=0;i<K;i++){
        if(kolko[i]>=treba[i]) aktivnih_dovoljno++;
    }
    int res=INF;
    while(i<=j){
        if(aktivnih_dovoljno==K){
            res=min(res,j-i+1);
            int levi=D[i];
            i++;
            if(i>j) break;
            int staro_kolko=kolko[levi],novo_kolko=--kolko[levi];
            if(staro_kolko>=treba[levi] && novo_kolko<treba[levi]){
                aktivnih_dovoljno--;
            }
        }
        else if(j==N){
            int levi=D[i];
            i++;
            if(i>j) break;
            int staro_kolko=kolko[levi],novo_kolko=--kolko[levi];
            if(staro_kolko>=treba[levi] && novo_kolko<treba[levi]){
                aktivnih_dovoljno--;
            }
        }
        else{
            j++;
            if(i>j) break;
            int desni=D[j];
            int staro_kolko=kolko[desni],novo_kolko=++kolko[desni];
            if(staro_kolko<treba[desni] && novo_kolko>=treba[desni]){
                aktivnih_dovoljno++;
            }
        }
    }
    cout<<(res!=INF ? to_string(res) : "impossible")<<endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t; t=1;
    //cin>>t;
    while(t--){
        Solve();
    }
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1492 KB Output is correct
2 Correct 12 ms 1492 KB Output is correct
3 Correct 12 ms 1492 KB Output is correct
4 Correct 11 ms 1492 KB Output is correct
5 Correct 18 ms 2900 KB Output is correct
6 Correct 11 ms 1488 KB Output is correct
7 Correct 12 ms 1620 KB Output is correct
8 Correct 18 ms 3924 KB Output is correct
9 Correct 14 ms 1996 KB Output is correct
10 Correct 10 ms 1492 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 324 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 316 KB Output is correct
25 Correct 0 ms 212 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 3468 KB Output is correct
2 Correct 26 ms 3136 KB Output is correct
3 Correct 21 ms 2772 KB Output is correct
4 Correct 9 ms 1492 KB Output is correct
5 Correct 33 ms 4040 KB Output is correct
6 Correct 33 ms 4496 KB Output is correct
7 Correct 16 ms 2120 KB Output is correct
8 Correct 19 ms 2388 KB Output is correct
9 Correct 11 ms 1492 KB Output is correct
10 Correct 12 ms 1492 KB Output is correct
11 Correct 13 ms 1488 KB Output is correct
12 Correct 11 ms 1492 KB Output is correct
13 Correct 17 ms 2764 KB Output is correct
14 Correct 12 ms 1492 KB Output is correct
15 Correct 19 ms 1620 KB Output is correct
16 Correct 20 ms 3896 KB Output is correct
17 Correct 17 ms 2000 KB Output is correct
18 Correct 12 ms 1488 KB Output is correct
19 Correct 1 ms 324 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 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 324 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 324 KB Output is correct
32 Correct 1 ms 324 KB Output is correct
33 Correct 1 ms 212 KB Output is correct