Submission #927156

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
927156	2024-02-14T10:41:53 Z	vjudge1	Martian DNA (BOI18_dna)	C++17	0 / 100	22 ms	5212 KB

dna

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lld long double
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(a) a.begin(),a.end()
#define IShowSpeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int N=2e5+10;
const int K=200;
const int mod=1e9+7;
const ll inf=1e18+228;
const int dx[]={-1,0,0,1};
const int dy[]={0,-1,1,0};
ll h[N],cnt[N],n,k,r,lol=0,ans=inf;
deque<ll>v;

int main()
{
	IShowSpeed
	cin>>n>>k>>r;
	for(int i=1;i<=n;i++) cin>>h[i],cnt[i]=-inf;
	for(int i=1;i<=r;i++)
	{
		ll x,y;
		cin>>x>>y;
		if(cnt[x]==-inf) cnt[x]=y;
		else cnt[x]+=y;
	}

	for(int i=1;i<=n;i++)
	{
		if(cnt[h[i]]==-inf) continue;
		v.pb(i);
		cnt[h[i]]--;
		if(cnt[h[i]]==0) lol++;
		while(cnt[h[v.front()]]<0)
		{
			cnt[h[v.front()]]++;
			v.pop_front();
		}
		if(lol==r) ans=min(v.back()-v.front()+1,ans);
	}
	if(ans==inf) cout<<"Impossible";
	else cout<<ans;
}

Subtask #1

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Incorrect	1 ms	2396 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #2

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Incorrect	1 ms	2648 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	4188 KB	Output is correct
2	Correct	10 ms	3808 KB	Output is correct
3	Correct	10 ms	3420 KB	Output is correct
4	Correct	11 ms	3932 KB	Output is correct
5	Correct	12 ms	3468 KB	Output is correct
6	Correct	10 ms	5212 KB	Output is correct
7	Incorrect	9 ms	3676 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	4092 KB	Output is correct
2	Correct	18 ms	3932 KB	Output is correct
3	Correct	15 ms	3676 KB	Output is correct
4	Correct	10 ms	3420 KB	Output is correct
5	Incorrect	22 ms	4700 KB	Output isn't correct
6	Halted	0 ms	0 KB	-