Submission #575050

#	Time	Username	Problem	Language	Result	Execution time	Memory
575050		mdubaisi	Carnival (CEOI14_carnival)	C++14	0 / 100	103 ms	292 KiB

carnival

#include <bits/stdc++.h>
#include <unordered_set>
#define all(v) (v.begin()), (v.end())
#define setall(a, val) memset(a, val, sizeof a)
#define ll long long
const ll MOD = 10007;
const ll N = 5e3 + 1;
const ll M = 2e2 + 1;
using namespace std;

bool vis[M];
int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	int n, cnt = 1;
	cin >> n;
	vector<int> ans(n, 0);

	for (int i = 1; i <= n; i++) {
		if (vis[i])
			continue;
		if (!ans[i - 1])
			ans[i - 1] = cnt++;
		for (int j = i + 1; j <= n; j++) {
			if (vis[j])
				continue;

			if (!ans[j - 1]) {
				cout << "2 " << i << ' ' << j << endl;
				int x;
				cin >> x;
				if (x == 1)
					ans[j - 1] = ans[i - 1], vis[j] = 1;
				else
					ans[j - 1] = cnt++;
			}

			for (int k = j + 1; k <= n; k++) {
				if (vis[k])
					continue;

				cout << "3 " << i << ' ' << j << ' ' << k << endl;
				int x;
				cin >> x;
				if (x == 3)
					continue;
				else if (x == 2) {
					if (ans[i - 1] != ans[j - 1]) {
						cout << "2 " << j << ' ' << k << endl;
						int y;
						cin >> y;
						if (y == 1)
							ans[k - 1] = ans[j - 1];
						else
							ans[k - 1] = ans[i - 1];
					}
				}
				else
					ans[k - 1] = ans[i - 1];
				vis[k] = 1;
			}
		}
	}

	cout << "0 ";
	for (int x : ans)
		cout << x << ' ';
	cout << endl;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20