Codeforces Round #366 (Div. 1) 题解 (待补)

最新推荐文章于 2022-12-19 16:26:42 发布

nike0good

最新推荐文章于 2022-12-19 16:26:42 发布

阅读量418

点赞数

分类专栏：比赛题解

本文链接：https://blog.csdn.net/nike0good/article/details/52274675

版权

比赛题解专栏收录该内容

115 篇文章 0 订阅

订阅专栏

Thor
Ant Man

Thor

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (1000000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %I64d\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
int n,q;
#define MAXN (300000+10)
int l[MAXN],r[MAXN];
vi a[MAXN];
int b[MAXN]={0};
int main()
{
//  freopen("A.in","r",stdin);
//  freopen(".out","w",stdout);
    n=read(),q=read();
    MEM(a) MEM(l) MEM(r)
    int siz=1,ans=0; l[1]=0; r[0]=1;
    int idx=1; 
    For(i,q) {
        int p=read(),c=read();
        if (p==1) {
            siz++; b[siz-1]=1;
            a[c].pb(siz-1); ++ans;
        } else if (p==2) {
            int sz=a[c].size();
            Rep(j,sz) {
                int p=a[c][j];
                if (!b[p]) continue;
                b[p]=0;
                --ans;
            }
            a[c].clear();
        } else {
            Fork(j,idx,c) {
                if (b[j]) {
                    b[j]=0; ans--;
                }
            }
            idx=max(idx,c);
        }
        cout<<ans<<endl;
    }

    return 0;
}