Submission #1162890

#	Time	Username	Problem	Language	Result	Execution time	Memory
1162890		pan	Library (JOI18_library)	C++20	0 / 100	17 ms	460 KiB

library

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

vector<ll> order;
ll n, dp[1005];
vector<ll> adj[1005];
int Query(const std::vector<int>& M);

ll query(ll mid, ll x)
{
	vector<int> now(n, 0);
	ll cnt = 0;
	for (ll i=0; i<=mid; ++i) if (i!=x) {cnt++; now[order[i]] = 1;}
	ll ans;
	if (x <= mid) {ans = dp[mid] - ((cnt)? Query(now):0);}
	else {now[order[x]] = 1; ans = Query(now) - dp[mid];}
	//show3(mid, x, ans);
	return ans;
	
}
void Answer(const std::vector<int>& res);

void Solve(int N)
{
	vector<int> res(N);
	n = N;
	order.clear();
	for (ll i=0; i<n; ++i) order.pb(i);
	vector<int> now(n, 0);
	//shuffle(all(order), rng);
	for (ll i=0; i<n; ++i) {now[order[i]] = 1; dp[i] = Query(now); show(dp[i]);}
	ll root = 0;
	for (ll i=0; i<n; ++i)
	{
		// find first
		ll lo = 0, hi = n;
		while (lo!=hi)
		{
			ll mid = (lo + hi) >> 1;
			if (query(mid, i)<= 0) hi = mid;
			else lo = mid + 1;
		}
		
		if (lo < n) { adj[order[i]].pb(order[lo]);}
		else Answer(res);
		lo++; hi = n;
		while (lo!=hi)
		{
			ll mid = (lo + hi) >> 1;
			if (query(mid, i)<=-1) hi = mid;
			else lo = mid + 1;
		}
		if (lo < n) {show2(order[i], order[lo]); adj[order[i]].pb(order[lo]);}
		else root = i;
	}
	vector<bool> vis(n, 0);
	for (ll i=0; i<n; ++i)
	{
		res[i] = root + 1;
		vis[root] = 1;
		for (ll u: adj[root]) if (!vis[u]) root = u;
	}
	Answer(res);
}

• Subtask 1: 0 / 19
• Subtask 2: 0 / 81