Codeforces Round #614 (Div. 2) C. NEKO's Maze Game(小思维模拟)

C. NEKO’s Maze Game

#include <cstdio>
#define Maxn 100005
int n,q;
int r[Maxn],c[Maxn];
bool mp[2][Maxn];
int main(){
	scanf("%d%d",&n,&q);
	int num=0;
	for(int i=1;i<=q;i++){
		scanf("%d%d",&r[i],&c[i]);
		r[i]--;
		if(mp[r[i]][c[i]]==0){
			if(mp[r[i]^1][c[i]-1]){
				num++;
			}
			if(mp[r[i]^1][c[i]]){
				num++;
			}
			if(mp[r[i]^1][c[i]+1]){
				num++;
			}
			mp[r[i]][c[i]]=1;
		}
		else{
			if(mp[r[i]^1][c[i]-1]){
				num--;
			}
			if(mp[r[i]^1][c[i]]){
				num--;
			}
			if(mp[r[i]^1][c[i]+1]){
				num--;
			}
			mp[r[i]][c[i]]=0;
		}
		if(num>0){
			puts("No");
		}
		else{
			puts("Yes");
		}
	}
	return 0;
}