글 읽기 - 자바 반례를 찾지 못하겠습니다..

zxv74014 5년 전 1

문제상 주어진 모든 테스트 케이스 통과하였구요, 질문게시판에 올라온 최대크기 테스트 케이스또한 정답을 출력하고 있습니다.

어느부분에서 문제가 되는지 모르겠습니다. 도와주시면 감사하겠습니다 ㅠ

import java.util.*;

public class Main {
    static int N, M, K;
    static int map[][], nutrient[][];
    static int dR[] = {1, 0, -1, 0, 1, 1, -1, -1};
    static int dC[] = {0, 1, 0, -1, 1, -1, 1, -1};
    static List<Tree> tree;

    public static class Tree implements Comparable<Tree> {
        public int x, y, z;
        public boolean life;

        Tree(int x, int y, int z, boolean life) {
            this.x = x;
            this.y = y;
            this.z = z;
            this.life = life;
        }

        @Override
        public int compareTo(Tree t) {
            int result = Integer.compare(this.y, t.y);
            if (result == 0) {
                result = Integer.compare(this.x, t.x);
            }
            if (result == 0) {
                result = Integer.compare(this.z, t.z);
            }
            return result;
        }
    }


    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        N = scan.nextInt();
        M = scan.nextInt();
        K = scan.nextInt();
        map = new int[10][10];
        nutrient = new int[10][10];
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < N; ++j) {
                map[i][j] = 5;
                nutrient[i][j] = scan.nextInt();
            }
        }
        tree = new ArrayList<>();
        for (int i = 0; i < M; ++i) {
            int x = scan.nextInt();
            int y = scan.nextInt();
            int z = scan.nextInt();
            Tree tmpTree = new Tree(x - 1, y - 1, z, true);
            tree.add(tmpTree);
        }
        for (int i = 0; i < K; ++i) {
            Collections.sort(tree);
            Spring();
            Summer();
            Fall();
            Winter();
        }
        Summer();
        System.out.println(tree.size());
    }

    private static void Spring() {
        for (int i = 0; i < tree.size(); ++i) {
            if (tree.get(i).z <= map[tree.get(i).y][tree.get(i).x]) {
                map[tree.get(i).y][tree.get(i).x] -= tree.get(i).z;
                ++tree.get(i).z;
            } else {
                tree.get(i).life = false;
            }
        }
    }

    private static void Summer() {
        for (int i = 0; i < tree.size(); ++i) {
            if (!tree.get(i).life) {
                map[tree.get(i).y][tree.get(i).x] += (tree.get(i).z / 2);
                tree.remove(i);
                i--;
            }
        }
    }

    private static void Fall() {
        for (int i = 0; i < tree.size(); ++i) {
            if (tree.get(i).z % 5 == 0) {
                int cR = tree.get(i).y;
                int cC = tree.get(i).x;
                for (int d = 0; d < 8; ++d) {
                    int nR = cR + dR[d];
                    int nC = cC + dC[d];
                    if (inRange(nR, nC)) {
                        Tree tmpTree = new Tree(nC, nR, 1, true);
                        tree.add(tmpTree);
                    }
                }
            }
        }
    }

    private static void Winter() {
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < N; ++j) {
                map[i][j] += nutrient[i][j];
            }
        }
    }

    private static boolean inRange(int row, int col) {
        return (row >= 0 && row < N) && (col >= 0 && col < N);
    }

}