Game of the Rows CodeForces - 839B

最新推荐文章于 2021-08-02 16:16:10 发布
最新推荐文章于 2021-08-02 16:16:10 发布
阅读量344 收藏
点赞数
分类专栏： ACM大一 文章标签： codeforces 贪心
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_36556340/article/details/77205078
版权

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 n rows, 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.

Input

The 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 aidenotes the number of soldiers in the i-th group.

It is guaranteed that a1 + a2 + ... + ak ≤ 8·n.

Output

If 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.

Example
Input 
2 2
5 8
Output 
YES
Input 
1 2
7 1
Output 
NO
Input 
1 2
4 4
Output 
YES
Input 
1 4
2 2 1 2
Output 
YES
Note

In 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).


比较坑的一道CF题目，重点是贪心的方法，代码不是很重要；

贪心策略：

1：先安排中间的四个座位，然后剩下的两侧的座位就可以随便坐了。

2：中间的座位先安排一组的人坐一起，就是a[i]>=4的组；

3：a[i]==1的组在中间安排的时候竖着排，到n之后再竖着排。

4：比较坑的是安排中间四个座位的时候a[i]=2的情况，两组横着，一组竖着。

解释不清了，自己理解吧。

用这个题做个纪念，重要的还是自己解得过程。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int a[110];
int main()
{
	int n,k;
	cin >> n >> k;
	int sum = 0;
	int f1 = 1;
	int ok = 1;
	for(int i=1; i<=k; i++)
	{
	   cin >> a[i]; 
	   if(a[i]>=4 && f1)
	   {
	   	 sum += a[i] - a[i]%4;
	   	 if(sum > n*4)
		 {
		   sum -= a[i] - a[i]%4;
		   int w = a[i]/4;
		   for(int k=1; k<=w; k++)
		   {
		      if(sum + 4 > n*4)break;
			  sum += 4; a[i] -= 4; 
		   }
		   f1 = 0; continue;
		 } 
		 a[i] = a[i]%4; 
	   }
    }
    int sum1 = sum;
    int sum2 = sum;
    if(sum == n*4)
    {
       for(int i=1; i<=k; i++)
	  {
	    sum1 += a[i] - a[i]%2; 
		if(a[i]%2==1) sum1 += 2;
	  } 
	  if(sum1 > 8*n) ok = 0;
    }
    else
    {
       int yu = n - sum/4;
	   for(int i=1; i<=k; i++)	
       {
       	  if(yu<=0)break;
       	  if(a[i]==3) {sum2 += 4; a[i]=0; yu--;}
	   }
	   if(yu > 0)
	   {
		 int yi = 0;
		 for(int i=1; i<=k; i++)
	   	 {
	   	   if(a[i]==1) {yi++;}
	     }
	     sum2 += yi*2;
	     int mmp = 0;
	     if(yi >= yu*2)
	     {  
		    yu = 0;
	     	yi -= yu*2;
		 }
	     else if(yi < yu*2)
	     {
	       if(yi<=yu)
	       {
	       	 mmp = yi;
			 yu -= yi; yi = 0;
		   }
		   else if(yi>yu)
		   {
		   	    mmp = yu-yi+yu;
				yu = 0;
		   }
		 }
		 int er = 0;
		 for(int i=1; i<=k; i++)
		 {
		 	if(a[i]==2) ++er;
		 }
		 //cout << er << endl;
		 /*for(int i=1; i<=k; i++)
	     {
	     	if(a[i]!=2)continue;
			if(yu>0)
	     	{
	     		sum2 += 4; yu--;
			}
			else sum2 += 2;
		 }*/
		 if(mmp>=er)
		 {
		 	sum2 += er*2;
		 }
		 else if(mmp < er)
		 {
		 	sum2 += mmp*2;
			 er -= mmp;
			 if(yu > 0)
			 {
		       int pw = er/3*2;
			   if(yu>=pw)
			   {
			   	 sum2 += er/3*8;
			   	 er = 0;
			   }
			   else if(yu<pw)
			   {
			   	  sum2 += yu/2*8;
			   	  er -= yu/2*3;
			   	  yu = yu%2;
			   	  sum2 += yu*4;
			   	  er--;
			   	  sum2 += er*2;
			   } 	
			 }else if(yu==0)
			 {
			 	sum2 += er*2;
			 }
		 }
	   }
	   else if(yu==0) // 四连坐没有了 
	   {
	     	for(int i=1; i<=k; i++)
	     	{
	     		if(a[i]==3){sum2 += 4;continue;}
				 if(a[i]!=0) sum2 += 2;
			}
	   } 
	   if(sum2 > 8*n )ok = 0;
	}
    //cout << sum2 << endl;
	if(!ok) cout << "NO" << endl;
	else cout << "YES\n" << endl;
  return 0;	
}
水波.




白黑菜
关注
专栏目录
Codeforces 839B Game of the Rows 贪心
WA是一笔财富
08-14 292
传送门：Codeforces 839B 题意：有k个小队坐飞机，每个小队有a[i]人，飞机上有n排座位，每排座位有8个，定义同一排中{1, 2}, {3, 4}, {4, 5}, {5, 6} or {7, 8}.   几个座位是相邻的，问能否保证相邻的座位中没有两个不同的队伍的人。 思路：先贪心的使用3、4、5、6四个座位，然后再用两边的，我是用优先队列维护的这一过程，比赛的时候傻X的一
Boboniu Plays Chess CodeForces - 1395B rat1200
qq_45891413的博客
08-18 212
Boboniu likes playing chess with his employees. As we know, no employee can beat the boss in the chess game, so Boboniu has never lost in any round. You are a new applicant for his company. Boboniu will test you with the following chess question: Consider
cf839B Game of the rows
LiRewriter的博客
08-13 505
非常有趣的一道贪心题。考试期间我是毫无思路，然后今天看作者的题解，哇，真玄学。下面我大概就把作者的题解思路说一下，然后誊写一遍作者的代码题意大概是这样的，一帮人选座位，要求不同组的不能坐在一起。每一行的座位构成都是这样的： 那么显然12 34 45 56 78是邻位。现在给你各组的人数，问能不能满足条件。 好，首先为了粉碎一些天真的想法，我们先举几个蛇皮走位： 1行，2个组，每组4个，方法
839B Game of the Rows（水，思维，贪心）
w571523631的博客
08-13 1014
B. Game of the Rows time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Daenerys Targaryen has an army consistin
Codeforces 839B Game of the Rows【贪心】
weixin_33862993的博客
08-13 94
B. Game of the Rows time limit per test：1 second memory limit per test：256 megabytes input：standard input output：standard output Daenerys Targaryen has an army consisting ...
CodeForces 839B Game of the Rows
床前明月光
08-17 255
写的有点丑，，，#include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<set> #include<stack> #include<queue> #include<ctype.h> #include<vector> #include<algorithm> // c
Game of the Rows
MM__1997的博客
11-26 301
http://codeforces.com/problemset/problem/839/B 分析： 这个题写的很费劲    情况分析着就乱了     大体想法是   把人数分为4、2、1      4个的需要空间4     2个和1个的都需要空间2      先把4放在中间四个位置    如果放不开就分成2的放两侧
codeforces-816C(19/600)
NineFailure的博客
06-20 368
C. Karen and Game time limit per test2 seconds memory limit per test512 megabytes inputstandard input outputstandard output On the way to school, Karen became fixated on the puzzle game on her pho
codeforces gym 102801
m0_53921137的博客
08-02 168
Now there are K people play Halli Galli game.They will play N turns in all,in the order of the first player,the second player,⋯,the K player,the first player,⋯. In one turn,the player will display a card on his side,if there are a kinds of fruit which its
CF 333 B.Chips CodeForces【伪容斥】
Irish_Moonshine的博客
10-21 455
Gerald plays the following game. He has a checkered field of size n × n cells, where m various cells are banned. Before the game, he has to put a few chips on some border (but not corner) board cells.
B - Game of the Rows
樱花满地集于我心，楪舞纷飞祈愿相随
08-14 523
B. Game of the Rows time 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
codeforces839B(88/600)
NineFailure的博客
08-13 584
time 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 a
B. Game of the Rows（贪心）
Singular__point的博客
11-25 425
B. Game of the Rows 题目链接：http://codeforces.com/problemset/problem/839/B 大意：船上n行座位，k个小组人，每行相邻的座不能做不同组的人，给你定数据让你判定能不能放下这些人。 { [1,2] [3,4,5,6]    [7,8] } { [1,2] [3,4,5,6]    [7,8] } . .
Codeforces 839B-Game of the Rows
wang_128的博客
08-14 413
Game of the Rows time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Daenerys Targaryen has an army consisting o
codeforces 839b 之 Game of the Rows
ESESZB的博客
09-23 386
B. Game of the Rows time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Daenerys Targaryen has an army consistin
Codeforces Round #428 (Div. 2) Game of the Rows (思维)
nka_kun的博客
08-13 313
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.
Codeforces Round #428 (Div. 2) B.Game of the Rows（贪心+炒鸡多坑的模拟）
HJY
08-13 547
B. Game of the Rows time 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
codeforces 839B Game of the Rows（思路题）
Accepted
08-15 743
题目链接 Game of the Rows 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
Game of the Rows codeforces 839B(贪心)
开心铁匠铺
12-03 181
题目链接题意：有n排座位，每排有2个2连座，1个4连座。有k队人。问能否让他们坐下而没有不同队伍的人相邻。 题解：先把队伍人数大于4的全部转化成小于4的，先用4连座，没有了再用2个二连座。这样就只有1,2,3的了。 先处理3的，优先用4连座，没有就用2个2连座。 在处理2的，可以用4连座，这样还可以坐一个人，这里要记录一下。还可以用2连座，还可以用两个剩下的4连座（即两个已经有两个人坐的4连座
c++the game of life代码
最新发布
05-16
以下是一个简单的C++实现Game of Life的示例代码： ```c++ #include <iostream> #include <cstdlib> #include <ctime> using namespace std; const int ROWS = 20; const int COLS = 60; // 初始化格子 void initializeGrid(bool grid[][COLS]) { srand(time(NULL)); for (int row = 0; row < ROWS; row++) { for (int col = 0; col < COLS; col++) { int random = rand() % 10; if (random < 3) { grid[row][col] = true; } else { grid[row][col] = false; } } } } // 显示格子 void displayGrid(bool grid[][COLS]) { for (int row = 0; row < ROWS; row++) { for (int col = 0; col < COLS; col++) { if (grid[row][col]) { cout << "*"; } else { cout << " "; } } cout << endl; } } // 计算每个格子周围活细胞的数量 int countNeighbors(bool grid[][COLS], int row, int col) { int count = 0; for (int i = -1; i <= 1; i++) { for (int j = -1; j <= 1; j++) { int neighborRow = row + i; int neighborCol = col + j; if (neighborRow >= 0 && neighborRow < ROWS && neighborCol >= 0 && neighborCol < COLS) { if (i != 0 || j != 0) { if (grid[neighborRow][neighborCol]) { count++; } } } } } return count; } // 更新格子 void updateGrid(bool grid[][COLS]) { bool newGrid[ROWS][COLS]; for (int row = 0; row < ROWS; row++) { for (int col = 0; col < COLS; col++) { int neighbors = countNeighbors(grid, row, col); if (grid[row][col]) { if (neighbors == 2 || neighbors == 3) { newGrid[row][col] = true; } else { newGrid[row][col] = false; } } else { if (neighbors == 3) { newGrid[row][col] = true; } else { newGrid[row][col] = false; } } } } for (int row = 0; row < ROWS; row++) { for (int col = 0; col < COLS; col++) { grid[row][col] = newGrid[row][col]; } } } // 主函数 int main() { bool grid[ROWS][COLS]; initializeGrid(grid); while (true) { system("cls"); // 清屏 displayGrid(grid); updateGrid(grid); } return 0; } ``` 以上代码使用二维布尔数组来表示格子的状态，并且使用函数来完成初始化、显示、计算和更新等操作。在主函数中，我们先使用 `initializeGrid` 函数来随机初始化格子的状态，然后使用 `displayGrid` 函数来显示格子，最后使用 `updateGrid` 函数来更新格子的状态。由于Game of Life是一个无限大的世界，因此我们在这里使用了一个简单的循环来模拟它。 需要注意的是，由于在Windows系统中，清屏需要使用 `system("cls")` 命令，因此以上代码只能在Windows系统中运行。如果你想在其他操作系统中运行该代码，需要使用相应的清屏命令。
评论 1
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值