SDKD 2019 Spring Training Series C2 2nd Round E - YY's Minions ZOJ - 3804

一个简单的模拟，题意读不懂真的是卡死

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
const int maxn = 52;
int n,m,f,k;
char a[maxn][maxn];
char s1[maxn][maxn];
int dx[] = {-1,-1,-1,0,0,1,1,1};
int dy[] = {-1,0,1,-1,1,-1,0,1};
vector<P> t[1000 + 10];
void init()
{
    for(int i = 1;i <= 1000;i++) t[i].clear();
}
void solve(int x,int y)
{
    int cnt = 0;
    for(int i = 0;i < 8;i++)
    {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if(nx >= 1 && nx <= n && ny >= 1 && ny <= m && a[nx][ny] == '1') cnt++;
    }
    if(a[x][y] == '1')
    {
        if(cnt < 2 || cnt > 3) s1[x][y] = '0';
        else s1[x][y] = '1';
    }
    else if(a[x][y] == '0')
    {
        if(cnt == 3) s1[x][y] = '1';
        else s1[x][y] = '0';
    }
}
int main()
{
    int Q; scanf("%d",&Q);
    while(Q--)
    {
        int u,v,w;
        init();
        memset(s1,0,sizeof(s1));
        scanf("%d%d%d%d",&n,&m,&f,&k);
        for(int i = 1;i <= n;i++)
        {
            for(int j = 1;j <= m;j++)
            {
                cin>>a[i][j];
            }
        }
        for(int i = 0;i < k;i++)
        {
            scanf("%d%d%d",&u,&v,&w);
            t[u].push_back(P(v,w));
        }
        for(int i = 1;i <= f;i++)//枚举时间
        {
            for(int j = 1;j <= n;j++)
            {
                for(int k = 1;k <= m;k++)
                {
                    if(a[j][k] == 'X' || s1[j][k] == 'X')
                    {
                        s1[j][k] = 'X';
                        continue;
                    }
                    solve(j,k);
                }
            }
            for(int j = 1;j <= n;j++)
            {
                for(int k = 1;k <= m;k++)
                {
                    a[j][k] = s1[j][k];
                }
            }
            for(int j = 0;j < (int)t[i].size();j++)
            {
                P now = t[i][j];
                a[now.first][now.second] = 'X';
            }
        }
        for(int j = 1;j <= n;j++)
        {
            for(int k = 1;k <= m;k++)
            {
                printf("%c",a[j][k]);
            }
            printf("\n");
        }
    }
    return 0;
}