import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { private static int R, C, T, answer = 0; private static int[][] room; private static int[][] temp; private static int[] airPurifier; private static int[] dx = {0, 1, 0, -1}; private static int[] dy = {1, 0, -1, 0}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); R = Integer.parseInt(st.nextToken()); C = Integer.parseInt(st.nextToken()); T = Integer.parseInt(st.nextToken()); room = new int[R][C]; airPurifier = new int[2]; int index = 0; for (int i = 0; i < R; i++) { st = new StringTokenizer(br.readLine()); for (int j = 0; j < C; j++) { int x = Integer.parseInt(st.nextToken()); room[i][j] = x; if (x == -1) { airPurifier[index++] = i; } else { answer += x; } } } for (int t = 0; t < T; t++) { temp = new int[R][C]; for (int i = 0; i < R; i++) { for (int j = 0; j < C; j++) { if (room[i][j] >= 5) { diffuse(i, j); } } } for (int i = 0; i < R; i++) { room[i] = Arrays.copyOf(temp[i], C); } wind(); } System.out.println(answer); } private static void diffuse(int x, int y) { int sum = 0; for (int i = 0; i < 4; i++) { int nx = x + dx[i]; int ny = y + dy[i]; if (0 <= nx && nx < R && 0 <= ny && ny < C && temp[nx][ny] != -1) { int dust = (int) Math.floor((double) room[x][y] / 5); temp[nx][ny] += dust; sum += dust; } } temp[x][y] -= sum; } private static void wind() { int top = airPurifier[0]; int bottom = airPurifier[1]; answer -= room[top - 1][0]; for (int i = top - 1; i > 0; i--) room[i][0] = room[i - 1][0]; for (int i = 0; i < C - 1; i++) room[0][i] = room[0][i + 1]; for (int i = 0; i < top; i++) room[i][C - 1] = room[i + 1][C - 1]; for (int i = C - 1; i > 1; i--) room[top][i] = room[top][i - 1]; room[top][1] = 0; answer -= room[bottom + 1][0]; for (int i = bottom + 1; i < R - 1; i++) room[i][0] = room[i + 1][0]; for (int i = 0; i < C - 1; i++) room[R - 1][i] = room[R - 1][i + 1]; for (int i = R - 1; i < bottom; i--) room[i][C - 1] = room[i - 1][C - 1]; for (int i = C - 1; i > 1; i--) room[bottom][i] = room[bottom][i - 1]; room[bottom][1] = 0; } }

제출 #21098

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: