[构造] Codeforces 736E #382 (Div. 1) E. Chess Championship
来源:互联网 发布:ep订票软件 编辑:程序博客网 时间:2024/06/09 16:18
有m个人参加比赛,每两个人都恰好比了一场
两个人比赛如果一方赢了,那么得到2分,平局得到1分,输了得到0分。
告诉你排行榜前n个人的得分,构造比赛满足条件
n<=m<=3000充要条件就是分数按从小到大排,前i小的分数总和不小于i(i-1),m个人的分数总和为m(m-1)
构造的时候是选择分数最高的人,让他在分数高的人比赛中失败,低的人比赛中获胜我们只知道前m个人的分数,从上面的条件观察后面的人分数越高越好,所以剩下的分数均匀分配
#include<cstdio>#include<cstdlib>#include<algorithm>#include<functional>using namespace std;typedef pair<int,int> abcd;const int N=3005;int n,m;abcd a[N];char d[N][N];#define read(x) scanf("%d",&(x))int main(){ freopen("t.in","r",stdin); freopen("t.out","w",stdout); read(m); read(n); int t=0,minv=1<<30; for (int i=m-n+1;i<=m;i++) read(a[i].first),a[i].second=i,t+=a[i].first,minv=min(minv,a[i].first); if (t>m*(m-1)) return printf("no\n"),0; t=m*(m-1)-t; for (int i=1;i<=m-n;i++) a[i]=abcd(t/(m-n)+(i<=t%(m-n)),i); if (m-n && a[1].first>minv) return printf("no\n"),0; sort(a+1,a+m+1); t=0; for (int i=1;i<=m;i++){ t+=a[i].first; if (t<i*(i-1)) return printf("no\n"),0; } for (int i=1;i<=m;i++) d[i][i]='X'; for (int i=m;i;i--){ sort(a+1,a+i+1); int t=a[i].first; for (int j=1;j<i;j++){ if (t>1) t-=2,d[a[i].second][a[j].second]='W',d[a[j].second][a[i].second]='L'; else if (t==1) t--,a[j].first--,d[a[i].second][a[j].second]=d[a[j].second][a[i].second]='D'; else a[j].first-=2,d[a[i].second][a[j].second]='L',d[a[j].second][a[i].second]='W'; } } printf("yes\n"); for (int i=1;i<=m;i++) printf("%s\n",d[i]+1); return 0;}
0 0
- [构造] Codeforces 736E #382 (Div. 1) E. Chess Championship
- Codeforces Round #313(div.2) E. Gerald and Giant Chess
- Codeforces Round #382 (Div. 1) 736A Tennis Championship
- [构造] Codeforces 804E Round #411 (Div. 1) E. The same permutation
- Codeforces #276 div.1 E
- Codeforces #284 (Div.1 A~E & Div.2 A~E)
- CodeForces 417E (构造)
- codeforces 508E (构造)
- Codeforces Problemset 30E(#30 div.1 E)
- Codeforces Problemset 10E(#10 div.1 E)
- Codeforces Problemset 198E(#125 div.1 E)
- Codeforces Round #257 (Div. 2)E(数论+构造)
- Codeforces Round #249 (Div. 2)E(构造)
- Codeforces Round #306 (Div. 2) E - Brackets in Implications 构造
- Codeforces Round #394 (Div. 2) E. Dasha and Puzzle(构造)
- Codeforces Round #306 (Div. 2) E. Brackets in Implications (构造)
- Codeforces 560E Gerald and Giant Chess
- Codeforces Round #382 (Div. 1) A. Tennis Championship
- Unable to find the ncurses libraries的解决办法
- 基于Java语言的安卓编程学习之文件读写(上)
- Kubernetes volumes简介
- mac 安装elasticsearch
- Oracle1
- [构造] Codeforces 736E #382 (Div. 1) E. Chess Championship
- 书单
- [可图性判定 Havel-Hakimi定理 构造] Codeforces Gym 100269 NEERC 13 Northern K. Kids in a Friendly Class
- leedcode一刷--Binary Tree
- [构造 八数码] Codeforces 472E #270 E. Design Tutorial: Learn from a Game
- [最小割 构造] TCO16 Semi 1 MinimumCutsAgain
- Android--SharedPreferences的存储和获取数据--案例《登录》
- vim常用命令
- 关于mybatis的动态if语句查询报错问题和解决方法