제출 #831511

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

library

#include "bits/stdc++.h"
#include "library.h"
using namespace std;
#define pb push_back
#define sz(v) ((int)v.size())

mt19937 rng(time(NULL));

vector<int> ans;

bitset<1001> in;

int query(int s, vector<int> &z) {
	shuffle(z.begin(), z.end(), rng);
	if (sz(z) == 1) return z[0];
	if (sz(z) == 0) return -1;
	int l = 0;
	int r = sz(z) - 1;
	int c1, c2;

	vector<int> j;

	while (l < r) {
		int m = (l+r)/2;
		j.clear();
		for (int i = l; i <= m; ++i)
			j.pb(z[i]);
		c1 = Query(j);
		j.pb(s);
		c2 = Query(j);
		if (c1 >= c2)
			r = m;
		else
			l = m+1;
	}

	if (l == sz(z) -1) {
		j.clear(); j.pb(s); j.pb(z.back());
		if (Query(j) != 1)
			return -1;
	}

	return z[l];
}

void remain(vector<int> &u, int n) {
	u.clear();
	for (int i = 1; i <= n; ++i)
		if (!in[i]) u.pb(i);
}

void Solve(int n) {
	int c = 1;
	vector<int> u;

	while (c != -1) {
		in[c] = 1;
		ans.pb(c);
		remain(u, n);
		c = query(c, u);
	}

	reverse(ans.begin(), ans.end());
	c = ans.back();
	ans.pop_back();
	while (c != -1) {
		in[c] = 1;
		ans.pb(c);
		remain(u, n);
		c = query(c, u);
	}

	Answer(ans);
}

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