From 44d82e5916667a153cd7cbd510caa7de4be9ab69 Mon Sep 17 00:00:00 2001
From: sh0723 <pshpark12345@naver.com>
Date: Tue, 30 Jun 2026 12:28:31 +0900
Subject: [PATCH] =?UTF-8?q?17471=20:=20=EA=B2=8C=EB=A6=AC=EB=A7=A8?=
 =?UTF-8?q?=EB=8D=94=EB=A7=81=20solve?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/week4/BOJ17471/BOJ17471_V1.cpp | 93 ++++++++++++++++++++++++++++++
 1 file changed, 93 insertions(+)
 create mode 100644 src/week4/BOJ17471/BOJ17471_V1.cpp

diff --git a/src/week4/BOJ17471/BOJ17471_V1.cpp b/src/week4/BOJ17471/BOJ17471_V1.cpp
new file mode 100644
index 0000000..6b29d05
--- /dev/null
+++ b/src/week4/BOJ17471/BOJ17471_V1.cpp
@@ -0,0 +1,93 @@
+#include <bits/stdc++.h>
+using namespace std;
+int N;
+int ret = INT_MAX;
+vector<vector<int>> ll;
+int person[11];
+int visited[11];
+bool selected[11];
+void traversal(int i, bool group) {
+    for (int next : ll[i]) {
+        if (visited[next] || selected[next] != group) continue;
+        visited[next] = 1;
+        traversal(next, group);
+    }
+}
+bool isConnected(bool group) {
+    memset(visited, 0, sizeof(visited));
+    int start = -1;
+    for (int i = 1; i <= N; i++) {
+        if (selected[i] == group) {
+            start = i;
+            break;
+        }
+    }
+    if (start == -1) return false;
+    visited[start] = 1;
+    traversal(start, group);
+
+    for (int i = 1; i <= N; i++) {
+        if (selected[i] == group && !visited[i]) return false;
+    }
+
+    return true;
+}
+int calculate(int bit_num) {
+    memset(selected, false, sizeof(selected));
+    int diff = -1;
+    int a_sum = 0;
+    int b_sum = 0;
+    for (int j = 0; j < N; j++) {
+        if (bit_num & (1 << j)) {
+            selected[j+1] = true;
+        }
+    }
+
+    if (!isConnected(true)) return -1;
+    if (!isConnected(false)) return -1;
+
+    for (int i = 1; i <= N; i++) {
+        if (selected[i]) a_sum += person[i];
+        else b_sum += person[i];
+    }
+
+    return abs(a_sum - b_sum);
+}
+
+int main() {
+
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+
+    cin >> N;
+    ll.resize(N+1);
+    for (int i = 1; i <= N; i++) {
+        cin >> person[i];
+    }
+
+    for (int i = 1; i <= N; i++) {
+        int num;
+        cin >> num;
+        for (int j = 0; j < num; j++) {
+            int temp;
+            cin >> temp;
+            ll[i].push_back(temp);
+        }
+    }
+
+    for (int i=1; i<(1 << N); i++) {
+
+        int diff = calculate(i);
+        if (diff != -1) {
+            ret = min(ret, diff);
+        }
+    }
+
+    if (ret == INT_MAX) {
+        cout << -1 << '\n';
+    } else
+        cout << ret << '\n';
+
+    return 0;
+}
\ No newline at end of file