제출 #954570

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
954570		Sharky	도서관 (JOI18_library)	C++17	19 / 100	3003 ms	980 KiB

library

#include <bits/stdc++.h>
#include "library.h"
using namespace std;
 
random_device rd;
mt19937 g(rd());
int outn, qc = 0;

void TLE() {
	TLE();
}
 
int query(vector<int>& v) {
	qc++;
	if (qc > 20000) TLE();
	vector<int> vt(outn, 0);
	for (auto x : v) vt[x - 1] = 1;
	v.clear();
	return Query(vt);
}
 
vector<int> adj[1001], ans;
 
void dfs(int u, int p = -1) {
	ans.push_back(u);
	for (int v : adj[u]) if (v != p) dfs(v, u);
}
 
void Solve(int n) {
	if (n == 1) {
		ans = {1};
		Answer(ans);
		return;
	}
	outn = n;
	vector<int> ee;
	vector<int> deg(n+1, 2), cand, vt;
	for (int sk = 1; sk <= n; sk++) {
		for (int i = 1; i <= n; i++) if (i != sk) vt.push_back(i);
		if (query(vt) == 1) ee.push_back(sk), deg[sk]--;
		cand.push_back(sk);
	}
	int ender = ee[0], i = ee[0], o = ee[1];
	while (i != o) {
		int sz = cand.size();
		int rt = 25, nxt;
		shuffle(cand.begin(), cand.end(), g);
		vector<int> er;
		for (int j = 0; j < sz; j += rt) {
			for (int k = j; k < min(sz, j + rt); k++) {
				vt.push_back(cand[k]);
				if (cand[k] == i) continue;
			}
			vector<int> vt2 = vt;
			vt2.push_back(i);
			int extra = query(vt2) - query(vt);
			if (extra) continue;
			for (int k = j; k < min(sz, j + rt); k++) {
				if (cand[k] == i) continue;
				vt.push_back(i);
				vt.push_back(cand[k]);
				if (query(vt) == 1) {
					deg[cand[k]]--, deg[i]--;
					adj[cand[k]].push_back(i);
					adj[i].push_back(cand[k]);
					nxt = cand[k];
					if (!deg[cand[k]]) er.push_back(k);
					break;
				}
			}
			if (!deg[i]) break;
		}
		reverse(er.begin(), er.end());
		for (auto x : er) cand.erase(cand.begin() + x);
		for (int j = cand.size() - 1; j >= 0; j--) if (cand[j] == i) {
			cand.erase(cand.begin() + j);
			break;
		}
		i = nxt;
	}
	dfs(ender);
	Answer(ans);
}

컴파일 시 표준 에러 (stderr) 메시지

library.cpp: In function 'void Solve(int)':
library.cpp:79:5: warning: 'nxt' may be used uninitialized in this function [-Wmaybe-uninitialized]
   79 |   i = nxt;
      |   ~~^~~~~

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