Codeforces Round #246 (Div. 2) - B. Football Kit
2014-05-16 22:27
155 查看
水题。不过在做的时候超时了两次,第一次写了个双重for
for (i = 0; i < ....)
for (j = 0; ....)
超时后我就改成了
for (i = 0; i < ....)
for (j = i +1; ....)
。。。。。。。对自己无语了
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
//freopen("input.txt", "r", stdin);
int team[110000];
int home[110000];
int n, i, j, a, b;
while (~scanf("%d", &n))
{
memset(team, 0, sizeof(team));
memset(home, 0, sizeof(home));
int temp = (n - 1) * 2;
for (i = 0; i < n; i++)
{
scanf("%d%d", &a, &b);
home[a]++;
team[i] = b;
}
for (i = 0; i < n; i++)
printf("%d %d\n", n - 1 + home[team[i]], temp - (n - 1 + home[team[i]]));
}
return 0;
}
for (i = 0; i < ....)
for (j = 0; ....)
超时后我就改成了
for (i = 0; i < ....)
for (j = i +1; ....)
。。。。。。。对自己无语了
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
//freopen("input.txt", "r", stdin);
int team[110000];
int home[110000];
int n, i, j, a, b;
while (~scanf("%d", &n))
{
memset(team, 0, sizeof(team));
memset(home, 0, sizeof(home));
int temp = (n - 1) * 2;
for (i = 0; i < n; i++)
{
scanf("%d%d", &a, &b);
home[a]++;
team[i] = b;
}
for (i = 0; i < n; i++)
printf("%d %d\n", n - 1 + home[team[i]], temp - (n - 1 + home[team[i]]));
}
return 0;
}
相关文章推荐
- Codeforces Round #246 (Div. 2) B. Football Kit
- Codeforces #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
- js下获取div中的数据的原理分析
- Codeforces Beta Round #6 (Div. 2 Only)
- SRM 598 DIV1
- Codeforces Round #273 (Div. 2)
- 未知宽高图片水平垂直居中在div
- cf#8VC Venture Cup 2016 - Final Round (Div. 2 Edition) -A. Orchestra暴力水题
- DIV+CSS中标签ul ol li dl dt dd用法
- 仿jquery ui progressbar,div自动转进度条
- Codeforces Round #436 (Div. 2) F. Cities Excursions 路径上的第k个点(倍增)
- web 中 div层 隐藏dropdownlist
- Codeforces Beta Round #46 (Div. 2) E. Common ancestor
- DIV+CSS如何让文字垂直居中?
- Codeforces Round #273 (Div. 2)D dp
- Codeforces Round #307 (Div. 2) C. GukiZ hates Boxes (二分)
- Codeforces Beta Round #4 (Div. 2 Only) D. Mysterious Present 记忆化搜索