> 웹 프론트엔드 > HTML 튜토리얼 > Codeforces Round #246 (Div. 2) ?B. Football Kit_html/css_WEB-ITnose

Codeforces Round #246 (Div. 2) ?B. Football Kit_html/css_WEB-ITnose

WBOY
풀어 주다: 2016-06-24 12:04:34
원래의
1123명이 탐색했습니다.

B. Football Kit

time limit per test

1 second

memory limit per test

256 megabytes

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 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 test(s)

input

21 22 1
로그인 후 복사

output

2 02 0
로그인 후 복사

input

31 22 11 3
로그인 후 복사

output

3 14 02 2
로그인 후 복사


打印当前队 穿主场衣服作战的次数 和  穿客场衣服作战的次数


简单的哈希思想+规律  即可AC,只是 题意不是很好理解


规律是 n个队  没有个队会进行 n-1次 比赛  主场服使用次数 + 客场服使用次数  = 2*(n-1)

主场服使用次数  =  n-1 + 当前队客场服与其他队 主场服相同的次数

#include <stdio.h>#include <stdlib.h>#include <string.h>int a[100010];int b[100010],c[100010];int main(){    int n,i;    scanf("%d",&n);    memset(a,0,sizeof(a));    for(i = 0; i<n i scanf a for printf return>           <br>           <br>                                                       </n></string.h></stdlib.h></stdio.h>
로그인 후 복사
관련 라벨:
원천:php.cn
본 웹사이트의 성명
본 글의 내용은 네티즌들의 자발적인 기여로 작성되었으며, 저작권은 원저작자에게 있습니다. 본 사이트는 이에 상응하는 법적 책임을 지지 않습니다. 표절이나 침해가 의심되는 콘텐츠를 발견한 경우 admin@php.cn으로 문의하세요.
인기 튜토리얼
더>
최신 다운로드
더>
웹 효과
웹사이트 소스 코드
웹사이트 자료
프론트엔드 템플릿