题意翻译

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. C++一些知识难点

    什么是"引用"?申明和使用"引用"要注意哪些问题? 答:引用就是某个目标变量的"别名"(alias).相应用的操作与对变量直接操作效果全然同 ...

  2. 车载导航系统中GPS的定位

    首先购买的车载导航系统有GPS信号接受功能,能够接收GPS的经纬度信号,然后导航终端里面安装的导航地图能够非常详细的显示详细的经纬度坐标和地物信息.导航终端通过接收器接收到卫星24小时不间断发射的免费 ...

  3. React-Native Android开发沉思录

    在runServer.js中有声明如何启动http服务: 查看端口占用情况 而且在系统管理器中,根本找不到PID为7956的应用,那能更改端口吗?在server.js中有声明: module.expo ...

  4. [TB-Technology] 淘宝在数据处理领域的项目及开源产品介绍

    淘宝在数据存储和处理领域在国内互联网公司中一直保持比较靠前的位置,而且由于电子商务领域独特的应用场景,淘宝在数据实时性和大规模计算及挖掘方面一直在国内保持着领先,因此积累了很多的实践的经验和产品. T ...

  5. [Hacker] 端口大全

    一 .端口大全 端口:0 服务:Reserved 说明:通常用于分析操作系统.这一方法能够工作是因为在一些系统中“0”是无效端口,当你试图使用通常的闭合端口连接它时将产生不同的结果.一种典型的扫描,使 ...

  6. POJ 2492 A Bug's Life 带权并查集

    题意: 思路: mod2 意义下的带权并查集 如果两只虫子是异性恋,它们的距离应该是1. 如果两只虫子相恋且距离为零,则它们是同性恋. (出题人好猥琐啊) 注意: 不能输入一半就break出来.... ...

  7. Core篇——初探IdentityServer4(客户端模式,密码模式)

    Core篇——初探IdentityServer4(客户端模式,密码模式) 目录 1.Oatuth2协议的客户端模式介绍2.IdentityServer4客户端模式实现3.Oatuth2协议的密码模式介 ...

  8. CI中的超级对象

    CI中的超级对象就是当前控制器对象,它提供了很多属性,可以通过var_dump($this)打印所有的超级对象: load可以理解为一个加载器,加载了很多功能,可以理解为当你使用 $this -> ...

  9. 在AndroidManifest(清单文件)中注册activity(活动)及配置主活动、更改App图标、App名称、修改隐藏标题栏

    打开app/src/main/AndroidManifest. <?xml version="1.0" encoding="utf-8"?> < ...

  10. 【Oracle】创建用户

    任务: 1)创建用户siebel,密码oracle 2)授予sse_role,tblo_role角色 3)siebel用户没有对system,sysaux的使用权限 4)默认表空间ts_users,无 ...