제출 #1123828

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123828		emyz	Martian DNA (BOI18_dna)	C++20	0 / 100	65 ms	2120 KiB

dna

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n, k, r;
	cin>>n>>k>>r;
	int l[n], sum[k]={0}, min=n+1, need[n]={0}, complete=0;
	bool full[k] = {false};
	for (int i=0; i<n; ++i)
	{
		cin>>l[i];
		need[i]=1;
	}
	for (int i=0; i<r; ++i)
	{
		int a,b;
		cin>>a>>b;
		need[a]=b;
	}
	int left=0, right=0;
	int change=1;
	for (; right<n;)
	{
		if (change==0)
		{
			sum[l[left-1]]--;
			if (need[l[left-1]]>sum[l[left-1]])
			{
				complete--;
			}
		}
		else if (change==1)
		{
			sum[l[right]]++;
			if (need[l[right]]==sum[l[right]])
			{
				complete++;
			}
		}
		if (complete==k)
		{
			change=0;
			left++;
			if (right-left+2<min)
			{
				min=right-left+2;
			}
		}
		else
		{
			right++;
			change=1;
		}
	}
	if (min>=n)
	{
		cout<<"impossible";
	}
	else
	{
		cout<<min<<endl;
	}
}

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