Zero Array Gym - 101853A

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接： https://blog.csdn.net/weixin_39132605/article/details/100540807

 https://cn.vjudge.net/problem/Gym-101853A

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------

const int maxn=1e6+9;
const int mod=1e9+7;

int a[maxn];
map<int,int>mp;
int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);


    int T;
    //sfi(T);
    cin>>T;
    while(T--)
    {
        int ans=0;
        mp.clear();
        int n,q;
        cin>>n>>q;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            if(mp[a[i]]==0&&a[i]) ans++;
            mp[a[i]]++;
        }

        while(q--)
        {
            int op,x,id;
            cin>>op;
            if(op==1)
            {
                cin>>id>>x;

                mp[a[id]]--;
                if(mp[a[id]]==0&&a[id]) ans--;
                if(mp[x]==0&&x) ans++;
                mp[x]++;
                a[id]=x;
            }
            else cout<<ans<<endl;
        }
    }


    return 0;
}