Submission #1149403

#	Time	Username	Problem	Language	Result	Execution time	Memory
1149403		rahidilbayramli	Carnival (CEOI14_carnival)	C++20	0 / 100	2 ms	444 KiB

carnival

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pb push_back
#define sz(v) (ll)(v.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.end()
#define f first
#define s second
#define pll pair<ll, ll>
#define pii pair<int, int>
using namespace std;
const ll sz = 200;
vl g[sz];
ll vis[sz], col = 0;
void dfs(ll node)
{
    vis[node] = col;
    for(auto u : g[node])
    {
        if(!vis[u])
            dfs(u);
    }
}
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll n, i, j;
    cin >> n;
    for(i = 1; i <= n; i++)
    {
        ll l = i, r = n, bst = n + 1;
        while(l <= r)
        {
            ll mid = (l + r) / 2;
            cout << (mid - i + 1) << ' ';
            for(j = i; j <= mid; j++)
                cout << j << ' ';
            cout << endl;
            ll res;
            cin >> res;
            if(res == mid - i + 1)
                l = mid + 1;
            else
            {
                bst = mid;
                r = mid - 1;
            }
        }
        if(bst != n + 1){
            g[i].pb(bst);
            g[bst].pb(i);
        }
    }
    for(i = 1; i <= n; i++)
    {
        if(!vis[i]){
            col++;
            dfs(i);
        }
    }
    cout << "0 ";
    for(i = 1; i <= n; i++)
        cout << vis[i] << ' ';
    cout << endl;
    return 0;
}

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