제출 #1284083

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284083		m.zeeshanrashid	사육제 (CEOI14_carnival)	C++20	0 / 100	1 ms	336 KiB

carnival

#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
// #define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

int qu(vec<int>a){
	cout<<a.size()<<' ';
	print(a);
	int x;
	cin>>x;
	return x;
}

int iter=1,itera=1;
void solve(){
	int n;
	cin>>n;
	vec<int>ans(n+1);
	vec<int>d;
	int p=1;
	for(int i=1;i<=n;i++){
		vec<int>temp=d;
		temp.append(i);
		int x=qu(temp);
		int len=d.size();
		if(x==len+1){
			d.append(i);
			ans[i-1]=p;
			p++;
			continue;
		}
		int l=0,r=len-1;
		while(l<=r){
			int m=(l+r)/2;
			temp={};
			for(int j=l;j<=m;j++) temp.append(d[j]);
			temp.append(i);
			if(qu(temp)==temp.size()) r=m;
			else l=m+1;
		}
		ans[i-1]=ans[d[l]];
	}
	ans.erase(begin(ans));
	print(ans)
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

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