import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { class Tree implements Comparable { int age; boolean isDead; Tree(int age) { this.age = age; this.isDead = false; } public int compareTo(Tree o) { return this.age - o.age; } } BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int n = Integer.parseInt(st.nextToken()); int m = Integer.parseInt(st.nextToken()); int k = Integer.parseInt(st.nextToken()); int[][] area = new int[n][n]; PriorityQueue[][] trees = new PriorityQueue[n][n]; for(int i=0;i(); } } int[][] a = new int[n][n]; for(int i=0;i 0) { //spring for(int y=0;y= tree.age) { area[y][x] -= tree.age++; } else { tree.isDead = true; } } } } //summer for(int y=0;y pq = new PriorityQueue<>(); for(Tree tree : trees[y][x]) { if(tree.isDead) { area[y][x] += tree.age / 2; } else { pq.add(tree); } } trees[y][x] = pq; } } //autumn for(int y=0;y= n || nx < 0 || nx >= n) continue; trees[ny][nx].add(new Tree(1)); } } } } } //winter for(int y=0;y

제출 #188987

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: