Description
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit for away games of this team has color yi(xi ≠ yi).
In the tournament, each team plays exactly one home game and exactly one away game with each other team (n(n - 1) games in total). The team, that plays the home game, traditionally plays in its home kit. The team that plays an away game plays in its away kit. However, if two teams has the kits of the same color, they cannot be distinguished. In this case the away team plays in its home kit.
Calculate how many games in the described tournament each team plays in its home kit and how many games it plays in its away kit.
Input
The first line contains a single integer n(2 ≤ n ≤ 105) — the number of teams. Next n lines contain the description of the teams. The i-th line contains two space-separated numbers xi, yi(1 ≤ xi, yi ≤ 105; xi ≠ yi) — the color numbers for the home and away kits of the i-th team.
Output
For each team, print on a single line two space-separated integers — the number of games this team is going to play in home and away kits, correspondingly. Print the answers for the teams in the order they appeared in the input.
Sample Input
2
1 2
2 1
2 0
2 0
3
1 2
2 1
1 3
3 1
4 0
2 2
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #define MAXN 100000+100 using namespace std; int zhu[MAXN]; int ke[MAXN]; int numz[MAXN]; int numk[MAXN]; int main() { int n,i,j,z,k; while(scanf("%d",&n)!=EOF) { memset(zhu,0,sizeof(zhu)); memset(ke,0,sizeof(ke)); for(i=1;i<=n;i++) { scanf("%d%d",&z,&k); zhu[z]++; ke[k]++; numz[i]=z; numk[i]=k; } for(i=1;i<=n;i++) { int zc=n-1+zhu[numk[i]]; int kc=2*(n-1)-zc; printf("%d %d\n",zc,kc); } } return 0; }
CodeForces 432B Football Kit（水）
原文：http://www.cnblogs.com/sola1994/p/4151994.html
