704A - Thor - CodeForces Solution


brute force data structures implementation *1600

Please click on ads to support us..

C++ Code:

#include<cstdio>
int h,t,z,x,Q,r,q[300001],c[300001],Rc[300001];
int main()
{
	for(scanf("%d%d",&x,&Q);Q--;printf("%d\n",r))
	{
		scanf("%d%d",&z,&x);
		if(z==1)++r,q[++t]=x,++c[x],++Rc[x];else
		if(z==2)r-=Rc[x],Rc[x]=0;else
		for(;h<x;)if(--c[z=q[++h]],Rc[z]>c[z])--r,--Rc[z];
	}
}


Comments

Submit
0 Comments
More Questions

479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets
96A - Football
702B - Powers of Two
1036A - Function Height
443A - Anton and Letters
1478B - Nezzar and Lucky Number
228A - Is your horseshoe on the other hoof
122A - Lucky Division
1611C - Polycarp Recovers the Permutation
432A - Choosing Teams
758A - Holiday Of Equality
1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD
149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game