CodeCoder vs TopForces Gym - 101142C

Citizen A thinks that he has a chance to beat citizen B in a programming competitionif there exists
a sequence of Bytelandian citizens A = P0, P1, . . . , Pk = B for some k ≥ 1 such that for each i (0 ≤ i < k), 
Pi has higher rating than Pi+1 at one or both sites.
读题时忽略了第一句的条件。。。
a > b, b > c = a > c 或 higher rating。
这是一个具有传递性的关系，所以若a能打败n个人，b能打败a，那么b也一定能打败这n个人。
根据两个rating建立有向图(由传递性，无需存所有边)。
dfs得到当前节点能击败的点数，用vis数组标记，之后累加即可。
关键点：利用传递性。

#include <set>
#include <map>
#include <ctime>
#include <cmath>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <string>
#include <vector>
#include <cctype>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define SF(a) scanf("%d", &a)
#define PF(a) printf("%d\n", a)  
#define SFF(a, b) scanf("%d%d", &a, &b)  
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 100005
#define maxm 205
#define mod 1000000007
#define INF 10000
using namespace std;
//-------------------------CHC------------------------------//
struct Node {
	int a, b, idx;
}node[maxn];
vector<int> edges[maxn];
bool vis[maxn];
int sum;
int cnt[maxn];

bool cmp1(const Node &l, const Node &r) { return l.a < r.a; }
bool cmp2(const Node &l, const Node &r) { return l.b < r.b; }

void dfs(int u) {
	vis[u] = true;
	sum++;
	FOR(i, 0, edges[u].size()) {
		int v = edges[u][i];
		if (!vis[v]) dfs(v);
	}
}

int main() {
	int n;
	freopen("codecoder.in", "r", stdin);
	freopen("codecoder.out", "w", stdout);
	while (scanf("%d", &n) == 1) {
		FOR(i, 0, n) scanf("%d%d", &node[i].a, &node[i].b), node[i].idx = i;
		FOR(i, 0, n) edges[i].clear();
		sort(node, node + n, cmp1);
		FOR(i, 1, n) edges[node[i].idx].push_back(node[i - 1].idx);
		sort(node, node + n, cmp2);
		FOR(i, 1, n) edges[node[i].idx].push_back(node[i - 1].idx);
		CLEAR(vis, 0);
		sum = 0;
		FOR(i, 0, n) {
			if (!vis[node[i].idx]) dfs(node[i].idx);
			cnt[node[i].idx] = sum - 1;
		}
		FOR(i, 0, n) PF(cnt[i]);
	}
	return 0;
}