[BOJ 14889] 스타트와 링크

src/week5/BOJ14889/BOJ14889_V1.cpp

@@ -0,0 +1,60 @@
+#include <bits/stdc++.h>
+using namespace std;
+int N;
+int input_arr[20][20];
+int ret = INT_MAX;
+int check(int team_bit) {
+    int a_sum=0;
+    int b_sum=0;
+    for (int i=0; i<N; i++) {
+        if (team_bit & (1<<i)) {
+            for (int j=0; j<N; j++) {
+                if(team_bit & (1<<j)) a_sum += input_arr[i][j];
+            }
+        } else {
+            for (int j=0; j<N; j++) {
+                if(!(team_bit & (1<<j))) b_sum += input_arr[i][j];
+            }
+        }
+    }
+
+    return abs(b_sum - a_sum);
+}
+void combi(int st, vector<int> b) {
+    if (b.size() == N/2) {
+        int team_bit = 0;
+        for (int num : b) {
+            team_bit |= (1 << num);
+        }
+
+        int diff = check(team_bit);
+        ret = min(ret, diff);
+
+        return;
+    }
+
+    for (int i=st+1; i<N; i++) {
+        b.push_back(i);
+        combi(i,b);
+        b.pop_back();
+    }
+}
+int main() {
+
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+
+    cin >> N;
+    for (int i=0; i<N; i++) {
+        for (int j=0; j<N; j++) {
+            cin >> input_arr[i][j];
+        }
+    }
+    vector<int> b;
+    combi(-1,b);
+    cout << ret;
+
+
+    return 0;
+}

src/week5/BOJ14889/BOJ14889_V2.cpp

@@ -0,0 +1,44 @@
+#include <bits/stdc++.h>
+using namespace std;
+int N;
+int input_arr[20][20];
+int ret = INT_MAX;
+int check(vector<int> a, vector<int> b) {
+    int a_sum=0;
+    int b_sum=0;
+
+    for (int i=0; i<N/2; i++) {
+        for (int j=0; j<N/2; j++) {
+            a_sum += input_arr[a[i]][a[j]];
+            b_sum += input_arr[b[i]][b[j]];
+        }
+    }
+
+    return abs(b_sum - a_sum);
+}
+int main() {
+
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+
+    cin >> N;
+    for (int i=0; i<N; i++) {
+        for (int j=0; j<N; j++) {
+            cin >> input_arr[i][j];
+        }
+    }
+    for (int i=0; i<(1<<N); i++) {
+        if(__builtin_popcount(i) != N / 2) continue;
+        vector<int> a,b;
+        for (int j=0; j<N; j++) {
+            if (i & (1<<j)) a.push_back(j);
+            else b.push_back(j);
+        }
+        ret = min(ret, check(a,b));
+    }
+    cout << ret;
+
+
+    return 0;
+}