Submission #1967301

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<functional>
#include<stack>
#include<queue>
#include <iomanip>
#include<map>
#include<limits>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<deque>
#include<utility>
#include<complex>
#include<cstdlib>
#include<set>
#include<cctype>

using namespace std;

#define DBG cerr << '!' << endl;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define rep(i,s,g) for(ll (i) = (s);(i) < (g);++i)
#define rrep(i,s,g) for(ll (i) = (s);i >= (g);--(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int W = 0;W < (n);W++)cerr << v[W] << ' ';cerr << endl << endl;}
#define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(10)

typedef long long ll;
typedef vector<int> iv;
typedef vector<iv> iiv;
typedef vector<string> sv;

int mp[440000];
int num[220000];

int main()
{
	int *dp = mp + 220000;
	int n,m;cin >> n >> m;
	vector<int> v(n);
	REP(i,n)
	{
		cin >> v[i];v[i]--;
		dp[v[i]-num[v[i]]]++;
		num[v[i]]++;
	}

	int ret = 0;
	for(int i = 0; i < n;i++)
	{
		if(dp[i] == 0)ret++;
	}
	
	REP(i,m)
	{
		int a,b;cin >> a >> b;a--;b--;
		num[v[a]]--;
		dp[v[a]-num[v[a]]]--;
		if(v[a]-num[v[a]] >= 0&&dp[v[a]-num[v[a]]] == 0)ret++;
		v[a] = b;
		dp[v[a]-num[v[a]]]++;
		if(v[a]-num[v[a]] >= 0&&dp[v[a]-num[v[a]]] == 1)ret--;
		num[v[a]]++;
		cout << ret << endl;
//		SHOW1d(v,n);
//		SHOW1d(dp,n);
	}
	
	return 0;
}

Submission Info

Judge Result