[BOJ] 백준 17143 낚시왕

[문제]

https://www.acmicpc.net/problem/17143

 

 

[소스 코드]

import java.io.*;
import java.util.*;

public class Main {
	static class Shark{
		int r,c,s,d,z;
		Shark(int r,int c,int s,int d,int z){
			this.r = r;
			this.c = c;
			this.s = s;
			this.d = d;
			this.z = z;
		}
	}
	static Shark[][] map;
	static int[] dr = {-1,0,1,0};
	static int[] dc = {0,-1,0,1};
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int R = Integer.parseInt(st.nextToken());
		int C = Integer.parseInt(st.nextToken());
		int M = Integer.parseInt(st.nextToken());
		map = new Shark[R][C];
		for(int i=0;i<M;i++) {
			st = new StringTokenizer(br.readLine());
			int r = Integer.parseInt(st.nextToken());
			int c = Integer.parseInt(st.nextToken());
			int s = Integer.parseInt(st.nextToken());
			int d = Integer.parseInt(st.nextToken());
			int z = Integer.parseInt(st.nextToken());
			if(d==1) d=0;
			if(d==4) d=1;
			if(d==0 || d==2) s %= (R-1)*2;
			if(d==1 || d==3) s %= (C-1)*2;
			map[r-1][c-1] = new Shark(r-1,c-1,s,d,z);
			}
		int result = 0;
		for(int col=0;col<C;col++) {
			for(int row=0;row<R;row++) {
				if(map[row][col]!=null) {
					result += map[row][col].z;
					map[row][col] = null;
					break;
				}
			}
			Queue<Shark> q = new LinkedList<>();
			for(int i=0;i<R;i++) {
				for(int j=0;j<C;j++) {
					if(map[i][j]!=null) {
						q.offer(map[i][j]);
					}
				}
			}
			map = new Shark[R][C];
			while(!q.isEmpty()) {
				Shark curr = q.poll();
				int speed = curr.s;
				for(int i=0;i<speed;i++) {
					int nr = curr.r + dr[curr.d];
					int nc = curr.c + dc[curr.d];
					if(nr<0 || nr>=R || nc<0 || nc>=C) {
						curr.r -= dr[curr.d];
						curr.c -= dc[curr.d];
						curr.d = (curr.d+2)%4;
						continue;
					}
					curr.r = nr;
					curr.c = nc;
				}
				if(map[curr.r][curr.c]!=null) {
					if(map[curr.r][curr.c].z<curr.z) {
						map[curr.r][curr.c] = curr;
					}
				}
				else {
					map[curr.r][curr.c] = curr;
				}
			}
		}
		System.out.println(result);
	}
}