제출 #574736

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
574736		mdubaisi	사육제 (CEOI14_carnival)	C++14	20 / 100	99 ms	208 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);
	for (int i = 1; i <= n; i++) {
		if (vis[i])
			continue;
		ans[i - 1] = cnt;
		for (int j = i + 1; j <= n; j++) {
			if (vis[j])
				continue;
			int x;
			cout << 2 << ' ' << i << ' ' << j << endl;
			cin >> x;
			if (x == 1)
				vis[j] = 1, ans[j - 1] = cnt;
		}
		cnt++;
	}

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

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