oj.uz

Submission #451949

# Submission time Handle Problem Language Result Execution time Memory
451949 2021-08-03T13:53:45 Z Sarah_Mokhtar Martian DNA (BOI18_dna) C++14
0 / 100
 74 ms 4116 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define read freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define LESSGO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll N=3e5+10,M=505,OO=1e16,mod=1e9+7;
int n,k,q,req[N],a[N];
bool ok(int x){
    int cnt[N]={0},vis[N]={0};
    int valid=0;
    for(int i=0;i<x;++i){
        if(!req[a[i]]) continue;
        cnt[a[i]]++;
        if(cnt[a[i]]==req[a[i]]&&!vis[a[i]]){
            vis[a[i]]=1;
            ++valid;
        } 
    }
    if(valid==q) return 1;
    for(int i=0,j=x;j<n;++i,++j){
        cnt[a[i]]--;
        if(req[a[i]]&&cnt[a[i]]<req[a[i]]){
            vis[a[i]]=0;
            --valid;
        }
        cnt[a[j]]++;
        if(req[a[j]]&&cnt[a[j]]>=req[a[j]]&&!vis[a[j]]){
            ++valid;
            vis[a[j]]=1;
        }
        if(valid==q) return 1; 
    }
    return valid==q;
    
}
int bs(){
    int low=0,high=n,med;
    while(low<high){
        med=(low+high)>>1;
        if(ok(med)) high=med;
        else low=med+1;
    }
    return low;
}
int main(){
    LESSGO;
    cin>>n>>k>>q;
    for(int i=0;i<n;++i) cin>>a[i];
    for(int i=0;i<q;++i){
        int x,y; cin>>x>>y;
        req[x]=y;
    }
    int len=bs();
    if(ok(len)) cout<<len<<'\n';
    else cout<<"impossible\n";



}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Incorrect 2 ms 2636 KB Output isn't correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 2636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 3432 KB Output is correct
2 Incorrect 42 ms 3432 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 3736 KB Output is correct
2 Correct 57 ms 3660 KB Output is correct
3 Correct 56 ms 3692 KB Output is correct
4 Correct 20 ms 3408 KB Output is correct
5 Correct 68 ms 3816 KB Output is correct
6 Incorrect 74 ms 4116 KB Output isn't correct
7 Halted 0 ms 0 KB -