From 6350393967db34435a8c631257ebb109b4365a8b Mon Sep 17 00:00:00 2001
From: oncsr <khj20006@naver.com>
Date: Thu, 13 Feb 2025 10:20:02 +0900
Subject: [PATCH] =?UTF-8?q?[20250213]=20BOJ=20/=20G2=20/=20=EC=95=84?=
 =?UTF-8?q?=EB=A6=AC=EC=8A=A4,=20=EC=B2=AD=EC=86=8C=ED=95=A9=EB=8B=88?=
 =?UTF-8?q?=EB=8B=A4!=20(Easy)=20/=20=EA=B6=8C=ED=98=81=EC=A4=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...25\251\353\213\210\353\213\244! (Easy).md" | 94 +++++++++++++++++++
 1 file changed, 94 insertions(+)
 create mode 100644 "khj20006/202502/13 BOJ G2 \354\225\204\353\246\254\354\212\244, \354\262\255\354\206\214\355\225\251\353\213\210\353\213\244! (Easy).md"

diff --git "a/khj20006/202502/13 BOJ G2 \354\225\204\353\246\254\354\212\244, \354\262\255\354\206\214\355\225\251\353\213\210\353\213\244! (Easy).md" "b/khj20006/202502/13 BOJ G2 \354\225\204\353\246\254\354\212\244, \354\262\255\354\206\214\355\225\251\353\213\210\353\213\244! (Easy).md"
new file mode 100644
index 00000000..749cb63b
--- /dev/null
+++ "b/khj20006/202502/13 BOJ G2 \354\225\204\353\246\254\354\212\244, \354\262\255\354\206\214\355\225\251\353\213\210\353\213\244! (Easy).md"	
@@ -0,0 +1,94 @@
+```java
+
+import java.util.*;
+import java.io.*;
+
+class Node {
+	int x, y, dir, time;
+	Node(int x, int y, int dir, int time){
+		this.x = x;
+		this.y = y;
+		this.dir = dir;
+		this.time = time;
+	}
+}
+
+class Main {
+	
+	// IO field
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+
+	static void nextLine() throws Exception {st = new StringTokenizer(br.readLine());}
+	static int nextInt() {return Integer.parseInt(st.nextToken());}
+	static long nextLong() {return Long.parseLong(st.nextToken());}
+	static void bwEnd() throws Exception {bw.flush();bw.close();}
+	
+	// Additional field
+	static int[] dx = {-1,0,1,0};
+	static int[] dy = {0,1,0,-1};
+	static int H, W, R, C, D;
+	
+	static int[][] A, B;
+	static boolean[][] dust;
+	
+	public static void main(String[] args) throws Exception {
+		
+		ready();
+		solve();
+	
+		bwEnd();
+	}
+	
+	static void ready() throws Exception{
+		
+		nextLine();
+		H = nextInt();
+		W = nextInt();
+		nextLine();
+		R = nextInt();
+		C = nextInt();
+		D = nextInt();
+		
+		A = new int[H][W];
+		B = new int[H][W];
+		for(int i=0;i<H;i++) {
+			char[] arr = br.readLine().toCharArray();
+			for(int j=0;j<W;j++) A[i][j] = arr[j]-'0';
+		}
+		for(int i=0;i<H;i++) {
+			char[] arr = br.readLine().toCharArray();
+			for(int j=0;j<W;j++) B[i][j] = arr[j]-'0';
+		}
+		
+		dust = new boolean[H][W];
+	}
+	
+	static void solve() throws Exception{
+
+		int time = 0, ans = 0;
+		while(time <= 100000000) {
+			
+			boolean wasDust = !dust[R][C];
+
+			int PS = dust[R][C] ? B[R][C] : A[R][C];
+			D = (D + PS) % 4;
+			dust[R][C] = true;
+			R += dx[D];
+			C += dy[D];
+			time++;
+			if(wasDust) ans = time;
+			if(out(R,C)) break;
+			
+		}
+		bw.write(ans + "\n");
+	}
+	
+	static boolean out(int x, int y) {
+		return x<0 || x>=H || y<0 || y>=W;
+	}
+	
+}
+
+```