import java.util.ArrayList; public class Main { static int R, C, M, h = 0, totalSize = 0; static int[] dr = { 0, -1, 1, 0, 0 }, dc = { 0, 0, 0, 1, -1 }; static int[][] board; static ArrayList sharks = new ArrayList<>(), nextSharks = new ArrayList<>(); public static void main(String[] args) throws Exception { R = read(); C = read(); M = read(); board = new int[R + 1][C + 1]; for (int i = 0; i < M; i++) { int r = read(), c = read(), s = read(), d = read(), z = read(); sharks.add(new int[] { r, c, s, d, z }); if (c == 1) h = h == 0 ? r : Math.min(h, r); board[r][c] = z; } sharks.sort((o1, o2) -> o2[4] - o1[4]); for (int i = 1; i < C + 1; i++) { totalSize += board[h][i]; int nh = 0; nextSharks = new ArrayList<>(); board = new int[R + 1][C + 1]; for (int[] shark : sharks) { if (shark[0] == h && shark[1] == i) continue; int[] nextShark = moveShark(shark); int r = nextShark[0], c = nextShark[1], z = nextShark[4]; if (board[r][c] != 0) continue; nextSharks.add(nextShark); if (c == i + 1) nh = nh == 0 ? r : Math.min(nh, r); board[r][c] = z; } sharks = nextSharks; h = nh; } System.out.println(totalSize); } private static int[] moveShark(int[] shark) { int r = shark[0], c = shark[1], s = shark[2], d = shark[3], z = shark[4]; r += dr[d] * s; c += dc[d] * s; r = R - 1 - Math.abs(R - 1 - Math.floorMod(r, 2 * (R - 1))); c = C - 1 - Math.abs(C - 1 - Math.floorMod(c, 2 * (C - 1))); return new int[] { r, c, s, d, z }; } private static int read() throws Exception { int c, n = System.in.read() & 15; while ((c = System.in.read()) >= 48) n = (n << 3) + (n << 1) + (c & 15); if (c == 13) System.in.read(); return n; } }

제출 #13634

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: