diff --git "a/BOJ/1000-5000353円262円210円/JY_1613.java" "b/BOJ/1000-5000353円262円210円/JY_1613.java"
new file mode 100644
index 00000000..fee3423f
--- /dev/null
+++ "b/BOJ/1000-5000353円262円210円/JY_1613.java"
@@ -0,0 +1,68 @@
+package day1113;
+
+import java.io.*;
+import java.util.*;
+
+public class JY_1613 {
+	
+	static final int INF = 50_000;
+
+	public static void main(String[] args) throws IOException{
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		StringTokenizer st = new StringTokenizer(br.readLine());
+		
+		int N = Integer.parseInt(st.nextToken());
+		int K = Integer.parseInt(st.nextToken());
+		
+		int[][] g = new int[N+1][N+1];
+		for(int i=0; i<n+1; i++) { + Arrays.fill(g[i], INF); + } + // 자신으로가는 비용은 0으로 처리 + for(int i=1; i<n+1; i++) { + for(int j=1; j<n+1; j++) { + if(i == j) g[i][j] = 0; + } + } + + for(int i=0; i<k; i++) { + st = new StringTokenizer(br.readLine()); + int a = Integer.parseInt(st.nextToken()); + int b = Integer.parseInt(st.nextToken()); + + g[a][b] = 1; + } + + // 플로이드 와샬: i -> j로 갈 수 있는 최단거리 구함
+		for(int k=1; k<n+1; k++) { + for(int i=1; i<n+1; i++) { + for(int j=1; j<n+1; j++) { + g[i][j] = Math.min(g[i][j], g[i][k]+g[k][j]); + } + } + } + + + st = new StringTokenizer(br.readLine()); + int S = Integer.parseInt(st.nextToken()); + + StringBuilder sb = new StringBuilder(); + for(int s=0; s<s; s++) { + st = new StringTokenizer(br.readLine()); + int a = Integer.parseInt(st.nextToken()); + int b = Integer.parseInt(st.nextToken()); + + if(g[a][b] != INF) { + sb.append("-1\n"); + } else if(g[b][a] != INF) { + sb.append("1\n"); + } else { + sb.append("0\n"); + } + } + + System.out.println(sb.toString()); + + } + +} diff --git "a/BOJ/1000-5000353円262円210円/JY_2096.java" "b/BOJ/1000-5000353円262円210円/JY_2096.java" new file mode 100644 index 00000000..c596bcd0 --- /dev/null +++ "b/BOJ/1000-5000353円262円210円/JY_2096.java" @@ -0,0 +1,46 @@ +package day1113; + +import java.io.*; +import java.util.*; + +public class JY_2096 { + + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + StringTokenizer st = new StringTokenizer(br.readLine()); + + int N = Integer.parseInt(st.nextToken()); + int[][] dp1 = new int[N][3]; + int[][] dp2 = new int[N][3]; + + for(int i=0; i<n; i++) { + st = new StringTokenizer(br.readLine()); + dp1[i][0] = Integer.parseInt(st.nextToken()); + dp1[i][1] = Integer.parseInt(st.nextToken()); + dp1[i][2] = Integer.parseInt(st.nextToken()); + } + + for(int i=0; i<n; i++) { + dp2[i][0] = dp1[i][0]; + dp2[i][1] = dp1[i][1]; + dp2[i][2] = dp1[i][2]; + } + + for(int i=1; i<n; i++) { + dp1[i][0] = dp1[i][0] + Math.min(dp1[i-1][0], dp1[i-1][1]); + dp1[i][1] = dp1[i][1] + Math.min(dp1[i-1][0], Math.min(dp1[i-1][1], dp1[i-1][2])); + dp1[i][2] = dp1[i][2] + Math.min(dp1[i-1][1], dp1[i-1][2]); + + dp2[i][0] = dp2[i][0] + Math.max(dp2[i-1][0], dp2[i-1][1]); + dp2[i][1] = dp2[i][1] + Math.max(dp2[i-1][0], Math.max(dp2[i-1][1], dp2[i-1][2])); + dp2[i][2] = dp2[i][2] + Math.max(dp2[i-1][1], dp2[i-1][2]); + } + + int max = Math.max(dp2[N-1][0], Math.max(dp2[N-1][1], dp2[N-1][2])); + int min = Math.min(dp1[N-1][0], Math.min(dp1[N-1][1], dp1[N-1][2])); + + System.out.println(max+" "+min); + + } + +} diff --git "a/BOJ/1000-5000353円262円210円/JY_2955.java" "b/BOJ/1000-5000353円262円210円/JY_2955.java" new file mode 100644 index 00000000..7d3a43ed --- /dev/null +++ "b/BOJ/1000-5000353円262円210円/JY_2955.java" @@ -0,0 +1,194 @@ +package day1112; + +import java.io.*; +import java.util.*; + +public class JY_2955 { + + static final int N = 9; + static int[][] g; + static boolean[][] visited; + + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + + g = new int[N][N]; + for(int i=0; i<n; i++) { + String s = br.readLine(); + for(int j=0; j<n; j++) { + if(s.charAt(j) == '.') { + g[i][j] = 0; + } else { + g[i][j] = s.charAt(j) - '0'; + } + } + } + + + + // cross hatching + while(true) { + boolean isDone = true; + + for(int n=1; n<=9; n++) { + // 유효성 체크 + if(!isValid(n)) { + System.out.println("ERROR"); + return; + } + int cnt = crossHatching(n); + if(cnt> 0) isDone = false;
+			}
+			
+			if(isDone) break;
+			
+		}
+
+		printS();
+
+	}
+	public static void printG() {
+		for(int i=0; i<n; i++) { + System.out.println(Arrays.toString(g[i])); + } + System.out.println(); + } + public static void printV() { + for(int i=0; i<n; i++) { + System.out.println(Arrays.toString(visited[i])); + } + System.out.println(); + } + public static void printS() { + for(int i=0; i<n; i++) { + for(int j=0; j<n; j++) { + if(g[i][j] == 0) System.out.print("."); + else System.out.print(g[i][j]); + } + System.out.println(); + } + } + public static void fillLine(int x, int y) { + // 세로줄 + for(int i=0; i<n; i++) { + visited[i][y] = true; + } + + // 가로줄 + for(int j=0; j<n; j++) { + visited[x][j] = true; + } + + } + public static void fillSquare(int sx, int sy) { + // 3*3 + for(int i=sx; i<sx+3; i++) { + for(int j=sy; j<sy+3; j++) { + visited[i][j] = true; + } + } + } + public static void fillArea(int n) { + for(int i=0; i<n; i += 3) { + for(int j=0; j<n; j += 3) { + for(int x=i; x<i+3; x++) { + for(int y=j; y<j+3; y++) { + if(g[x][y] == n) { + fillLine(x, y); + fillSquare(i, j); + } + if(g[x][y] != 0) { + visited[x][y] = true; + } + } + } + } + } + } + public static boolean checkLine(int n) { + for(int x=0; x<n; x++) { + for(int y=0; y<n; y++) { + if(g[x][y] != n) continue; + + // 세로줄 체크 + int cnt = 0; + for(int i=0; i<n; i++) { + if(g[i][y] == n) cnt++; + } + if(cnt> 1) return false;
+				
+				// 기로즐 체크
+				cnt = 0;
+				for(int j=0; j<n; j++) { + if(g[x][j] == n) cnt++; + } + if(cnt> 1) return false;
+				
+			}
+		}
+		return true;
+	}
+	public static boolean checkBox(int n) {
+		// 유효한 3 * 3 찾기
+		for(int i=0; i<n; i+=3) { + for(int j=0; j<n; j += 3) { + int cnt = 0; + int empty = 0; + for(int x=i; x<i+3; x++) { + for(int y=j; y<j+3; y++) { + if(g[x][y] == n) cnt++; + if(!visited[x][y]) empty++; + } + } + + if(cnt> 1) return false;
+				if(cnt == 0 && empty == 0) return false;
+			}
+		}
+		return true;
+	}
+	public static boolean isValid(int n) {
+		visited = new boolean[N][N];
+		
+		fillArea(n);
+		
+		return checkBox(n) && checkLine(n);
+	}
+	public static int findSpot(int n) {
+		// 유효한 3 * 3 찾기
+		int fCnt = 0;
+		for(int i=0; i<n; i+=3) { + for(int j=0; j<n; j += 3) { + int cnt = 0; + int empty = 0; + int px = -1, py = -1; + for(int x=i; x<i+3; x++) { + for(int y=j; y<j+3; y++) { + if(g[x][y] == n) cnt++; + if(!visited[x][y]) { + empty++; + px = x; + py = y; + } + } + } + // n이없고, 빈곳이 1개이면 => CrossHatching 
+				if(cnt == 0 && empty == 1) {
+					visited[px][py] = true;
+					g[px][py] = n;
+					fillLine(px, py);
+					fCnt++;
+				}
+			}
+		}
+		return fCnt;
+	}
+	public static int crossHatching(int n) {
+		visited = new boolean[N][N];
+		fillArea(n);
+		
+		
+		return findSpot(n);
+	}
+
+}
diff --git "a/CodeTree/2019-2020353円205円204円/JY_355円232円214円354円240円204円355円225円230円353円212円224円_353円271円231円355円225円230円.java" "b/CodeTree/2019-2020353円205円204円/JY_355円232円214円354円240円204円355円225円230円353円212円224円_353円271円231円355円225円230円.java"
new file mode 100644
index 00000000..d4a1cf4c
--- /dev/null
+++ "b/CodeTree/2019-2020353円205円204円/JY_355円232円214円354円240円204円355円225円230円353円212円224円_353円271円231円355円225円230円.java"
@@ -0,0 +1,167 @@
+package day1111;
+
+import java.io.*;
+import java.util.*;
+
+public class JY_회전하는_빙하 {
+	
+	static int n, N, Q;
+	static int[][] g, t;
+	static int[] dx = {0, 0, -1, 1};
+	static int[] dy = {-1, 1, 0, 0};
+	static boolean[][] visited;
+	
+
+	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());
+		Q = Integer.parseInt(st.nextToken());
+		
+		N = (int)Math.pow(2, n);
+		
+		g = new int[N][N];
+		for(int i=0; i<n; i++) { + st = new StringTokenizer(br.readLine()); + for(int j=0; j<n; j++) { + g[i][j] = Integer.parseInt(st.nextToken()); + } + } + + // 회전 레벨 배열 + int[] arr = new int[Q]; + st = new StringTokenizer(br.readLine()); + for(int i=0; i<q; i++) { + arr[i] = Integer.parseInt(st.nextToken()); + } + + + // Q번 회전 + for(int q=0; q<q; q++) { + int r = arr[q]; + + // 레벨 r 회전하기 + if(r> 0) {				
+				int S = (int)Math.pow(2, r);
+				t = new int[N][N];
+				
+				for(int i=0; i<n; i+=S) { + for(int j=0; j<n; j+=S) { + rotate(S, i, j); + } + } + g = t; + } + + // 빙하 감소시키기(회전 마다) + decrease(); + } + + + // 총 빙하의 양 구하기 + int amount = calAmount(); + System.out.println(amount); + + // 최대 빙하 군집 구하기 + int size= 0; + visited = new boolean[N][N]; + for(int i=0; i<n; i++) { + for(int j=0; j<n; j++) { + if(!visited[i][j] && g[i][j] != 0) { + int s = bfs(i, j); + size = Math.max(size, s); + } + } + } + System.out.println(size); + + + + } + public static void print() { + for(int i=0; i<n; i++) { + System.out.println(Arrays.toString(g[i])); + } + System.out.println(); + } + public static void rotate(int S, int sx, int sy) { + int ts = S / 2; + for(int x=sx; x<sx+s; x+=ts) { + for(int y=sy; y<sy+s; y+=ts) { + int ox = x - sx; + int oy = y - sy; + int nx = oy; + int ny = S - ts - ox; + t[nx+sx][ny+sy] = g[x][y]; + int tx = (nx+sx)-x; + int ty = (ny+sy)-y; + for(int i=x; i<x+ts; i++) { + for(int j=y; j<y+ts; j++) { + t[i+tx][j+ty] = g[i][j]; + } + } + } + } + } + public static boolean inRange(int x, int y) { + return x>=0 && x<n && y>=0 && y<n; + } + public static void decrease() { + int[][] t = new int[N][N]; + for(int x=0; x<n; x++) { + for(int y=0; y<n; y++) { + if(g[x][y] == 0) continue; + t[x][y] = g[x][y]; + int cnt = 0; + for(int d=0; d<4; d++) { + int nx = x + dx[d]; + int ny = y + dy[d]; + if(!inRange(nx, ny)) continue; + if(g[nx][ny] == 0) continue; + cnt++; + } + + if(cnt < 3) { + t[x][y]--; + } + } + } + + g = t; + } + public static int calAmount() { + int total = 0; + for(int i=0; i<n; i++) { + for(int j=0; j<n; j++) { + total += g[i][j]; + } + } + + return total; + } + public static int bfs(int x, int y) { + int size = 1; + visited[x][y] = true; + Queue<int[]> q = new LinkedList<strong>();
+		q.add(new int[] {x, y});
+		
+		while(!q.isEmpty()) {
+			int[] now = q.poll();
+			
+			for(int i=0; i<4; i++) { + int nx = now[0] + dx[i]; + int ny = now[1] + dy[i]; + if(!inRange(nx, ny)) continue; + if(visited[nx][ny]) continue; + if(g[nx][ny] == 0) continue; + visited[nx][ny] = true; + q.add(new int[] {nx, ny}); + size++; + } + } + + return size; + } + +} diff --git a/Programmers/Level2/JY_181188.java b/Programmers/Level2/JY_181188.java new file mode 100644 index 00000000..c1e62a20 --- /dev/null +++ b/Programmers/Level2/JY_181188.java @@ -0,0 +1,27 @@ +import java.util.*; + +class Solution { + public int solution(int[][] targets) { + int answer = 0; + + // 시작점 기준으로 정렬 + Arrays.sort(targets, (o1, o2)->o1[0]-o2[0]);
+ 
+ int N = targets.length;
+ int bound = 0; // 경계값
+ for(int i=0; i<n; i++) { + int s = targets[i][0]; + int e = targets[i][1]; + + // 새로운 요격 발사해야 함 + if(s>= bound) {
+ answer++;
+ bound = e;
+ } else {
+ bound = Math.min(bound, e); // 현재 요격으로 가능한 모든 범위의 미사일을 없애야 하므로 범위가 가장 작은 미사일로 저장
+ }
+ }
+ 
+ return answer;
+ }
+}
\ No newline at end of file
diff --git a/Programmers/Level3/JY_150366.java b/Programmers/Level3/JY_150366.java
new file mode 100644
index 00000000..8d0053f8
--- /dev/null
+++ b/Programmers/Level3/JY_150366.java
@@ -0,0 +1,136 @@
+import java.util.*;
+
+class Solution {
+ 
+ static final int N = 51;
+ static String[][] g;
+ static List<integer>[] link;
+ static List<string> aList;
+ 
+ public String[] solution(String[] commands) {
+ aList = new ArrayList<strong>();
+ 
+ g = new String[N][N];
+ for(int i=0; i<n; i++) { + Arrays.fill(g[i], ""); + } + + int M = N*N + N; + link = new ArrayList[M]; + for(int i=0; i<m; i++) { + link[i] = new ArrayList<strong>();
+ }
+ 
+ for(String c: commands) {
+ String[] crr = c.split(" ");
+ 
+ // 1) UPDATE r c value
+ if(crr[0].equals("UPDATE") && crr.length == 4) {
+ insert(Integer.parseInt(crr[1]), Integer.parseInt(crr[2]), crr[3]);
+ } 
+ // 2) UPDATE value1, value2
+ else if (crr[0].equals("UPDATE") && crr.length == 3) {
+ change(crr[1], crr[2]);
+ }
+ // 3) MERGE r1 c1 r2 c2
+ else if(crr[0].equals("MERGE")) {
+ merge(Integer.parseInt(crr[1]), 
+ Integer.parseInt(crr[2]), 
+ Integer.parseInt(crr[3]), 
+ Integer.parseInt(crr[4]));
+ }
+ // 4) UNMERGE r c
+ else if(crr[0].equals("UNMERGE")) {
+ unmerge(Integer.parseInt(crr[1]), Integer.parseInt(crr[2]));
+ }
+ // 5) PRINT r c
+ else if(crr[0].equals("PRINT")) {
+ print(Integer.parseInt(crr[1]), Integer.parseInt(crr[2]));
+ }
+ 
+ }
+ 
+ // System.out.println(aList);
+ String[] answer = new String[aList.size()];
+ for(int i=0; i<alist.size(); i++) { + answer[i] = aList.get(i); + } + + return answer; + } + public static void printG() { + for(int i=0; i<n; i++) { + System.out.println(Arrays.toString(g[i])); + } + System.out.println(); + } + public static void linking(int r, int c, String v, boolean isUnmerge) { + Queue<integer> q = new LinkedList<strong>();
+ boolean[][] visited = new boolean[N][N];
+ 
+ q.add(r*N + c);
+ visited[r][c] = true;
+ 
+ while(!q.isEmpty()) {
+ int now = q.poll();
+ int x = now / N;
+ int y = now % N;
+ g[x][y] = v;
+ for(int next: link[now]) {
+ int nx = next / N;
+ int ny = next % N;
+ if(visited[nx][ny]) continue;
+ 
+ visited[nx][ny] = true;
+ q.add(next);
+ }
+ if(isUnmerge) link[now] = new ArrayList<strong>();
+ }
+ }
+ public static void insert(int r, int c, String v) {
+ g[r][c] = v;
+ 
+ if(link[r*N+c].isEmpty()) return;
+ 
+ linking(r, c, v, false);
+ }
+ public static void change(String v1, String v2) {
+ for(int i=0; i<n; i++) { + for(int j=0; j<n; j++) { + if(g[i][j].equals(v1)) g[i][j] = v2; + } + } + } + public static void merge(int r1, int c1, int r2, int c2) { + if(r1==r2 && c1 == c2) return; + + // (r1, c1)이 비어있고, (r2, c2)만 값을 가지고 있음 : (r2, c2)로 병합 + if(g[r1][c1].length() == 0 && g[r2][c2].length() != 0) { + g[r1][c1] = g[r2][c2]; + linking(r1, c1, g[r1][c1], false); + } + // (r1, c1)로 병합 + else { + g[r2][c2] = g[r1][c1]; + linking(r2, c2, g[r2][c2], false); + } + + // 링크 생성 + int n1 = r1*N + c1; + int n2 = r2*N + c2; + link[n1].add(n2); + link[n2].add(n1); + + } + public static void unmerge(int r, int c) { + String value = g[r][c]; + + linking(r, c, "", true); + + g[r][c] = value; + } + public static void print(int r, int c) { + if(g[r][c].length() == 0) aList.add("EMPTY"); + else aList.add(g[r][c]); + } +} \ No newline at end of file diff --git a/Programmers/Level3/JY_42884.java b/Programmers/Level3/JY_42884.java new file mode 100644 index 00000000..51f00f1d --- /dev/null +++ b/Programmers/Level3/JY_42884.java @@ -0,0 +1,19 @@ +import java.util.*; + +class Solution { + public int solution(int[][] routes) { + int answer = 0; + + Arrays.sort(routes, (o1, o2)->o1[1]-o2[1]);
+ 
+ int last = -30001;
+ for(int [] route: routes) {
+ if(route[0]> last) {
+ answer++;
+ last = route[1];
+ }
+ }
+ 
+ return answer;
+ }
+}
\ No newline at end of file
diff --git "a/SQL/10354円243円274円354円260円250円/JY_Human_Traffic_of_Stadium.sql" "b/SQL/10354円243円274円354円260円250円/JY_Human_Traffic_of_Stadium.sql"
new file mode 100644
index 00000000..eaa3fc89
--- /dev/null
+++ "b/SQL/10354円243円274円354円260円250円/JY_Human_Traffic_of_Stadium.sql"
@@ -0,0 +1,12 @@
+-- 601. Human Traffic of Stadium
+-- https://leetcode.com/problems/human-traffic-of-stadium/
+WITH CTE AS(
+ SELECT *, ID- ROW_NUMBER() OVER() AS ID_DIFF
+ FROM STADIUM
+ WHERE PEOPLE> 99
+)
+
+SELECT ID, VISIT_DATE, PEOPLE
+FROM CTE
+WHERE ID_DIFF IN (SELECT ID_DIFF FROM CTE GROUP BY ID_DIFF HAVING COUNT(ID_DIFF)>= 3)
+ORDER BY VISIT_DATE
\ No newline at end of file
diff --git "a/SQL/10354円243円274円354円260円250円/JY_355円212円271円354円240円225円_355円230円225円354円247円210円354円235円204円_352円260円200円354円247円200円353円212円224円_353円214円200円354円236円245円352円267円240円_354円260円276円352円270円260円.sql" "b/SQL/10354円243円274円354円260円250円/JY_355円212円271円354円240円225円_355円230円225円354円247円210円354円235円204円_352円260円200円354円247円200円353円212円224円_353円214円200円354円236円245円352円267円240円_354円260円276円352円270円260円.sql"
new file mode 100644
index 00000000..d11d2311
--- /dev/null
+++ "b/SQL/10354円243円274円354円260円250円/JY_355円212円271円354円240円225円_355円230円225円354円247円210円354円235円204円_352円260円200円354円247円200円353円212円224円_353円214円200円354円236円245円352円267円240円_354円260円276円352円270円260円.sql"
@@ -0,0 +1,27 @@
+-- https://school.programmers.co.kr/learn/courses/30/lessons/301646
+-- 특정 형질을 가지는 대장균 찾기
+
+-- 방법 1. 비트연산 활용
+-- 1)
+SELECT COUNT(ID) AS COUNT
+FROM ECOLI_DATA
+WHERE (GENOTYPE & 2 != 2) AND (GENOTYPE & 1 = 1 OR GENOTYPE & 4 = 4)
+-- 2)
+SELECT COUNT(ID) AS COUNT
+FROM ECOLI_DATA
+WHERE (GENOTYPE & 2 != 2) AND (GENOTYPE & 5> 5)
+
+-- 방법 2. 2진수로 나타내기 
+SELECT CONV(GENOTYPE, 10, 2) MOD 10 AS ONE,
+ (CONV(GENOTYPE, 10, 2) MOD 100) DIV 10 AS TWO,
+ (CONV(GENOTYPE, 10, 2) MOD 1000) DIV 100 AS THREE
+FROM ECOLI_DATA
+
+SELECT COUNT(*) AS COUNT
+FROM ECOLI_DATA E, 
+ (SELECT CONV(GENOTYPE, 10, 2) MOD 10 AS ONE,
+ (CONV(GENOTYPE, 10, 2) MOD 100) DIV 10 AS TWO,
+ (CONV(GENOTYPE, 10, 2) MOD 1000) DIV 100 AS THREE,
+ ID
+ FROM ECOLI_DATA) G
+WHERE E.ID = G.ID AND G.TWO = 0 AND (G.ONE = 1 OR G.THREE = 1);
\ No newline at end of file
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://patch-diff.githubusercontent.com/raw/GreatAlgorithm-Study/AlgorithmStudy/pull/135.diff">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://patch-diff.githubusercontent.com/raw/GreatAlgorithm-Study/AlgorithmStudy/pull/135.diff" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>