Codeforces Round #246 (Div. 2):B. Football Kit
2014-07-07 07:55
435 查看
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
output
input
output
两个for循环肯定超时,注意优化。。
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
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
两个for循环肯定超时,注意优化。。
#include<cstdio> #include<algorithm> #include<iostream> #include<cstring> using namespace std; #define M 100005 int x[M]; int y[M]; int a[M]; int b[M]; int main() { int n, i; while(~scanf("%d", &n)) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(i=0;i<n;i++) { scanf("%d%d",&x[i],&y[i]); a[x[i]]++;b[y[i]]++; } for(i=0;i<n;i++) { printf("%d %d\n",((n-1)+a[y[i]]),((n-1)-a[y[i]])); } } return 0; }
相关文章推荐
- Codeforces Round #246 (Div. 2) B. Football Kit
- Codeforces Round #246 (Div. 2) B. Football Kit
- Codeforces Round #246 (Div. 2) - B. Football Kit
- Codeforces #246 (Div. 2) B. Football Kit
- Codeforces Round #246 (Div. 2) B. Football Kit
- 如何设置一个指定高度的DIV
- JS遍历DIV里的东西
- Div的宽度与高度设定100%
- codeforces#232_div2_D On Sum of Fractions
- div css 基础
- Codeforces Round #312 (Div. 2)-A. Lala Land and Apple Trees-水题-模拟
- Codeforces Round #349 (Div. 2) D. World Tour 暴力最短路
- Codeforces Round #377 (Div. 2)
- Codeforces Round #435 (Div. 2) 题解
- css+div布局总结--新手入门
- 一个比较完美的spacerdiv技巧
- TOPCODER->Practice Room->SRAM 144 DIV 1 (550)
- div 中img 有间隙问题的解决,line-height=0 line-height 等于0
- 【CSS】div父容器根据子容器大小自适应
- codeforces 311(div2)C-Arthur and Table