제출 #1146984

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1146984		minh30082008	사육제 (CEOI14_carnival)	C++20	0 / 100	3 ms	416 KiB

carnival

#include<bits/stdc++.h>
#define INF 1e18
#define fi first
#define se second
#define FOR(i, k, n) for(ll i = k; i <= n; i++)
#define FOR1(i, k, n) for(ll i = k; i >= n; i--)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define re return 0
#define mii map<int, int>
#define input "chinaflu.inp"
#define output "chinaflu.out"
#define rf 	freopen(input, "r", stdin); freopen(output, "w", stdout)
using namespace std;
const int maxn = 3e5 + 5;
const int mod = 1e9 + 9;
const int base = 998244353;
void add(int &a, int b) 
{
	a += b; 
	if(a >= mod) a -= mod; 
	if(a < 0) a += mod; 
}
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r)
{
	return uniform_int_distribution<int>(l, r) (rd);
}
int ans[200], last[200];
int main()
{
//	fastio;
	int n;
	cin >> n;
	int truoc = 0;
	FOR(i, 1, n)
	{
		cout << i << " ";
		FOR(j, 1, i)
			cout << j << " ";
		cout << endl;
		int somau;
		cin >> somau;
		if(somau > truoc)
		{
			ans[i] = somau;
			truoc = somau;
			last[ans[i]] = i;
			continue;
		}
		truoc = somau;
		if(somau == 1)
		{
			ans[i] = 1;
			last[1] = i;
			continue;
		}
		vi vv;
		FOR(i, 1, somau)
			vv.pb(last[i]);
		sort(vv.begin(), vv.end());
		int l = 0, r = vv.size() - 1, vt;
		while(l <= r)
		{
			int mid = (l + r) >> 1;
			cout << vv.size() - mid + 1 << " ";
			FOR(j, mid, vv.size() - 1)
				cout << vv[j] << " ";
			cout << i << endl;
			cin >> somau;
			if(somau < vv.size() - mid + 1)
			{
				vt = mid;
				l = mid + 1;
			}
			else
				r = mid - 1;
		}
		ans[i] = vv[vt];
	}
	cout << 0 << " ";
	FOR(i, 1, n)
		cout << ans[i] << " ";
	re;
}

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