제출 #621875

#제출 시각아이디문제언어결과실행 시간메모리
621875MinaRagy06사육제 (CEOI14_carnival)C++17
100 / 100
26 ms464 KiB
#include <bits/stdc++.h>
using namespace std;
#define lesgooo ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// #define endl    '\n'
#define int     long long

int ask(vector<int> a)
{
    cout << a.size() << " ";
    for (auto i : a) cout << i << " ";
    cout << endl;
    int ret;
    cin >> ret;
    return ret;
}
signed main()
{
    lesgooo;
    int n;
    cin >> n;
    int par[n]{}, vis[n]{};
    for (int i = 0; i < n; i++) par[i] = i+1;
    int prv = 1;
    for (int i = 1; i < n; i++)
    {
        vector<int> a;
        for (int x = 0; x <= i; x++) a.push_back(x+1);
        if (ask(a) == prv)
        {
            vis[i] = 1;
            for (int j = 0; j < i; j++) if (!vis[j] && ask({i+1, j+1}) == 1) {par[i] = par[j]; break;}
        }
        else prv++;
    }
    set<int> s;
    for (int i = 0; i < n; i++) s.insert(par[i]);
    vector<int> a;
    for (auto i : s) a.push_back(i);
    cout << "0 ";
    for (int i = 0; i < n; i++) cout << lower_bound(a.begin(), a.end(), par[i])-a.begin()+1 << " ";
    cout << endl;
    return 0;
}
/*
2 1 2 3 1
*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...