Submission #950955

#	Time	Username	Problem	Language	Result	Execution time	Memory
950955		phoenix0423	Library (JOI18_library)	C++17	100 / 100	739 ms	1492 KiB

library

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define pb push_back
#define eb emplace_back
#define f first
#define s second
// #define int long long
#define lowbit(x) x&-x
const int maxn = 1005;
#include "library.h"
int n;
vector<int> adj[maxn];
vector<pll> edge;

int con(vector<int> a){
    set<int> cur;
    for(auto x : a) cur.insert(x);
    int cnt = 0;
    for(auto [a, b] : edge) if(cur.count(a) && cur.count(b)) cnt++;
    return cnt;
}

int qry(vector<int> a){
	// cout<<"q : ";
	// for(auto x : a) cout<<x<<" ";
	// cout<<"\n";
	// int op;
	// cin>>op;
    // cout<<"con : "<<con(a)<<"\n";
	// return op < int(a.size()) - con(a);
	vector<int> cur(n);
	for(auto x : a) cur[x - 1] = 1;
	int op = Query(cur);
	return op < int(a.size()) - con(a);
}
void add(int a, int b){
	adj[a].pb(b);
	adj[b].pb(a);
    edge.eb(a, b);
}

void Solve(int _n){
	n = _n;
	vector<int> q;
	for(int rd = 0; rd < n - 1; rd++){
		vector<int> cand;
		for(int j = 1; j <= n; j++) cand.pb(j);
		int l = 0, r = cand.size() - 1;
		while(l + 1 < r){
            // cout<<"bs : "<<l<<" "<<r<<"\n";
			int m = (l + r) / 2;
			vector<int> a, b;
			for(int i = l; i <= m; i++) a.pb(cand[i]);
			for(int i = m + 1; i <= r; i++) b.pb(cand[i]);
			if(qry(a)) r = m;
			else if(qry(b)) l = m + 1;
			else break;
		}
		if(r == l + 1){
			add(cand[l], cand[r]);
			continue;
		}
		int m = (l + r) / 2;
		int L = l, R = m;
		while(L < R){
			int mid = (L + R) / 2;
			vector<int> a;
			for(int i = m + 1; i <= r; i++) a.pb(cand[i]);
			for(int i = L; i <= mid; i++) a.pb(cand[i]);
			if(qry(a)) R = mid;
			else L = mid + 1;
		}
		int fr = cand[L];
		L = m + 1, R = r;
		while(L < R){
			int mid = (L + R) / 2;
			vector<int> a;
			a.pb(fr);
			for(int i = L; i <= mid; i++) a.pb(cand[i]);
			if(qry(a)) R = mid;
			else L = mid + 1;
		}
		add(fr, cand[L]);
	}
	int pos = 1;
	for(int i = 1; i <= n; i++){
		if(adj[i].size() == 1){
			pos = i;
			break;
		}
	}
	vector<int> ans;
	int prev = -1;
	while(true){
		ans.pb(pos);
		int ok = 0;
		for(auto x : adj[pos]){
			if(x != prev){
				prev = pos, pos = x, ok = 1;
				break;
			}
		}
		if(!ok) break;
	}
	// cout<<"ans : ";
	// for(auto x : ans) cout<<x<<" ";
	// cout<<"\n";
	Answer(ans);
}

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