13-g0rnn

g0rnn/DFS,BFS/12-g0rnn.cpp

@@ -0,0 +1,81 @@
+//
+// Created by 김균호 on 2025. 1. 2..
+//
+#include <iostream>
+#include <queue>
+#include <vector>
+using namespace std;
+
+#define FRIEND 1
+
+int n;
+int club[55][55];
+vector<int> president;
+// 첫번째 인자 기준
+//priority_queue<pair<int, int>, vector<pair<int, int> >, greater<> > candidate;
+
+int bfs(int a) {
+	queue<int> q;
+	vector<bool> visited(n + 1, false);
+	int point = -1;
+	q.push(a);
+	visited[a] = true;
+
+	while (!q.empty()) {
+		size_t size = q.size();
+
+		for (int _ = 0; _ < size; _++) {
+			int k = q.front();
+			q.pop();
+			for (int i = 1; i <= n; i++) {
+				if (k != i && !visited[i] && club[k][i] == FRIEND) {
+					visited[i] = true;
+					q.push(i);
+				}
+			}
+		}
+		point++;
+	}
+	return point;
+}
+
+int main() {
+	cin >> n;
+	int a, b;
+	while (true) {
+		cin >> a >> b;
+		if (a == -1 && b == -1) break;
+		club[a][b] = FRIEND;
+		club[b][a] = FRIEND;
+	}
+	/*
+	for (int i = 1; i <= n; i++) {
+		int score = bfs(i);
+		candidate.emplace(score,i);
+	}
+
+	auto [point, who] = candidate.top();
+	candidate.pop();
+	president.push_back(who);
+
+	while (candidate.top().first == point) {
+		president.push_back(candidate.top().second);
+		candidate.pop();
+	}*/
+
+	int min_point = INT_MAX;
+	for (int i = 1; i <= n; i++) {
+		int score = bfs(i);
+		if (score < min_point) {
+			min_point = score;
+			president.clear();
+			president.push_back(i);
+		} else if (score == min_point) {
+			president.push_back(i);
+		}
+	}
+
+	cout << min_point << ' ' << president.size() << '\n';
+	for (int i: president) cout << i << ' ';
+	return 0;
+}

g0rnn/README.md

@@ -1,15 +1,20 @@
 ## ✏️ 기록
 
-| 차시  |    날짜    |  문제유형  |                                     링크                                      |                        풀이                         |
-| :---: | :--------: | :--------: | :---------------------------------------------------------------------------: | :-------------------------------------------------: |
-| 1차시 | 2024.10.01 |    구현    | [추억 점수](https://school.programmers.co.kr/learn/courses/30/lessons/176963) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/35  |
-| 2차시 | 2024.10.03 |    트리    |   [LCA2](https://school.programmers.co.kr/learn/courses/30/lessons/176963)    | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/7  |
-| 3차시 | 2024.10.04 |   문자열   |             [잃어버린 괄호](https://www.acmicpc.net/problem/1541)             | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/9  |
-| 4차시 | 2024.10.11 | 브루트포스 |              [영화감독 숌](https://www.acmicpc.net/problem/1436)              | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/15 |
-| 5차시 | 2024.11.01 |  BFS/DFS   |                [연구소](https://www.acmicpc.net/problem/14502)                | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/17 |
-| 6차시 | 2024.11.06 |    구현    |                [통계학](https://www.acmicpc.net/problem/2108)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/23 |
-| 7차시 | 2024.11.25 |    구현    |            [팰린드롬 만들기](https://www.acmicpc.net/problem/1213)            | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/31 |
-| 8차시 | 2024.11.29 | 문자열 | [잠수함식별](https://www.acmicpc.net/problem/2671) | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/35 |
-| 9차시 | 2024.12.04 | 그리디 | [A->B](https://www.acmicpc.net/problem/16953) | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/39 |
+|  차시  |     날짜     |  문제유형   |                                    링크                                     |                         풀이                          |
+|:----:|:----------:|:-------:|:-------------------------------------------------------------------------:|:---------------------------------------------------:|
+| 1차시  | 2024.10.01 |   구현    | [추억 점수](https://school.programmers.co.kr/learn/courses/30/lessons/176963) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/35  |
+| 2차시  | 2024.10.03 |   트리    | [LCA2](https://school.programmers.co.kr/learn/courses/30/lessons/176963)  | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/7  |
+| 3차시  | 2024.10.04 |   문자열   |              [잃어버린 괄호](https://www.acmicpc.net/problem/1541)              | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/9  |
+| 4차시  | 2024.10.11 |  브루트포스  |              [영화감독 숌](https://www.acmicpc.net/problem/1436)               | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/15 |
+| 5차시  | 2024.11.01 | BFS/DFS |               [연구소](https://www.acmicpc.net/problem/14502)                | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/17 |
+| 6차시  | 2024.11.06 |   구현    |                [통계학](https://www.acmicpc.net/problem/2108)                | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/23 |
+| 7차시  | 2024.11.25 |   구현    |             [팰린드롬 만들기](https://www.acmicpc.net/problem/1213)              | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/31 |
+| 8차시  | 2024.11.29 |   문자열   |               [잠수함식별](https://www.acmicpc.net/problem/2671)               | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/35 |
+| 9차시  | 2024.12.04 |   그리디   |               [A->B](https://www.acmicpc.net/problem/16953)               | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/39 |
+| 10차시 | 2024.12.20 |   그래프   |                [결혼식](https://www.acmicpc.net/problem/5567)                | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/40 |
+| 11차시 | 2024.12.30 |   dp    |               [기타리스트](https://www.acmicpc.net/problem/1495)               | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/49 |
+| 12차시 | 2025.01.02 |   bfs   |               [회장뽑기](https://www.acmicpc.net/problem/2660)                | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/50 |
+| 13차시 | 2025.01.05 |  백트래킹   |             [스타트와 링크](https://www.acmicpc.net/problem/14889)              | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/52 |
+
 
 ---

g0rnn/backtracking/13-g0rnn.cpp

@@ -0,0 +1,50 @@
+//
+// Created by 김균호 on 2025. 1. 5..
+//
+#include <iostream>
+#include <climits>
+#include <vector>
+using namespace std;
+
+int n, minDiff = INT_MAX;
+int s[25][25];
+vector<bool> visited;
+
+void sumPoint() {
+	int start = 0, link = 0;
+	for (int i = 1; i <= n; i++) {
+		for (int j = i + 1; j <= n; j++) {
+			if (visited[i] && visited[j]) start += s[i][j] + s[j][i];
+			else if (!visited[i] && !visited[j]) link += s[i][j] + s[j][i];
+		}
+	}
+	minDiff = min(minDiff, abs(start - link));
+}
+
+// 임의의 n/2개를 뽑음
+void dfs(int cur, int cnt) {
+	if (cnt == n / 2) {
+		sumPoint();
+		return;
+	}
+	for (int i = cur; i <= n; i++) {
+		if (!visited[i]) {
+			visited[i] = true;
+			dfs(i + 1, cnt + 1);
+			visited[i] = false;
+		}
+	}
+}
+
+int main() {
+	cin >> n;
+	for (int y = 1; y <= n; y++) {
+		for (int x = 1; x <= n; x++) {
+			cin >> s[y][x];
+		}
+	}
+	visited = vector<bool>(n + 1, false);
+	dfs(1, 0);
+	cout << minDiff;
+	return 0;
+}

g0rnn/dp/11-g0rnn.cpp

@@ -0,0 +1,38 @@
+//
+// Created by 김균호 on 2024. 12. 31..
+//
+// 1. 조절한 볼륨이 0보다 작거나 max보다 크면 연주할 수 없다 -> -1
+// 2. 범위 내의 최댓값을 구하라
+
+#include <iostream>
+using namespace std;
+
+int n, s, m;
+int v[55];
+bool dp[55][1005];
+int ans = -1;
+
+int main() {
+	cin >> n >> s >> m;
+	for (int i = 1; i <= n; i++)
+		cin >> v[i];
+
+	if (s + v[1] <= m) dp[1][s + v[1]] = true;
+	if (s - v[1] >= 0) dp[1][s - v[1]] = true;
+
+	for (int i = 2; i <= n; i++) {
+		for (int j = 0; j <= m; j++) {
+			if (!dp[i - 1][j]) continue;
+			if (j + v[i] <= m) dp[i][j + v[i]] = true;
+			if (j - v[i] >= 0) dp[i][j - v[i]] = true;
+		}
+	}
+	for (int i = m; i >= 0; i--) {
+		if (dp[n][i]) {
+			ans = i;
+			break;
+		}
+	}
+	cout << ans;
+	return 0;
+}