제출 #1305372

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1305372		Zbyszek99	도서관 (JOI18_library)	C++20	0 / 100	14 ms	428 KiB

library

#include "library.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int n;
int nxt[1001];
bool was[1001];

int ask(vi x)
{
	vi X(n,0);
	forall(it,x) X[it-1] = 1;
	return Query(X);
}

void Solve(int N)
{
	n = N;
	was[1] = 1;
	int zost = n-1;
	int cur = 1;
	rep(i,2)
	{
		cur = 1;
		while(zost > 0)
		{
			int l = 1;
			int r = zost;
			int ans = -1;
			while(l <= r)
			{
				int mid = (l+r)/2;
				vi q;
				int m2 = mid;
				rep2(i,1,n) if(m2 > 0 && !was[i]) 
				{
					q.pb(i);
					m2--;
				}
				q.pb(cur);
				int ans1 = ask(q);
				q.pop_back();
				if(ans1 == ask(q))
				{
					ans = mid;
					r = mid-1;
				}
				else
				{
					l = mid+1;
				}
			}
			if(ans == -1) break;
			zost--;
			int v;
			rep2(i,1,n) if(ans > 0 && !was[i])
			{
				v = i;
				ans--;
			}
			if(i == 0) nxt[cur] = v;
			else nxt[v] = cur;
			was[v] = 1;
			cur = v;
		}
	}
	vi ans;
	rep(i,n)
	{
		ans.pb(cur);
		cur = nxt[cur];
	}
	Answer(ans);
}

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