题意翻译

CF864A Fair Game

题意: Petya和Vasya决定玩一个游戏,他们有偶数张卡片,每张卡片上一个数字.每人选择一个数字(两个人选择的数字不能相同),选择了该数字就意味着需要把写有这个数字的所有卡片都拿走.Petya和Vasya认为,这个游戏是公平的,当仅当两个人可以拿走全部的卡片并且两人拿走的卡片数相同,否则这个游戏就是不公平的.

读入: 第一行:卡片数量n(2<=n<=100),接下来n行每行一个数字表示第i张卡片上的数字

输出: 第一行表示游戏是否公平,公平输出YES,不公平输出NO;若游戏公平,第二行输出两个数字表示Petya和Vasya分别选择的数字

Translated by 凌幽

题目描述

Petya and Vasya decided to play a game. They have nn cards ( nn is an even number). A single integer is written on each card.

Before the game Petya will choose an integer and after that Vasya will choose another integer (different from the number that Petya chose). During the game each player takes all the cards with number he chose. For example, if Petya chose number 55 before the game he will take all cards on which 55 is written and if Vasya chose number 1010before the game he will take all cards on which 1010 is written.

The game is considered fair if Petya and Vasya can take all nn cards, and the number of cards each player gets is the same.

Determine whether Petya and Vasya can choose integer numbers before the game so that the game is fair.

输入输出格式

输入格式:

The first line contains a single integer nn ( 2<=n<=1002<=n<=100 ) — number of cards. It is guaranteed that nn is an even number.

The following nn lines contain a sequence of integers a_{1},a_{2},...,a_{n}a1​,a2​,...,an​ (one integer per line, 1<=a_{i}<=1001<=ai​<=100 ) — numbers written on the nn cards.

输出格式:

If it is impossible for Petya and Vasya to choose numbers in such a way that the game will be fair, print "NO" (without quotes) in the first line. In this case you should not print anything more.

In the other case print "YES" (without quotes) in the first line. In the second line print two distinct integers — number that Petya should choose and the number that Vasya should choose to make the game fair. If there are several solutions, print any of them.

输入输出样例

输入样例#1: 复制

4
11
27
27
11
输出样例#1: 复制

YES
11 27
输入样例#2: 复制

2
6
6
输出样例#2: 复制

NO
输入样例#3: 复制

6
10
20
30
20
10
20
输出样例#3: 复制

NO
输入样例#4: 复制

6
1
1
2
2
3
3
输出样例#4: 复制

NO

说明

In the first example the game will be fair if, for example, Petya chooses number 1111 , and Vasya chooses number 2727. Then the will take all cards — Petya will take cards 11 and 44 , and Vasya will take cards 22 and 33 . Thus, each of them will take exactly two cards.

In the second example fair game is impossible because the numbers written on the cards are equal, but the numbers that Petya and Vasya should choose should be distinct.

In the third example it is impossible to take all cards. Petya and Vasya can take at most five cards — for example, Petya can choose number 1010 and Vasya can choose number 2020 . But for the game to be fair it is necessary to take 66 cards.

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define MAXN 101
using namespace std;
int n,sum,ans;
int num[MAXN],vis[MAXN];
int main(){
scanf("%d",&n);
for(int i=;i<=n;i++){
scanf("%d",&num[i]);
vis[num[i]]++;
}
for(int i=;i<=;i++){
if(vis[i]){
sum++;
if(ans!=&&vis[i]!=ans){ cout<<"NO";return ; }
ans=vis[i];
if(sum>){ cout<<"NO";return ; }
}
}
if(sum!=){ cout<<"NO";return ; }
cout<<"YES"<<endl;
for(int i=;i<=;i++)
if(vis[i]) cout<<i<<" ";
}

CF864A Fair Game的更多相关文章

  1. LA 3231 - Fair Share

    You are given N processors and M jobs to be processed. Two processors are specified to each job. To ...

  2. Codeforces CF#628 Education 8 F. Bear and Fair Set

    F. Bear and Fair Set time limit per test 2 seconds memory limit per test 256 megabytes input standar ...

  3. java线程 公平锁 ReentrantLock(boolean fair)

    一.公平锁 1.为什么有公平锁 CPU在调度线程的时候是在等待队列里随机挑选一个线程,由于这种随机性所以是无法保证线程先到先得的(synchronized控制的锁就是这种非公平锁).但这样就会产生饥饿 ...

  4. Fair Scheduler 队列设置经验总结

    Fair Scheduler 队列设置经验总结 由于公司的hadoop集群的计算资源不是很充足,需要开启yarn资源队列的资源抢占.在使用过程中,才明白资源抢占的一些特点.在这里总结一下. 只有一个队 ...

  5. Fair Scheduler中的Delay Schedule分析

    延迟调度的主要目的是提高数据本地性(data locality),减少数据在网络中的传输.对于那些输入数据不在本地的MapTask,调度器将会延迟调度他们,而把slot分配给那些具备本地性的MapTa ...

  6. Hadoop学习之--Fair Scheduler作业调度分析

    Fair Scheduler调度器同步心跳分配任务的过程简单来讲会经历以下环节: 1. 对map/reduce是否已经达到资源上限的循环判断 2. 对pool队列根据Fair算法排序 3.然后循环po ...

  7. BZOJ3540: [Usaco2014 Open]Fair Photography

    3540: [Usaco2014 Open]Fair Photography Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 72  Solved: 29 ...

  8. What does it mean for an algorithm to be fair

    What does it mean for an algorithm to be fair In 2014 the White House commissioned a 90-day study th ...

  9. bzoj1664 [Usaco2006 Open]County Fair Events 参加节日庆祝

    Description Farmer John has returned to the County Fair so he can attend the special events (concert ...

随机推荐

  1. 《从零開始学Swift》学习笔记(Day48)——类型检查与转换

    原创文章,欢迎转载.转载请注明:关东升的博客 继承会发生在子类和父类之间,是一系列类的继承关系. 比如:Person是类层次结构中的根类.Student是Person的直接子类.Worker是Pers ...

  2. 架构-Eureka:第一个方法

    ylbtech-架构-Eureka:第一个方法 工程介绍 Spring Cloud 工程目录 model registry-center Servers tzxyfx tzxyfx-provider ...

  3. HIT Software Construction Lab6引发出来对锁的问题的探究

    前言 做完lab5开始做lab6了鸭,哈工大计算机学院的学生永不停歇.在做lab6的时候,我在想移动猴子是锁一整个ladder(ADT)还是只锁一个ladder的一个域Monkey数组呢?这两个好像差 ...

  4. .net几种文件下载的方法

    .Net文件下载方式.... 之前在写上传文件.下载文件的时候,发现Response对象里面有好几种下载文件的方式,之后自己亲自实践了这几种方法,记录下以便以后复习... WriteFile文件下载 ...

  5. Super超级ERP系统---(8)订单管理--订单创建

    订单管理是ERP系统中一个重要模块,客户下订单,ERP通过订单来为客户进行配送.订单模块主要包括订单创建,订单修改,订单审核,订单取消,订单分配,订单打印,订单拣货,订单出库.在随后的几节里我们看看这 ...

  6. jquery自动完成插件的使用

    .ui-autocomplete { z-index: !important; max-height: 100px; overflow-y: auto; /* 防止水平滚动条 */ overflow- ...

  7. SVG剪裁路径和遮罩jQuery幻灯片

    SVG剪裁路径和遮罩jQuery幻灯片是一款基于SVG clipPath和mask遮罩元素实现的网站动画幻灯片代码特效. 在线演示本地下载

  8. 学习环境搭建2——安装django

    下载django https://www.djangoproject.com/download/ 选择最新的版本Latest release,下载后解压.在含有setup.py的文件夹中执行如下命令: ...

  9. javascript中对象属性搜索原则

    为什么通过对象就能访问到原型中的属性或者方法? 属性搜索原则: 1 首先会在对象本身查找有没有该属性,如果有直接返回 2 如果没有,此时就会在构造函数中查找通过this给对象添加的成员中有没有,如果有 ...

  10. iphone通讯录的备份与恢复

    最近在做iOS系统通讯录备份到服务器,并且可以从服务器中下载备份文件恢复到手机的功能,部分实现细节记录如下. 将iphone系统通讯录生成.vcf文件 ABAddressBookRef address ...