DP Hard (1)

Author: seunghyukcho

Algospot/MORSE.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <algorithm>
+#include <string>
+
+using namespace std;
+
+typedef long long ll;
+
+ll bino[202][202];
+int c, n, m, k;
+
+ll binomial(int a, int b)
+{
+	ll& ret = bino[a][b];
+
+	if(ret)
+		return ret;
+	else if(a == b || b == 0)
+		return ret = 1;
+	else
+		return ret = binomial(a - 1, b - 1) + binomial(a - 1, b);
+}
+
+void dp(int a, int b, int skip, string& ans)
+{
+	ll left = binomial(a + b - 1, a - 1);
+	// cout << ans << ' ' << skip << ' ' << left << '\n';
+	if(a == 0 && b == 0)
+		return;
+
+	if(a > 0 && skip <= left)
+	{
+		ans += '-';
+		dp(a - 1, b, skip, ans);
+	}
+	else
+	{
+		ans += 'o';
+		dp(a, b - 1, skip - left, ans);
+	}
+}
+
+int main()
+{
+	for(cin >> c; c > 0; c--)
+	{
+		cin >> n >> m >> k;
+		string ans = "";
+
+		dp(n, m, k, ans);
+		cout << ans << '\n';
+	}
+}

Algospot/a.out

@@ -1,5 +1,4 @@
-4
-w
-xbwwb
-xbwxwbbwb
-xxwwwbxwxwbbbwwxxxwwbbbwwwwbb
+3
+2 2 4
+4 8 13
+100 100 1

Algospot/input

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int n, v, w, k, ans;
+int cache[100002];
+
+int main()
+{
+	cin >> n >> k;
+	for(int j = 1; j <= k; j++)
+		cache[j] = -1;
+
+	for(int i = 1; i <= n; i++)
+	{
+		cin >> w >> v;
+
+		for(int j = k; j >= 0; j--)
+		{
+			int& here = cache[j];
+
+			if(j - w >= 0 && cache[j - w] != -1)
+			{
+				here = max(here, cache[j - w] + v);
+			}
+
+			ans = max(ans, cache[j]);
+		}
+	}
+
+	cout << ans << '\n';
+}

baekjoon/12865.cpp

@@ -1,5 +1,5 @@
-4
-0 0
-10 10
-0 10
-10 0
+4 7
+6 13
+4 8
+3 6
+5 12