#include<bits/stdc++.h>
using namespace std;
int mini[10],skg[10];
int s[200005];
bool check(){
for(int i=0;i<10;i++){
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;
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 |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Runtime error |
1 ms |
492 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
1516 KB |
Output is correct |
2 |
Correct |
16 ms |
1516 KB |
Output is correct |
3 |
Correct |
20 ms |
1516 KB |
Output is correct |
4 |
Correct |
16 ms |
1516 KB |
Output is correct |
5 |
Incorrect |
18 ms |
2284 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
20 ms |
2796 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |