Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 66ee133

Browse files
Merge pull request #209 from GreatAlgorithm-Study/dahye
[15주차] 고다혜
2 parents 6e4a001 + 268a95f commit 66ee133

File tree

8 files changed

+577
-0
lines changed

8 files changed

+577
-0
lines changed

‎BOJ/1000-5000번/DH_1030.java‎

Lines changed: 58 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,58 @@
1+
import java.io.*;
2+
import java.util.*;
3+
4+
/*
5+
* 프렉탈 평면
6+
*/
7+
8+
public class DH_1030 {
9+
static StringBuilder sb = new StringBuilder();
10+
static int s, N, K, R1, R2, C1, C2;
11+
12+
public static void main(String[] args) throws Exception {
13+
14+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
15+
StringTokenizer st = new StringTokenizer(br.readLine());
16+
17+
s = stoi(st); N = stoi(st); K = stoi(st);
18+
R1 = stoi(st); R2 = stoi(st);
19+
C1 = stoi(st); C2 = stoi(st);
20+
21+
// 시간 s일 때, R1행 C1열부터 R2행 C2열까지의 모습을 출력
22+
if(s == 0) sb.append("0");
23+
else {
24+
for(int r = R1; r < R2 + 1; r++) {
25+
for(int c = C1; c < C2 + 1; c++) {
26+
int outer = (int) Math.pow(N, s);
27+
double percent = ((N - K) >> 1) * (1.0) / N;
28+
sb.append(getBlockStatus(r, c, s, N, outer, percent));
29+
}
30+
31+
sb.append("\n");
32+
}
33+
}
34+
35+
System.out.print(sb);
36+
}
37+
38+
static int getBlockStatus(int r, int c, int s, int n, int outer, double percent) {
39+
40+
// 바깥 사각형과 안쪽 사각형 사이 간격 구하기
41+
int interval = (int) (outer * percent);
42+
43+
if(isInCenter(r, c, interval, outer)) return 1;
44+
if(s == 1) return 0;
45+
46+
// 그 다음 확인할 사각형 사이즈
47+
int nextRecSize = (outer / n);
48+
return getBlockStatus(r % nextRecSize, c % nextRecSize, s - 1, n, nextRecSize, percent);
49+
}
50+
51+
static boolean isInCenter(int r, int c, int interval, int outer) {
52+
return r >= interval && r < (outer - interval) && c >= interval && c < (outer - interval);
53+
}
54+
55+
static int stoi(StringTokenizer st) {
56+
return Integer.parseInt(st.nextToken());
57+
}
58+
}

‎BOJ/1000-5000번/DH_1725.java‎

Lines changed: 114 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,114 @@
1+
import java.io.*;
2+
import java.util.*;
3+
4+
/*
5+
* 히스토그램
6+
*/
7+
8+
public class DH_1725 {
9+
10+
// ---------- 스택 사용 코드 ----------
11+
static int[] arr;
12+
public static void main(String[] args) throws Exception {
13+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
14+
int N = Integer.parseInt(br.readLine());
15+
16+
arr = new int[N + 2];
17+
// 양 끝에 0을 넣어줌
18+
for (int i = 1; i < N + 1; i++) arr[i] = Integer.parseInt(br.readLine());
19+
20+
long result = getMaxArea(N);
21+
System.out.println(result);
22+
}
23+
24+
static long getMaxArea(int N) {
25+
long maxArea = 0;
26+
Stack<Integer> stack = new Stack<>();
27+
28+
for (int i = 0; i < arr.length; i++) {
29+
while (!stack.isEmpty() && arr[stack.peek()] > arr[i]) {
30+
int height = arr[stack.pop()];
31+
int width = i - (stack.isEmpty() ? 0 : stack.peek() + 1);
32+
maxArea = Math.max(maxArea, height * width);
33+
}
34+
35+
// push 하려는 막대의 높이가 stack.peek()보다 크다면 stack에 넣어주기
36+
stack.push(i);
37+
}
38+
39+
return maxArea;
40+
}
41+
42+
// ---------- 시간 초과 코드 ----------
43+
static int[] tree, idxTree;
44+
static final int INF = Integer.MAX_VALUE;
45+
static void timeOutCode() throws Exception {
46+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
47+
int N = Integer.parseInt(br.readLine());
48+
49+
arr = new int[N + 2];
50+
51+
int k = (int) Math.ceil(Math.log(N) / Math.log(2)) + 1;
52+
tree = new int[1 << k];
53+
idxTree = new int[1 << k];
54+
55+
for(int i = 1; i < N + 1; i++) arr[i] = Integer.parseInt(br.readLine());
56+
57+
long result = 0;
58+
for(int i = 1; i < N + 1; i++) {
59+
int l = getIdx(0, i - 1, i), r = getIdx(i + 1, N + 1, i);
60+
result = Math.max(result, (r - l - 1) * arr[i]);
61+
}
62+
63+
System.out.println(result);
64+
}
65+
66+
static int getIdx(int s, int e, int c) {
67+
// 인덱스가 s와 e 사이이면서 현재(c)보다 작은 숫자를 가진 원소의 idx 구하기
68+
boolean isLeft = e <= c;
69+
int k = (int) Math.ceil(Math.log(e - s + 1) / Math.log(2)) + 1;
70+
71+
int idx = 1 << (k - 1);
72+
for(int i = s; i < e + 1; i++) {
73+
tree[idx + i - s] = arr[i];
74+
75+
// 인덱스 저장 (idxTree에서 0인 것과 0번 인덱스를 구분하기 위해, 진짜 인덱스에 + 1을 해줌)
76+
idxTree[idx + i - s] = i + 1;
77+
}
78+
79+
if(isLeft) {
80+
81+
for(int i = idx + e + 1 - s; i < idxTree.length; i++) {
82+
tree[i] = tree[i - 1];
83+
idxTree[i] = idxTree[i - 1];
84+
}
85+
}
86+
87+
for(int i = idx - 1; i > 0; i--) {
88+
int a = i * 2;
89+
int b = i * 2 + 1;
90+
91+
if(tree[a] < arr[c] && tree[b] < arr[c]) {
92+
if(isLeft) {
93+
tree[i] = tree[b];
94+
idxTree[i] = idxTree[b];
95+
} else {
96+
tree[i] = tree[a];
97+
idxTree[i] = idxTree[a];
98+
}
99+
} else if(tree[a] < arr[c] && tree[b] >= arr[c]) {
100+
tree[i] = tree[a];
101+
idxTree[i] = idxTree[a];
102+
} else if(tree[a] >= arr[c] && tree[b] < arr[c]) {
103+
tree[i] = tree[b];
104+
idxTree[i] = idxTree[b];
105+
} else {
106+
tree[i] = tree[a];
107+
if(isLeft) idxTree[i] = Math.min(idxTree[a], idxTree[b]);
108+
else idxTree[i] = Math.max(idxTree[a], idxTree[b]);
109+
}
110+
}
111+
112+
return idxTree[1] - 1;
113+
}
114+
}

‎BOJ/1000-5000번/DH_1992.java‎

Lines changed: 52 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,52 @@
1+
import java.io.*;
2+
3+
/*
4+
* 쿼드트리
5+
*/
6+
7+
public class DH_1992 {
8+
static int[][] arr;
9+
public static void main(String[] args) throws Exception {
10+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
11+
12+
int N = Integer.parseInt(br.readLine());
13+
arr = new int[N][N];
14+
15+
for(int r = 0; r < N; r++) {
16+
String s = br.readLine();
17+
18+
for(int c = 0; c < N; c++) {
19+
arr[r][c] = s.charAt(c) - '0';
20+
}
21+
}
22+
23+
int length = N;
24+
25+
String str = func(0, 0, length);
26+
System.out.println(str);
27+
}
28+
29+
static String func(int r, int c, int l) {
30+
String s = "";
31+
32+
int sum = 0;
33+
for(int sr = r; sr < r + l; sr++) {
34+
for(int sc = c; sc < c + l; sc++) {
35+
sum += arr[sr][sc];
36+
}
37+
}
38+
39+
if(sum == 0) s += "0";
40+
else if(sum == l * l) s += "1";
41+
else {
42+
int nl = l >> 1;
43+
s += "(";
44+
s += func(r, c, nl); // 왼쪽 위
45+
s += func(r, c + nl, nl); // 오른쪽 위
46+
s += func(r + nl, c, nl); // 왼쪽 아래
47+
s += func(r + nl, c + nl, nl); // 오른쪽 아래
48+
s += ")";
49+
}
50+
return s;
51+
}
52+
}

‎BOJ/1000-5000번/DH_4803.java‎

Lines changed: 72 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,72 @@
1+
import java.io.*;
2+
import java.util.*;
3+
4+
/*
5+
* 트리
6+
*/
7+
8+
public class DH_4803 {
9+
static boolean[] v;
10+
static ArrayList<Integer> adj[];
11+
12+
public static void main(String[] args) throws Exception {
13+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
14+
StringTokenizer st;
15+
String s = "";
16+
StringBuilder sb = new StringBuilder();
17+
18+
int tc = 1;
19+
while(!(s = br.readLine()).equals("0 0")) {
20+
st = new StringTokenizer(s);
21+
int n = Integer.parseInt(st.nextToken());
22+
int m = Integer.parseInt(st.nextToken());
23+
24+
v = new boolean[n + 1];
25+
adj = new ArrayList[n + 1];
26+
27+
for(int i = 0; i < adj.length; i++) adj[i] = new ArrayList<Integer>();
28+
29+
// 간선 리스트 생성
30+
for(int i = 0; i < m; i++) {
31+
st = new StringTokenizer(br.readLine());
32+
int a = Integer.parseInt(st.nextToken());
33+
int b = Integer.parseInt(st.nextToken());
34+
adj[a].add(b);
35+
adj[b].add(a);
36+
}
37+
38+
// 트리의 개수를 세는 변수
39+
int treeCnt = 0;
40+
41+
for(int i = 1; i < adj.length; i++) {
42+
if(v[i]) continue;
43+
treeCnt += dfs(0, i);
44+
}
45+
46+
sb.append("Case ").append(tc++).append(": ");
47+
if(treeCnt == 0) sb.append("No trees.");
48+
else if(treeCnt == 1) sb.append("There is one tree.");
49+
else sb.append("A forest of ").append(treeCnt).append(" trees.");
50+
sb.append("\n");
51+
}
52+
53+
System.out.print(sb);
54+
}
55+
56+
// 사이클 확인 (사이클이 발생한다면 0, 발생하지 않는다면 1 반환)
57+
// prev: 직전 노드, current: 현재 노드
58+
static int dfs(int prev, int current) {
59+
v[current] = true;
60+
61+
for(int next: adj[current]) {
62+
// 현재 노드를 기준으로 다음 노드로 감
63+
// 양방향 그래프이기 때문에 다음 노드를 갈 때는 직전 노드를 제외한 다음 노드로 가야됨
64+
if(next == prev) continue;
65+
66+
// 이미 방문했던 노드거나, 사이클이 발생한다면 0 반환
67+
if(v[next] || dfs(current, next) == 0) return 0;
68+
}
69+
// 사이클이 발생하지 않는다면 1 반환
70+
return 1;
71+
}
72+
}

‎BOJ/5001-10000번/DH_9372.java‎

Lines changed: 61 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,61 @@
1+
import java.io.*;
2+
import java.util.*;
3+
4+
/*
5+
* 상근이의 여행
6+
*/
7+
8+
public class DH_9372 {
9+
public static void main(String[] args) throws Exception {
10+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
11+
StringTokenizer st;
12+
13+
int T = Integer.parseInt(br.readLine());
14+
15+
Queue<Integer> q = new ArrayDeque<>();
16+
StringBuilder sb = new StringBuilder();
17+
18+
for(int t = 0; t < T; t++) {
19+
st = new StringTokenizer(br.readLine());
20+
21+
int n = Integer.parseInt(st.nextToken());
22+
int m = Integer.parseInt(st.nextToken());
23+
24+
boolean[] v = new boolean[n + 1];
25+
ArrayList<Integer> adj[] = new ArrayList[n + 1];
26+
for(int i = 0; i < adj.length; i++) adj[i] = new ArrayList<Integer>();
27+
28+
for(int i = 0; i < m; i++) {
29+
st = new StringTokenizer(br.readLine());
30+
int a = Integer.parseInt(st.nextToken());
31+
int b = Integer.parseInt(st.nextToken());
32+
33+
adj[a].add(b);
34+
adj[b].add(a);
35+
}
36+
37+
int answer = 0;
38+
39+
for(int i = 1; i < n; i++) {
40+
if(v[i]) continue;
41+
q.add(i);
42+
v[i] = true;
43+
44+
while(!q.isEmpty()) {
45+
int current = q.poll();
46+
47+
for(int next: adj[current]) {
48+
if(v[next]) continue;
49+
answer += 1;
50+
q.add(next);
51+
v[next] = true;
52+
}
53+
}
54+
}
55+
56+
sb.append(answer).append("\n");
57+
}
58+
59+
System.out.println(sb);
60+
}
61+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /