Submission #69877910

---

Source Code Expand

/* Code By WCM */
/*
Date:
大致思路：
复杂度：
期望得分：
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <vector>
#include <queue>

using namespace std;

inline int read();
void write(int);
void writeln(int);

int n, q, a[2000005], x, y, sum;

int main() {

//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	
	n = read(), q = read();
	int mi = 0;
	for(int i = 1; i <= n; i++) a[i] = 1;
	while(q--) {
		sum = 0;
		x = read(), y = read();
		for(int i = mi; i <= x; i++) sum += a[i], a[i] = 0;
		printf("%d\n", sum);
		a[y] += sum, mi = max(mi, x + 1);
	}
	
//	printf("\nThe time used: ");
//	printf("%.2lfs",(double)clock()/CLOCKS_PER_SEC);

	return 0;

}

inline int read() {
	int res = 0, f = 1;
	char ch = getchar();
	while( !(ch >= '0' && ch <= '9') ) {
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		res = (res << 1) + (res << 3) + (ch ^ 48);
		ch = getchar();
	}
	return res * f;
}

void write(int x) {
	static int sta[35];
	int top = 0;
	do {
		sta[top++] = x % 10;
		x /= 10;
	} while(x);
	while(top) putchar(sta[--top] ^ 48);
}

void writeln(int x) {
	write(x);
	putchar('\n');
}

Submission Info

Judge Result