This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int mini[10],skg[10];
int s[200005];
vector<int> v;
bool check(){
for(auto i : v){
if(skg[i]<mini[i])return false;
}
return true;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n,k,r,x,y;
cin >> n >> k >> r;
for(int i=0;i<n;i++)cin >> s[i];
for(int i=1;i<=r;i++){
cin >> x >> y;
v.push_back(x);
mini[x]=y;
}
int ans=n+1;
int awal=0,akhir=0;
skg[s[0]]++;
while(awal<=akhir && akhir<n){
bool stat=check();
if(!stat){
if(akhir<n-1){
akhir++;
skg[s[akhir]]++;
}
else break;
}
else{
ans=min(ans,akhir-awal+1);
skg[s[awal]]--;
awal++;
}
}
if(ans==n+1)cout << "impossible\n";
else cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |