atcoder beginner round 119

Author: seunghyukcho

atcoder/beginner/119/A.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+int main()
+{
+	string s;
+
+	getline(cin, s, '/');
+	int year = stoi(s);
+
+	getline(cin, s, '/');
+	int month = stoi(s);
+
+	getline(cin, s);
+	int day = stoi(s);
+
+	if(year > 2019) cout << "TBD\n";
+	else if(year < 2019) cout << "Heisei\n";
+	else
+	{
+		if(month > 4) cout << "TBD\n";
+		else if(month < 4) cout << "Heisei\n";
+		else
+		{
+			if(day > 30) cout << "TBD\n";
+			else cout << "Heisei\n";
+		}
+	}
+}

atcoder/beginner/119/B.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+double total;
+string s;
+int n;
+
+int main()
+{
+	cin >> n;
+	for(int i = 0; i < n; i++)
+	{
+		double val;
+		cin >> val >> s;
+		if(s == "JPY") total += val;
+		else total += val * 380000.0;
+	}
+
+	printf("%.6f\n", total);
+}

atcoder/beginner/119/C.cpp

@@ -0,0 +1,60 @@
+#include <iostream>
+#include <cmath>
+#include <vector>
+
+using namespace std;
+
+int visited[10];
+int ans, n, num[10], check[4];
+
+int checkValue()
+{
+	int ret = 0;
+	int cnt[4] = { 0, 0, 0, 0 };
+	int arr[4] = { 0, 0, 0, 0 };
+	for(int i = 0; i < n; i++)
+	{
+		arr[visited[i]] += num[i];
+		cnt[visited[i]]++;
+	}
+
+	for(int i = 1; i < 4; i++)
+	{
+		if(arr[i] == 0) return 100000;
+		ret += abs(arr[i] - check[i]) + 10 * (cnt[i] - 1);
+	}
+
+	return ret;
+}
+
+void dfs(int depth)
+{
+	if(depth == n)
+	{
+		int val = checkValue();
+		
+		ans = min(ans, val);
+	}
+	else
+	{
+		visited[depth] = 0;
+		dfs(depth + 1);
+		visited[depth] = 1;
+		dfs(depth + 1);
+		visited[depth] = 2;
+		dfs(depth + 1);
+		visited[depth] = 3;
+		dfs(depth + 1);
+	}
+}
+
+int main()
+{
+	cin >> n;
+	for(int i = 1; i <= 3; i++) cin >> check[i];
+	for(int i = 0; i < n; i++) cin >> num[i];
+
+	ans = 100000;
+	dfs(0);
+	cout << ans << '\n';
+}

atcoder/beginner/119/D.cpp

@@ -0,0 +1,83 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+typedef long long ll;
+
+int a, b, q;
+ll s[100002], t[100002], x;
+
+ll binary1(int start, int end, ll find, ll arr[])
+{
+	while(start + 1 < end)
+	{
+		int mid = (start + end) / 2;
+		ll val = arr[mid];
+
+		if(val > find) end = mid - 1;
+		else start = mid;
+	}
+
+	if(arr[end] <= find) return end;
+	else return start;
+}
+
+ll binary2(int start, int end, ll find, ll arr[])
+{
+	while(start < end)
+	{
+		int mid = (start + end) / 2;
+		ll val = arr[mid];
+
+		if(val < find) start = mid + 1;
+		else end = mid;
+	}
+
+	return end;
+}
+
+ll min(ll l1, ll l2)
+{
+	return l1 < l2 ? l1 : l2;
+}
+
+ll max(ll l1, ll l2)
+{
+	return l1 < l2 ? l2 : l1;
+}
+
+int main()
+{
+	cin.tie(NULL);
+
+	cin >> a >> b >> q;
+	for(int i = 0; i < a; i++) cin >> s[i];
+	for(int i = 0; i < b; i++) cin >> t[i];
+
+	for(int i = 0; i < q; i++)
+	{
+		ll ans;
+		cin >> x;
+
+		ll sl = s[binary1(0, a - 1, x, s)], sr = s[binary2(0, a - 1, x, s)];
+		ll tl = t[binary1(0, b - 1, x, t)], tr = t[binary2(0, b - 1, x, t)];
+
+		ans = abs(sl - x) + abs(sl - tr);
+		ans = min(ans, abs(tr - x) + abs(sl - tr));
+		ans = min(ans, abs(sr - x) + abs(sr - tl));
+		ans = min(ans, abs(tl - x) + abs(sr - tl));
+		
+		if(sl <= x && tl <= x)
+		{
+			ans = min(ans, abs(min(sl, tl) - x));
+		}
+
+		if(x <= sr && x <= tr)
+		{
+			ans = min(ans, abs(max(sr, tr) - x));
+		}
+
+		cout << ans << '\n';
+	}
+}