Submission #975202

# Submission time Handle Problem Language Result Execution time Memory
975202 2024-05-04T14:46:09 Z Nipphitch Martian DNA (BOI18_dna) C++17
0 / 100
30 ms 6996 KB
#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 time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 11 ms 5340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 6996 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -