shunfurh 于 2017.08.29 00:22 提问
 YY's Minions

Despite YY's so much homework, she would like to take some time to play with her minions first.
YY lines her minions up to an N*M matrix. Every minion has two statuses: awake or asleep. We use 0(the digit) to represent that it is asleep, and 1 for awake. Also, we define the minions who are around a minion closest in one of the eight directions its neighbors. And every minute every minion will change its status by the following specific rules:
If this minion is awake, and the number of its neighbors who are awake is less than 2, this minion will feel lonely and turn to asleep.
If this minion is awake, and the number of its neighbors who are awake is more than 3, this minion will turn to asleep for it will feel too crowded.
If this minion is awake, and the number of its neighbors who are awake is exactly 2 or 3, this minion will keep being awake and feel very happy.
If this minion is asleep, and the number of its neighbors who are awake is exactly 3, this minion will wake up because of the noise.
Note that all changes take place at the same time at the beginning of a specific minute.
Also, some minions will get bored and leave this silly game. We use 'X's to describe them. We suppose that a minion would leave after T minutes. It will leave at the end of the Tth minute. Its status is considered during the change at the beginning of the Tth minute, and should be ignored after that. Of course, one minion will not leave twice!YY is a girl full of curiosity and wants to know every minion's status after F minutes. But you know she is weak and lazy! Please help this cute girl to solve this problem :)
Input
There are multiple test cases.
The first line contains the number of test cases Q. 1<=Q<=100.
For each case, there are several lines:
The first line contains four integers N, M, F, K. K means the number of leaving messages. 1<=N, M<=50, 1<=F<=1000, 1<=K<=N*M.
Next N lines are the matrix which shows the initial status of each minion. Each line contains M chars. We guarantee that 'X' wouldn't appear in initial status matrix.
And next K lines are the leaving messages. Each line contains three integers Ti, Xi, Yi, They mean the minion who is located in (Xi, Yi) will leave the game at the end of the Tith minutes. 1<=Ti<= F, 1<=Xi<=N, 1<=Yi<=M.Output
For each case, output N lines as a matrix which shows the status of each minion after F minutes.
Sample Input
2
3 3 2 1
101
110
001
1 2 2
5 5 6 3
10111
01000
00000
01100
10000
2 3 3
2 4 1
5 1 5
Sample Output010
1X0
010
0000X
11000
00X00
X0000
00000
HintFor case 1:
T=0, the game starts
101
110001
at the beginning of T=1, a change took place
100
101010
at the end of T=1 (the minion in (2,2) left)
100
1X1010
at the beginning of T=2, a change took place
010
1X0010
at the end of T=2 (nothing changed for no minion left at T=2)
010
1X0
010
 caozhy 2017.09.13 00:40
 已采纳
 其他相关推荐
 ZOJ 3804 YY's Minions
 http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3804#include&lt;bits/stdc++.h&gt; using namespace std; int ma[55][55]; int f,k; struct node{ int x,y,t; }p[2555]; int n,m; bool cp(node x,...
 ZOJ 3804 YY's Minions
 题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3804
 ZOJ3804:YY's Minions(模拟)
 Despite YY's so much homework, she would like to take some time to play with her minions first. YY lines her minions up to an N*M matrix. Every minion has two statuses: awake or asleep. We use 0(the
 ZOJ 3804 YY's Minions(模拟)
 题意 你有n*m个小兵排成一个矩阵 每个在矩阵里的小兵有两种状态 0睡着 或 1清醒 每秒都会发生如下事件 睡着的小兵在他周围恰好有3个醒着的小兵时会醒过来 醒着的 小兵在周围醒着的的小兵数大于3或小于2时会睡着 还有k个小兵会在一定的时间离开 X 求f秒之后所有小兵的状态 直接模拟就行咯~~ #include #include #include using name
 YY's Minions  ZOJ 3804 搜索
 YY's Minions Time Limit: 2 Seconds Memory Limit: 65536 KB Despite YY's so much homework, she would like to take some time to play with her minions first. YY lines her minions up to an N*
 ZOJ 3804 YY's Minions（搜索+模拟）
 Despite YY's so much homework, she would like to take some time to play with her minions first. YY lines her minions up to an N*M matrix. Every minion has two statuses: awake or asleep. We use 0(the digit) to represent that it is asleep, and 1 for awake.
 ZOJ 3804 YY's Minions（简单模拟）
 YY's Minions Time Limit: 2 Seconds Memory Limit: 65536 KB Despite YY's so much homework, she would like to take some time to play with her minions first. YY lines her minions up to an N*M
 ZOJ  3804 YY's Minions(模拟)
 很水的一个模拟。
 ZOJ 3804 YY's Minions（模拟）
 Despite YY's so much homework, she would like to take some time to play with her minions first. YY lines her minions up to an N*M matrix. Every minion has two statuses: awake or asleep. We use 0(the digit) to represent that it is asleep, and 1 for awake. A
 saltstack安装配置笔记
 环境 centos 6.7 centos 6.7 10.1.110.230 master centos 6.7 10.1.110.231 minion 安装： 首先，如果你的系统中EPEL当前不是enabled的话，你需要先通过如下的命令对其进行启动 命令：rpm Uvh http://ftp.linux.ncsu.edu/pub/epel/6/i386/epelre