Add contest codes

Author: zeikar

ABC_217_A.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+#include <string>
+using namespace std;
+
+int main() {
+	string s, t;
+	cin >> s >> t;
+
+	if (s < t)
+	{
+		cout << "Yes" << endl;
+	}
+	else
+	{
+		cout << "No" << endl;
+	}
+}

ABC_217_B.cpp

@@ -0,0 +1,28 @@
+#include <iostream>
+#include <string>
+using namespace std;
+
+int main() {
+	string a[3];
+	cin >> a[0] >> a[1] >> a[2];
+
+	string as[4] = {"ABC", "ARC", "AGC", "AHC"};
+
+	for (int i = 0; i < 4; i++)
+	{
+		bool found = false;
+		for (int j = 0; j < 3; j++)
+		{
+			if (as[i] == a[j])
+			{
+				found = true;
+				break;
+			}
+		}
+
+		if (!found)
+		{
+			cout << as[i] << endl;
+		}
+	}
+}

ABC_217_C.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <string>
+using namespace std;
+
+int a[200001];
+int b[200001];
+
+int main() {
+	int n;
+	cin >> n;
+	for (int i = 1; i <= n; i++)
+	{
+		cin >> a[i];
+	}
+
+	for (int i = 1; i <= n; i++)
+	{
+		b[a[i]] = i;
+	}
+
+	for (int i = 1; i <= n; i++)
+	{
+		cout << b[i] << ' ';
+	}
+	cout << endl;
+}

ABC_217_D.cpp

@@ -0,0 +1,44 @@
+#include <iostream>
+#include <map>
+using namespace std;
+
+map<int, int>::const_iterator find(const map<int, int>& items, int value)
+{
+	auto itlow = items.lower_bound(value);
+
+	if (itlow->first == value)
+		return itlow;
+	else if (itlow != items.cbegin())
+		return --itlow;
+	else
+		return items.cend();
+}
+
+int main() {
+	int l, q;
+
+	cin >> l >> q;
+
+	map<int, int> m;
+
+	m[1] = 0;
+	m[l] = l;
+
+	while (q--)
+	{
+		int c, x;
+		cin >> c >> x;
+
+		if (c == 1)
+		{
+			m[x] = x;
+		}
+		else
+		{
+			auto rit = m.lower_bound(x);
+			auto lit = find(m, x);
+
+			cout << (rit->second) - (lit->second) << endl;
+		}
+	}
+}

ABC_217_E.cpp

@@ -0,0 +1,47 @@
+#include <iostream>
+#include <queue>
+#include <vector>
+#include <functional>
+using namespace std;
+
+int main() {
+	int q;
+	cin >> q;
+
+	priority_queue <int, vector<int>, greater<int> > pq;
+	queue<int> buffer;
+
+	while (q--)
+	{
+		int a;
+		cin >> a;
+
+		if (a == 1)
+		{
+			int x;
+			cin >> x;
+			buffer.push(x);
+		}
+		else if (a == 2)
+		{
+			if (pq.empty())
+			{
+				cout << buffer.front() << endl;
+				buffer.pop();
+			}
+			else
+			{
+				cout << pq.top() << endl;
+				pq.pop();
+			}
+		}
+		else
+		{
+			while (!buffer.empty())
+			{
+				pq.push(buffer.front());
+				buffer.pop();
+			}
+		}
+	}
+}

ABC_221_A.cpp

@@ -0,0 +1,12 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+using namespace std;
+
+int main() {
+	int a, b;
+
+	cin >> a >> b;
+
+	cout << (1 << (5 * (a- b))) << endl;
+}

ABC_221_B.cpp

@@ -0,0 +1,44 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+using namespace std;
+
+int main() {
+	string s, t;
+	cin >> s >> t;
+
+	string ans = "Yes";
+
+	int cnt = 0;
+
+	for (int i = 0; i < s.length(); i++)
+	{
+		if (s[i] == t[i])
+		{
+			continue;
+		}
+
+		if (cnt == 1)
+		{
+			ans = "No";
+			break;
+		}
+
+		if (i + 1 < s.length())
+		{
+			cnt = 1;
+
+			char temp = t[i];
+			t[i] = t[i + 1];
+			t[i + 1] = temp;
+			i--;
+		}
+		else
+		{
+			ans = "No";
+			break;
+		}
+	}
+
+	cout << ans << endl;
+}

ABC_221_C.cpp

@@ -0,0 +1,54 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+#include <functional>
+using namespace std;
+
+int strtoi(string s, int idx, int cnt) {
+	int ret = 0;
+	for (int i = 0; i < cnt; i++)
+	{
+		ret *= 10;
+		ret += s[idx + i] - '0';
+	}
+	return ret;
+}
+
+int main() {
+	string n;
+
+	cin >> n;
+
+	sort(n.begin(), n.end());
+
+	int ans = 0;
+	
+	do {
+
+		for (int k = 0; k < n.length(); k++)
+		{
+			int a = 0, b = 0;
+
+			for (int i = 0; i < n.length(); i++)
+			{
+				if (i < k)
+				{
+					a *= 10;
+					a += n[i] - '0';
+				}
+				else
+				{
+					b *= 10;
+					b += n[i] - '0';
+				}
+			}
+
+			ans = max(ans, a * b);
+		}
+
+
+	} while (std::next_permutation(n.begin(), n.end()));
+
+
+	cout << ans << endl;
+}

ABC_221_D.cpp

@@ -0,0 +1,62 @@
+#include <iostream>
+#include <algorithm>
+#include <map>
+#include <vector>
+using namespace std;
+
+int a[200000];
+int b[200000];
+int results[200001];
+bool loggedin[200001];
+
+int main() {
+	int n;
+
+	cin >> n;
+
+	// 1 : µé¾î¿È -1: ³ª°¨
+	map<int, vector<int> > events;
+
+	for (int i = 0; i < n; i++)
+	{
+		cin >> a[i] >> b[i];
+
+		events[a[i]].push_back(i + 1);
+		events[a[i] + b[i]].push_back(- (i + 1));
+	}
+
+	int cnt = 0;
+	int prevTime = -1;
+
+	for (auto const& x : events)
+	{
+		if (prevTime == -1)
+		{
+			prevTime = x.first - 1;
+		}
+
+		results[cnt] += x.first - 1 - prevTime;
+
+		for (int i = 0; i < x.second.size(); i++)
+		{
+			if (x.second[i] > 0)
+			{
+				cnt += 1;
+			}
+			if (x.second[i] < 0)
+			{
+				cnt -= 1;
+			}
+		}
+
+		results[cnt] += 1;
+		prevTime = x.first;
+
+	}
+
+	for (int i = 1; i <= n; i++)
+	{
+		cout << results[i] << ' ';
+	}
+	cout << endl;
+}