Codeforces Round #246 (Div. 2) B. Football Kit
来源:互联网 发布:富远软件 编辑:程序博客网 时间:2024/05/17 21:44
点击打开题目链接
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.
The first line contains a single integer n (2 ≤ n ≤ 105) — the number of teams. Next n lines contain the description of the teams. Thei-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 thei-th team.
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.
21 22 1
2 02 0
31 22 11 3
3 14 02 2
大致是:每个队伍可以参加主场比赛(n-1)场和客场比赛(n-1)场,
每个队伍打主场比赛的时候穿主场衣服,打客场比赛的时候穿客场衣服,
但是当客场衣服与主场衣服相同的时候,客场穿主场衣服,
求每个队的(穿主场衣服的次数)和(穿客场衣服的次数)
所以 主场衣服次数=(n-1)+客场衣服与其他主场衣服相同的次数
客场衣服次数=2*(n-1)-主场衣服次数
=(n-1)-客场衣服与其他主场衣服相同的次数
代码:
#include<iostream>#include<algorithm>#include<queue>#include<stack>#include<cmath>#include<string.h>#include<stdio.h>#include<stdlib.h>using namespace std;int x[100005],y[100005];int a[100005];int main(){ int n,i,j,k; while(~scanf("%d",&n)) { memset(a,0,sizeof(a)); for(i=0;i<n;i++) { scanf("%d%d",&x[i],&y[i]); a[x[i]]++; } for(i=0;i<n;i++) { int m=n-1+a[y[i]]; int t=n-1-a[y[i]]; printf("%d %d\n",m,t); } } 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 Round #246 (Div. 2):B. Football Kit
- Codeforces #246 (Div. 2) B. Football Kit
- Codeforces 432B Football Kit
- Codeforces 432 B. Football Kit
- codeforces-432B Football Kit
- CF 246 B. Football Kit
- Codeforces 432B Football Kit(水题)
- Codeforces Round #281 (Div. 2) A. Vasya and Football
- Codeforces Round #281 (Div. 2) A - Vasya and Football
- B. Football Kit
- Codeforces Round #246 (Div. 2) A,B,C,D
- Codeforces Round #246 (Div. 2)(B)数学
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #134 (Div. 2)B. Airport
- Codeforces Round #170 (Div. 2) problem B
- Service的简单用法
- 当一个线程进入一个对象的一个 synchronized 方法后,其它线程是否可 进入此对象的其它方法?
- 莽撞的女孩
- 二分查找算法
- Scripts:查看数据文件使用率的脚本(包括临时表空间的文件哦)dba_file_space_usage.sql
- Codeforces Round #246 (Div. 2) B. Football Kit
- UNetbootin与Win To go,摆脱光驱束缚U盘安装Linux与Windows系统!
- 手机wifi族,低头倒也乐着
- 操作 Cookie 的Java工具类
- Android应用程序完全退出
- php 去除 BOM头
- Win8被封杀,国产系统准备好了吗
- win7下在移动硬盘上面安装ubuntu
- 对Linux内核中进程上下文和中断上下文的理解