CF-839B
B. Game of the Rowstime limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Daenerys Targaryen has an army consisting of k groups of soldiers, the i-th group contains ai soldiers. She wants to bring her army to the other side of the sea to get the Iron Throne. She has recently bought an airplane to carry her army through the sea. The airplane has nrows, each of them has 8 seats. We call two seats neighbor, if they are in the same row and in seats {1, 2}, {3, 4}, {4, 5}, {5, 6} or {7, 8}.
A row in the airplane
Daenerys Targaryen wants to place her army in the plane so that there are no two soldiers from different groups sitting on neighboring seats.
Your task is to determine if there is a possible arranging of her army in the airplane such that the condition above is satisfied.
InputThe first line contains two integers n and k (1 ≤ n ≤ 10000, 1 ≤ k ≤ 100) — the number of rows and the number of groups of soldiers, respectively.
The second line contains k integers a1, a2, a3, ..., ak (1 ≤ ai ≤ 10000), where ai denotes the number of soldiers in the i-th group.
It is guaranteed that a1 + a2 + ... + ak ≤ 8·n.
OutputIf we can place the soldiers in the airplane print "YES" (without quotes). Otherwise print "NO" (without quotes).
You can choose the case (lower or upper) for each letter arbitrary.
Examplesinput2 2
5 8outputYESinput1 2
7 1outputNOinput1 2
4 4outputYESinput1 4
2 2 1 2outputYESNoteIn the first sample, Daenerys can place the soldiers like in the figure below:
In the second sample, there is no way to place the soldiers in the plane since the second group soldier will always have a seat neighboring to someone from the first group.
In the third example Daenerys can place the first group on seats (1, 2, 7, 8), and the second group an all the remaining seats.
In the fourth example she can place the first two groups on seats (1, 2) and (7, 8), the third group on seats (3), and the fourth group on seats (5, 6).
题意:
有n排座位,有k组 每组有a[i]人,问能否使不同组的人都不相邻。
先将a[i]分为4 2 1,先放4的部分,再2,再1。
AC代码:
#include<bits/stdc++.h>
using namespace std; int a[]; int main(){
ios::sync_with_stdio(false);
int n,k;
cin>>n>>k;
for(int i=;i<k;i++){
cin>>a[i];
}
int sum1=n;
int sum2=n*;
for(int i=;i<k;i++){
int d=min(sum1,a[i]/);
sum1-=d;
a[i]-=d*;
}
sum2+=sum1;
for(int i=;i<k;i++){
int d=min(sum2,a[i]/);
sum2-=d;
a[i]-=d*;
}
int temp=sum1+sum2;
for(int i=;i<k;i++){
temp-=a[i];
}
if(temp>=){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
return ;
}
最新文章
- @synchronized(self)的用法 小结
- 《javascript》高级程序设计——类型转换错误
- mysql分组合并GROUP_CONCAT
- 新建一个UI窗口-XproerUI(MFC)教程
- C语言中运算符的口决
- Ubuntu根目录下各文件夹的功能详细介绍
- Quality Center 使用IE8异常浏览器打开
- Mac OS X Yosemite 10.10 配置 Apache+PHP 教程注意事项
- $.get
- 用代码场景Spine人物
- 于Unity3D动态创建对象和创建Prefab三种方式的原型对象
- Asp.Net MVC5入门学习
- 一步一步学Vue(二)
- Android中使用ContentProvider进行跨进程方法调用
- 【死磕Java并发】----- 死磕 Java 并发精品合集
- Asp.net Core IdentityServer4 入门教程(一):概念解析
- PyCharm导入tensorflow包
- 跨语言调用Hangfire定时作业服务
- C++ 三/五法则
- iOS Code Sign On Copy