如何计算移动的方格被另一个占据,怎么采用C语言的代码的设计的技术的方式来实现呢

Problem Description
A typical strategy in the game Starcraft is to mass up large amounts of low-tier units such as Zerglings, then throw them at your opponent and laugh maniacally as they overwhelm any opposition. However, when both players opt for the same strategy, the result can often become...quick, brutal and messy. Sadly, the game only allows for up to 400 Zerglings per player. In this problem, however, you will simulate games that could have more than 400 Zerglings.

The map on which Zerg rushes occur is represented by a NxN grid. Each Zergling occupies a grid square and no two Zerglings ever occupy the same grid square. Each Zergling has a certain number of hit points which starts off as 35. Its attack value is 5 plus the attack upgrade of the player that controls it. When one Zergling attacks another, the damage incurred equals to the attack value of the attacking Zergling minus the armour upgrade of the player that owns the Zergling being attacked. The number of hit points of the Zergling that is attacked is reduced by the amount of the damage.

Due to the inability of both players to manage their huge horde of Zerglings, the Zerglings make their decisions each turn using the following algorithm (Zerglings are not the brightest creatures, as you will see):

  • If there is an opponent Zergling in one of the 8 horizontally, vertically, or diagonally adjacent grid squares, the Zergling will attack it. A Zergling attacks at most one opponent each turn; see below for the tie-breaking rules.
  • Otherwise, if the other player has at least one Zergling remaining on the map, the Zergling will move to the horizontally, vertically, or diagonally adjacent square that is closest to the opponent's closest Zergling in terms of Manhattan distance. When more than one adjacent square is closest, the tie-breaking rules below are used. The Manhattan distance between two points is the sum of the differences in the x and y coordinates of the points.

When the above rules could cause the Zergling to attack in more than one direction, or to move in more than one direction, the following tie-breaking rule is used. The Zergling will prefer the first direction starting with north going clockwise. That is, the directions in order of preference are north, northeast, east, southeast, etc.

Once all Zerglings have made their decisions, all the attacks are conducted simultaneously and all the Zerglings with 0 or fewer hit points are marked as dead and removed from the map. Then all the movements of the Zerglings that didn't attack are conducted simultaneously. If the square to which a Zergling is moving is occupied by another Zergling that is not moving away in this turn, then the Zergling does not move. If two or more Zerglings try to move to the same grid square, then the Zergling in the northernmost row has the right of way and the other Zergling remains stationary. If there are multiple Zerglings in the northernmost row trying to move to the same grid square, then of these, the westernmost Zergling moves and the others remain stationary. Zerglings also have a remarkable regeneration rate. After each turn, all the Zerglings that are still alive and have less than 35 hitpoints will regain one hit point.

Input
The input file contains a number of test cases, ended by a case with N=0. Each case begins with N between 2 and 150, followed by 2 pairs of 2 integers between 0 and 3, the attack and armour upgrades of the first player, followed by the attack and armour upgrades of the second player. This is followed by the initial game map, where '.' denotes an empty square, '1' a Zergling belonging to the first player and '2' a Zergling belonging to the second player. On the map, north is up (i.e. towards the first row) and west is left (i.e. towards the first column). Finally, the test case provides the number t of turns for which the Zerg rush is to be simulated, which is an integer between 0 and 400, inclusive.

Output
For each input case, output the map after t turns in the same format as above. Print one empty line between the output for consecutive test cases.

Sample Input
2
0 0
0 0
1.
..
0
2
0 0
0 0
1.
.2
100
0

Sample Output
1.
..

..
..

Csdn user default icon
上传中...
上传图片
插入图片
抄袭、复制答案,以达到刷声望分或其他目的的行为,在CSDN问答是严格禁止的,一经发现立刻封号。是时候展现真正的技术了!
立即提问

相似问题

1
js如何判断空间不够,不能移入呢?或者说不能跨界移入
1
一个有关N皇后问题的做法
2
骨牌铺方格,这个程序有什么问题
0
C语言计算在N*N的方格棋盘放置了N个皇后,对于给定的N,求出有多少种合法的放置方法
0
骨牌铺方格,请输出铺放方案的总数,要求市使用C语言方式的解决
1
在2×n的长方形方格铺满方格,输入n ,C语言编程输出铺放方案的总数
0
N个皇后同一排,同一列,求出有多少种合法的放置方法,用C语言的程序的设计的思路
0
C++ opencv对图像使用硬拼接如何解决无缝融合问题
0
对于给定的N,求出有多少种合法的放置方法,运用C语言的程序综合思维怎么解决的?
0
N皇后问题求出有多少种合法的放置方法,怎么采用C语言的程序实现的思路去编写的程序?
1
数据结构里面求出有多少种合法的放置方法,怎么采用C程序的编写代码的过程实现的技术?
0
数组走到右上角时可以获得的最大金币数目,请问怎么样才能使用C语言的程序的编写的技术实现的?
0
走到右上角时可以获得的最大金币数目的运算,怎么采用C程序的语言代码编写技术去实现的呢?
0
求大佬解答一下,这个怎么做,c,c++,Java都行
0
如何实现类似360桌面助手的软件?
0
有多少种合法的放置方法,请问用C语言的程序编写代码的方式去有效地实现的
0
对于给定的N,求出有多少种合法的放置方法这个怎么用C语言的程序的编写的方法来求出的
0
自制拼图游戏遇到的问题,script中语句无法对div的样式属性进行干涉