Submission #975202

#TimeUsernameProblemLanguageResultExecution timeMemory
975202Nipphitch Martian DNA (BOI18_dna)C++17
0 / 100
30 ms6996 KiB
#include <bits/stdc++.h> using namespace std; const int N=2e5+5; int n,k,r,a[N],cnt[N],ans,mn[N],p=1; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> k >> r; for(int i=1;i<=n;i++) cin >> a[i]; for(int i=0;i<r;i++){ int x,y; cin >> x >> y; mn[x]=y; } for(int i=0;i<k;i++) while(cnt[i]<mn[i] && p<=n) cnt[a[p++]]++; for(int i=0;i<k;i++){ if(cnt[i]<mn[i]){ cout << "impossible"; return 0; } } ans=p-1; for(int i=1;i<=n;i++){ cnt[a[i]]--; while(cnt[a[i]]<mn[a[i]]) cnt[a[p++]]++; ans=min(ans,p-i-1); } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...