제출 #657338

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
657338		teesla	Martian DNA (BOI18_dna)	C++14	100 / 100	102 ms	4488 KiB

dna

#include <bits/stdc++.h>
using namespace std; 
const int maxn=2*1e5+10;
const int inf=1e8;

int v[maxn], nucleo[maxn], qnt[maxn];

int main(){
	int n,k,r;
	cin >> n>> k>> r;

	int rest=r;
	int res=inf;

	for(int i=0; i<n; i++)cin >> v[i];

	for(int i=1; i<=r; i++){
		int a,b;
		cin >> a >> b;
		nucleo[a]=b;
	}

	int i=0,f=0;

	int y=v[i];
	qnt[y]++;
	if(nucleo[0]!=0 and qnt[y]==nucleo[0]) rest--;

	while(i<n and f<n and i<=f){

		if(rest==0){
			res=min(res,f-i+1);
			int x=v[i];
			qnt[x]--;
			if(nucleo[x]!=0 and qnt[x]==nucleo[x]-1) rest++;
			i++;
		}

		else{
			f++;
			int x=v[f];
			qnt[x]++;
			if(nucleo[x]!=0 and nucleo[x]==qnt[x]) rest--;
		}
	}

	if(res==inf)cout << "impossible"<<endl;
	else cout << res<< endl;
	return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 24 / 24
• Subtask 3: 28 / 28
• Subtask 4: 32 / 32