240201-240207 : MinjuCho

Baekjoon/동적 계획법2/MinjuCho/11049.cpp

@@ -0,0 +1,27 @@
+#include<stdio.h>
+#include <algorithm>
+const int INF = 0x6f6f6f6f;
+int dp[501][501];
+int main(void)
+{
+	int N;
+	scanf("%d", &N);
+	int matrix[501][2];
+	for (int i = 1; i <= N; ++i)
+	{
+		scanf("%d %d", &matrix[i][0], &matrix[i][1]);
+	}
+	for (int i = 1; i <= N-1; ++i)
+	{
+		for (int j = 1; i + j <= N; ++j)
+		{
+			dp[j][i+j] = INF;
+			for (int k = j; k <= i + j; ++k)
+			{
+				dp[j][i + j] = std::min(dp[j][i + j], dp[j][k] + dp[k + 1][i + j]
+													+ matrix[j][0] * matrix[k][1] * matrix[i + j][1]);
+			}
+		}
+	}
+	printf("%d", dp[1][N]);
+}

Baekjoon/동적 계획법2/MinjuCho/11049.py

@@ -0,0 +1,16 @@
+import sys
+input = sys.stdin.readline
+N = int(input().strip())
+matrix = [[]]
+for i in range(1, N+1):
+    matrix.append(list(map(int, input().strip().split())))
+dp=[[0 for _ in range(N+1)] for __ in range(N+1)]
+INF = int(1e9)
+for i in range(1, N):
+    j = 1
+    while i+j <= N:
+        dp[j][i+j] = INF
+        for k in range(j, i+j):
+            dp[j][i+j] = min(dp[j][i+j], dp[j][k] + dp[k+1][i+j] + matrix[j][0] * matrix[k][1] * matrix[i+j][1])
+        j+=1
+print(dp[1][N])

Baekjoon/동적 계획법2/MinjuCho/7579.cpp

@@ -0,0 +1,41 @@
+#include <stdio.h>
+#include <vector>
+#include <algorithm>
+using namespace std;
+int main(void)
+{
+	int N, M, sum = 0;
+	scanf("%d %d", &N, &M);
+
+	vector<int> m(N+1), c(N+1);
+	for (int i = 1; i <= N; ++i)
+	{
+		scanf("%d", &m[i]);
+	}
+	for (int i = 1; i <= N; ++i)
+	{
+		scanf("%d", &c[i]);
+		sum += c[i];
+	}
+
+	vector<vector<int>> dp(N + 1, vector<int>(sum + 1, 0));
+	for (int i = 1; i <= N; ++i)
+	{
+		for (int j = 0; j <= sum; ++j)
+		{
+			if (j - c[i] >= 0)
+			{
+				dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - c[i]] + m[i]);
+			}
+			dp[i][j] = max(dp[i - 1][j], dp[i][j]);
+		}
+	}
+	for (int j = 0; j <= sum; ++j)
+	{
+		if (dp[N][j] >= M)
+		{
+			printf("%d", j);
+			break;
+		}
+	}
+}

Baekjoon/동적 계획법2/MinjuCho/7579.py

@@ -0,0 +1,16 @@
+import sys
+input = sys.stdin.readline
+N, M = map(int, input().strip().split())
+m = list(map(int, input().strip().split()))
+c = list(map(int, input().strip().split()))
+s = sum(c)
+dp = [[0 for _ in range(s+1)] for __ in range(N)]
+for i in range(N):
+    for j in range(s+1):
+        if j - c[i] >= 0:
+            dp[i][j] = max(dp[i-1][j], dp[i-1][j-c[i]] + m[i])
+        dp[i][j] = max(dp[i][j], dp[i-1][j])
+for j in range(s+1):
+    if dp[N-1][j] >= M:
+        print(j)
+        break

Programmers/2024 KAKAO WINTER INTERSHIP/MinjuCho/kakao_1.cpp

@@ -0,0 +1,72 @@
+#include <string>
+#include <vector>
+#include <sstream>
+#include <map>
+#include <algorithm>
+
+using namespace std;
+
+int solution(vector<string> friends, vector<string> gifts) {
+    map<string, map<string, int>> info;
+    map<string, int> points;
+    for (auto elem : gifts)
+    {
+        stringstream ss(elem);
+        ss.str(elem);
+        string give, receive;
+        ss >> give;
+        ss >> receive;
+        ++points[give];
+        --points[receive];
+        ++info[give][receive];
+    }
+    map<string, int> result;
+    for (int i = 0; i < friends.size(); ++i)
+    {
+        string frnd = friends[i];
+        for (int j = i + 1; j < friends.size(); ++j)
+        {
+            string with = friends[j];
+            if (frnd == with)
+            {
+                continue;
+            }
+            if (info[frnd][with] > info[with][frnd])
+            {
+                ++result[frnd];
+            }
+            else if (info[frnd][with] < info[with][frnd])
+            {
+                ++result[with];
+            }
+            else
+            {
+                if (points[frnd] > points[with])
+                {
+                    ++result[frnd];
+                }
+                else if (points[frnd] < points[with])
+                {
+                    ++result[with];
+                }
+            }
+        }
+    }
+    int answer = 0;
+    for (auto elem : result)
+    {
+        if (elem.second > answer)
+        {
+            answer = elem.second;
+        }
+    }
+    return answer;
+}
+
+int main(void)
+{
+    vector<string> friends = { "muzi", "ryan", "frodo", "neo" },
+                    gifts = { "muzi frodo", "muzi frodo", "ryan muzi", "ryan muzi", "ryan muzi",
+                                "frodo muzi", "frodo ryan", "neo muzi" };
+    printf("%d", solution(friends, gifts));
+}