[#13] Add abc204

Author: zeikar

ABC_204_A.cpp

@@ -0,0 +1,9 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	int x, y;
+	cin >> x >> y;
+
+	cout << (3 - (x + y) + 3) % 3 << endl;
+}

ABC_204_B.cpp

@@ -0,0 +1,18 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	int n;
+	long long result = 0;
+	cin >> n;
+
+	for (int i = 0; i < n; i++)
+	{
+		int a;
+		cin >> a;
+
+		result += max(0, a - 10);
+	}
+
+	cout << result << endl;
+}

ABC_204_C.cpp

@@ -0,0 +1,55 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <cstring>
+using namespace std;
+
+vector<int> edges[2001];
+long long res = 0;
+bool visited[2001];
+
+void bfs(int start) {
+	memset(visited, false, sizeof(visited));
+
+	queue<int> que;
+	que.push(start);
+	visited[start] = true;
+
+	while (!que.empty())
+	{
+		int node = que.front();
+		que.pop();
+		++res;
+
+		for (int i = 0; i < edges[node].size(); i++)
+		{
+			if (visited[edges[node][i]])
+			{
+				continue;
+			}
+
+			que.push(edges[node][i]);
+			visited[edges[node][i]] = true;
+		}
+	}
+}
+
+int main() {
+	int n, m;
+
+	cin >> n >> m;
+
+	for (int i = 0; i < m; i++)
+	{
+		int a, b;
+		cin >> a >> b;
+		edges[a].push_back(b);
+	}
+
+	for (int i = 1; i <= n; i++)
+	{
+		bfs(i);
+	}
+
+	cout << res << endl;
+}

ABC_204_D.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+#include <algorithm>
+#include <cstring>
+using namespace std;
+
+int n;
+int t[100];
+int oven[2];
+int dp[100000][100];
+
+int go(int oven0, int oven1, int dishidx) {
+	if (dishidx >= n)
+	{
+		return max(oven0, oven1);
+	}
+	if (dp[oven0][dishidx] != -1)
+	{
+		return dp[oven0][dishidx];
+	}
+
+	// oven0
+	int ret = 987654321;
+	ret = min(ret, go(oven0 + t[dishidx], oven1, dishidx + 1));
+
+	// oven1
+	ret = min(ret, go(oven0, oven1 + t[dishidx], dishidx + 1));
+
+	return dp[oven0][dishidx]= ret;
+}
+
+int main() {
+	cin >> n;
+
+	for (int i = 0; i < n; i++)
+	{
+		cin >> t[i];
+	}
+
+	memset(dp, -1, sizeof(dp));
+	cout << go(0, 0, 0) << endl;
+}