[SWEA 5653번] 줄기세포배양

[SWEA 5653번 줄기세포배양 URL]

https://www.swexpertacademy.com/main/code/problem/problemDetail.do

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Set;
import java.util.StringTokenizer;
 
public class Solution {
 
    public static int tCase, N, M, K;
    public static Node[][][] map;
    public static int[] dirX = new int[] { 0, 0, -1, 1 };
    public static int[] dirY = new int[] { -1, 1, 0, 0 };
 
    public static void main(String[] args) throws Exception {
 
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        tCase = Integer.parseInt(br.readLine());
 
        for (int tc = 1; tc <= tCase; tc++) {
 
            StringTokenizer st = new StringTokenizer(br.readLine());
            N = Integer.parseInt(st.nextToken());
            M = Integer.parseInt(st.nextToken());
            K = Integer.parseInt(st.nextToken());
 
            map = new Node[2][360][360];
 
            for (int i = 151; i < N + 151; i++) {
                st = new StringTokenizer(br.readLine());
                for (int j = 151; j < M + 151; j++) {
                    int life = Integer.parseInt(st.nextToken());
                    if (life > 0)
                        map[0][i][j] = new Node(life, 0, 0);
                }
            }
 
            int curMap = 0;
            for (int t = 0; t < K; t++) {
 
                for (int i = 0; i < N + 305; i++) {
 
                    for (int j = 0; j < M + 305; j++) {
 
                        if (map[curMap][i][j] == null)
                            continue;
 
                        if (map[curMap][i][j].state == 0) { // 비활성
 
                            map[curMap][i][j].time += 1;
                            if (map[curMap][i][j].time == map[curMap][i][j].life)
                                map[curMap][i][j].state = 1;
 
                            map[1 - curMap][i][j] = new Node(map[curMap][i][j].life, map[curMap][i][j].time,
                                    map[curMap][i][j].state);
 
                        } else if (map[curMap][i][j].state == 1) { // 활성
                            if (map[curMap][i][j].time == map[curMap][i][j].life) {
                                
                                for (int k = 0; k < 4; k++) {
                                    int nr = i + dirX[k];
                                    int nc = j + dirY[k];
                                    if (map[curMap][nr][nc] == null) {
                                        if (map[1 - curMap][nr][nc] == null) {
                                            map[1 - curMap][nr][nc] = new Node(map[curMap][i][j].life, 0, 0);
                                        } else {
                                            if (map[1 - curMap][nr][nc].state == 0
                                                    && map[1 - curMap][nr][nc].life < map[curMap][i][j].life)
                                                map[1 - curMap][nr][nc] = new Node(map[curMap][i][j].life, 0, 0);
                                        }
                                    }
                                }
                            }
 
                            map[curMap][i][j].time += 1;
                            if (map[curMap][i][j].time == map[curMap][i][j].life * 2)
                                map[curMap][i][j].state = 2;
                            map[1 - curMap][i][j] = new Node(map[curMap][i][j].life, map[curMap][i][j].time,
                                    map[curMap][i][j].state);
 
                        } else if (map[curMap][i][j].state == 2) { // 죽음
                            map[1 - curMap][i][j] = new Node(map[curMap][i][j].life, map[curMap][i][j].time,
                                    map[curMap][i][j].state);
                        }
                    }
                }
                curMap = 1 - curMap;    
            }
 
            int ans = 0;
            for (int i = 0; i < N + 305; i++) {
 
                for (int j = 0; j < M + 305; j++) {
                    if (map[curMap][i][j] != null && map[curMap][i][j].state != 2)
                        ans += 1;
                }
            }
            System.out.println("#" + tc + " " + ans);
        }
    }
}
 
class Node {
 
    int life;
    int time;
    int state;
 
    public Node(int life, int time, int state) {
        super();
        this.life = life;
        this.time = time;
        this.state = state;
    }
 
}