제출 #1292272

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1292272		blackscreen1	사육제 (CEOI14_carnival)	C++20	100 / 100	4 ms	428 KiB

carnival

#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
#define ll long long
#define ld long double
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define iloop_(m, h, g) for (auto i = m; i < h; i += g)
#define jloop_(m, h, g) for (auto j = m; j < h; j += g)
#define kloop_(m, h, g) for (auto k = m; k < h; k += g)
#define lloop_(m, h, g) for (auto l = m; l < h; l += g)
#define getchar_unlocked _getchar_nolock // comment before submission
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pllll pair<pll, pll>
#define vll vector<ll>
#define qll queue<ll>
#define dll deque<ll>
#define pqll priority_queue<ll>
#define gll greater<ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n;
	cin >> n;
	ll a[n];
	a[0] = 1;
	ll c = 1, ccn;
	iloop(1, n) {
		cout << i+1 << " ";
		jloop(1, i+2) cout << j << " ";
		cout << endl;
		cin >> ccn;
		if (ccn == c+1) a[i] = ++c;
		else {
			ll lb = 1, ub = c, mid;
			while (lb < ub) {
				mid = (lb + ub) >> 1;
				vector<ll> toc;
				toc.push_back(i+1);
				jloop(1, i+1) if (a[j-1] <= mid) toc.push_back(j);
				cout << toc.size() << " ";
				for (auto it : toc) cout << it << " ";
				cout << endl;
				cin >> ccn;
				if (ccn == mid) ub = mid;
				else lb = mid + 1;
			}
			a[i] = lb;
		}
	}
	cout << "0 ";
	iloop(0, n) cout << a[i] << " ";
	return 0;
}

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