Football kit

input
standard input
output
standard output

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 xiyi (1 ≤ xi, yi ≤ 105xi ≠ 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 test(s)
input
2
1 2
2 1
output
2 0
2 0
input
3
1 2
2 1
1 3
output
3 1
4 0
2 2


#include <iostream>

#include <stdio.h>
#include <string.h>


using namespace std;
#define maxn 100000 + 10


struct node
{
    int x,y;


}team[maxn];


int num1[maxn];
int num2[maxn];
int hos[maxn];




int main()
{
    int n,i,j;
    memset(num1,0,sizeof(num1));
    memset(num1,0,sizeof(num2));
    memset(ges,0,sizeof(ges));
    memset(hos,0,sizeof(hos));


    scanf("%d",&n);
    for( i = 0; i<n; i++)
     {
         scanf("%d%d",&team[i].x, &team[i].y);
         hos[team[i].x]++;
     }
    for(  i = 0; i<n; i++)
    {
        num1[i] += n - 1 + hos[team[i].y];
        num2[i] += n - 1 - hos[team[i].y];
        printf("%d %d\n",num1[i], num2[i]);
    }


}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值