제출 #1188406

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1188406		comxdddddd	사육제 (CEOI14_carnival)	C++20	20 / 100	24 ms	408 KiB

carnival

#include <bits/stdc++.h>
using namespace std;

int N, t;
vector<int> costume;
vector<int> group_leader;

int main() {
    cin >> N;
    costume.resize(N + 1);
    group_leader.clear();
    int group_id = 1;
    for (int i = 1; i <= N; ++i) {
        bool matched = false;
        for (int leader : group_leader) {
            cout << "2 " << i << " " << leader << endl << flush;
            cin >> t;
            if (t == 1) {
                costume[i] = costume[leader];
                matched = true;
                break;
            }
        }
        if (!matched) {
            costume[i] = group_id++;
            group_leader.push_back(i);
        }
    }
    cout << "0 ";
    for (int i = 1; i <= N; ++i) {
        cout << costume[i] << " ";
    }
    cout << endl << flush;
    return 0;
}

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