제출 #1284094

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284094		muhammad-mutahir	Carnival (CEOI14_carnival)	C++20	100 / 100	3 ms	404 KiB

carnival

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

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;
void ask(vector<int>a){
	cout<<a.size()<<" ";
	print(a);
	// vector<int>ans = {1,2,1,3,2};
	// set<int>ss;
	// for(int i:a){
		// ss.insert(ans[i-1]);
	// }
	// return ss.size();
}



 // 1 2 1 3 2.

void solve(int testcase_number){
    cin>>n;
    vector<int>dis;
    // int d = 1;
    int sz = 0;
    vector<int>ans(n+1,0);
    for(int i = 1;i<=n;i++){
    	dis.pb(i);
    	ask(dis);
    	dis.pop_back();
    	int k;
    	cin>>k;
    	if(k == sz+1){
    		dis.pb(i);
    		sz++;
    		ans[i] = sz;
    		// print(dis);
    		continue;
    	}
    	int l = 0;
    	int r = sz-1;
    	while(r-l>=1){
    		int m = (l+r)/2;
    		vector<int>tp;
    		for(int j = l;j<=m;j++){
    			tp.pb(dis[j]);
    		}
    		int ss = tp.size();
    		tp.pb(i);
    		ask(tp);
    		int k;
    		cin>>k;
    		if(k == ss){
    			r = m;
    		}
    		else{
    			l = m+1;
    		}
    		
    	}
    	ans[i] = ans[dis[r]];
    	
    }
    print(ans);
    



}


signed main(){
    // ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    // cin.tie(0), cout.tie(0);
    // cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

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