12-yuyu0830

yuyu0830/README.md

@@ -9,5 +9,9 @@
 | 5차시 | 2024.03.29 |  탐색  | [스도쿠](https://www.acmicpc.net/problem/2239)  | - |
 | 6차시 | 2024.04.03 |  자료구조  | [나만 안되는 연애](https://www.acmicpc.net/problem/14621)  | - |
 | 7차시 | 2024.04.04 |  저울  | [저울](https://www.acmicpc.net/problem/2437)  | - |
+| 8차시 | 2024.04.11 |  그리디  | [보석도둑](https://www.acmicpc.net/problem/1202)  | - |
+| 9차시 | 2024.04.12 |  정렬  | [알고리즘 수업 - 버블 정렬 3](https://www.acmicpc.net/problem/23970)  | - |
 | 10차시| 2024.04.29 |  백트래킹  | [비숍](https://www.acmicpc.net/problem/1799)  | - |
+| 11차시| 2024.05.08 |  그리디  | [연료 채우기](https://www.acmicpc.net/problem/1826)  | - |
+| 12차시| 2024.05.13 |  해시  | [두 배열의 합](https://www.acmicpc.net/problem/2143)  | - |
 ---

yuyu0830/해시/2143.cpp

@@ -0,0 +1,54 @@
+#include <iostream>
+#include <unordered_map>
+#include <vector>
+
+using namespace std;
+
+unordered_map<int, long long int> m[2];
+vector<int> v[2];
+
+int main() {
+    int n; cin >> n;
+
+    for (int i = 0; i < 2; i++) {
+        int t; cin >> t;
+        int sum = 0;
+
+        // initialize value
+        v[i].push_back(0);
+
+        // save prefix sum
+        while (t--) {
+            int a; cin >> a;
+            sum += a;
+            v[i].push_back(sum);
+        }
+    }
+
+    for (int i = 0; i < 2; i++) {
+        int len = v[i].size();
+
+        // save all case of sub set
+        for (int x = 0; x < len; x++) {
+            for (int y = x + 1; y < len; y++) {
+                int tmp = v[i][y] - v[i][x];
+
+                // if exist
+                if (m[i].find(tmp)!= m[i].end()) 
+                    m[i][tmp] = m[i][tmp] + 1;
+
+                else 
+                    m[i].insert(make_pair(tmp, 1));
+
+            }
+        }
+    }
+
+    long long int ans = 0;
+
+    // count case that can make 'T'
+    for (auto p : m[1]) 
+        if (m[0].find(n - p.first) != m[0].end()) ans += m[0][n - p.first] * p.second;
+
+    printf("%lld\n", ans);
+}