week22

sunH0/week22/Boj16927_배열돌리기.java

@@ -0,0 +1,68 @@
+package 구현;
+
+import java.util.*;
+import java.io.*;
+
+public class Boj16927_배열돌리기 {
+    static int N, M, R;
+	static int[] dx = {1, 0, -1, 0};
+	static int[] dy = {0, 1, 0, -1}; 
+    static int[][] arr;
+    public static void main(String[] args) throws IOException {
+
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+		M = Integer.parseInt(st.nextToken());
+		R = Integer.parseInt(st.nextToken());
+
+        arr = new int[N][M];
+
+        for (int i = 0; i < N; i++) {
+			st = new StringTokenizer(br.readLine());
+			for (int j = 0; j < M; j++) {
+				arr[i][j] = Integer.parseInt(st.nextToken());
+			}
+		} 
+
+        for(int i=0; i<Math.min(N, M)/2; i++) {
+            rotate(i, 2*(N-2*i) + 2*(M-2*i) -4);
+        }
+
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < N; i++) { 
+			for (int j = 0; j < M; j++) {
+				sb.append(arr[i][j] + " ");
+			}
+			sb.append("\n");
+		} 
+		System.out.println(sb);	
+
+
+    }
+
+    public static void rotate(int i, int len) {
+        int cnt = R%len;
+
+        for (int j = 0; j < cnt; j++) {
+			int x = i;
+            int y = i;
+			int pre = arr[i][i];
+			int tmp, idx = 0;
+
+			while(idx<4){
+                int xx = x + dx[idx];
+                int yy = y + dy[idx];
+				if (xx >= i && xx < N - i && yy >= i && yy < M - i) {
+					tmp = arr[xx][yy];
+					arr[xx][yy] = pre;
+					pre = tmp;
+                    x = xx;
+					y = yy;
+				} else idx++;
+            }			
+		}
+
+    }
+}

sunH0/week22/Boj5569_출근경로.java

@@ -0,0 +1,47 @@
+package DP;
+
+import java.io.*;
+import java.util.*;
+
+public class Boj5569_출근경로 {
+
+    public static void main(String[] args) throws IOException {
+
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		StringTokenizer st = new StringTokenizer(br.readLine());
+
+        int w = Integer.parseInt(st.nextToken());
+        int h = Integer.parseInt(st.nextToken());
+        int[][][] dp = new int[w+1][h+1][4];
+
+        // 0 : 위위, 1: 위오, 2: 오오, 3:오위
+        // Bottom-Up
+
+        for(int i=1; i<=w; i++){
+            dp[i][1][0] = 1;
+        }
+
+        for(int i=1; i<=h; i++){
+            dp[1][i][2] = 1;
+        }
+
+        int mod = 100000;
+
+        for(int i = 2; i <= w; i++) {
+            for(int j = 2; j <= h; j++) {
+                dp[i][j][0] = (dp[i-1][j][0]+ dp[i-1][j][3])% mod;
+                dp[i][j][1] = dp[i][j-1][0]% mod;
+                dp[i][j][2] = (dp[i][j-1][1]+ dp[i][j-1][2])% mod;
+                dp[i][j][3] = dp[i-1][j][2]% mod;
+            }
+        }
+
+        int ans = 0;
+        for (int i = 0; i < 4; i++) {
+            ans += dp[w][h][i];
+        }
+
+        System.out.println(ans%mod);
+    }
+
+}

sunH0/week22/Pms_외벽점검.java

@@ -0,0 +1,69 @@
+package kakao;
+
+public class Pms_외벽점검 {
+
+    static int[] nw;
+    static boolean[] visit;
+    static int answer, wl;
+
+    public static int solution(int n, int[] weak, int[] dist) {
+        answer = -1;
+        wl = weak.length;
+
+        nw = new int[weak.length*2-1];
+        visit = new boolean[dist.length];
+		int idx = 0;
+
+		while(idx<nw.length) {
+			if(idx<weak.length) nw[idx] = weak[idx];
+			else nw[idx] = n+weak[idx-weak.length];
+			idx++;
+		}
+
+        for (int i = 1; i <= dist.length; i++) {
+			dfs(dist, visit, 0, i, new int[i]);
+		}
+
+        return answer;
+    }
+
+    static void dfs(int[] dist, boolean[] visit, int depth, int cnt, int[] tmp) {
+        if (answer != -1) {
+			return;
+		}
+		if (depth == cnt) {
+			check(tmp);
+			return;
+		}
+
+        for (int i = 0; i < dist.length; i++) {
+			if (visit[i]) {
+				continue;
+			}
+			tmp[depth] = dist[i];
+			visit[i] = true;
+			dfs(dist, visit, depth+1, cnt, tmp);
+			visit[i] = false;
+		}
+
+    }
+
+    static void check(int[] tmp) {
+		outer : for (int i = 0; i < wl; i++) {
+			int start = i;
+			int f = 0;
+			for (int j = i; j < i + wl; j++) {
+				if (nw[j] - nw[start] > tmp[f]) {
+					start = j;
+					f++;
+				}
+				if (f == tmp.length) {
+					continue outer;
+				}
+			}
+			answer = tmp.length;
+			return;
+		}
+	}
+
+}