Submission #236350

#	Time	Username	Problem	Language	Result	Execution time	Memory
236350		MvC	Library (JOI18_library)	C++11	0 / 100	536 ms	516 KiB

library

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include "library.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const ll mod=1e9+7;
using namespace std;
int i,j,pr,nx,x,y;
vector<int>vc,rs,a,nw,v1,v2,cur;
int ask(vector<int>v)
{
	return Query(v);
}
void Solve(int n)
{
	for(i=0;i<n;i++)vc.pb(1);
	for(i=0;i<n;i++)
	{
		vc[i]=0;
		if(ask(vc)==1)
		{
			nx=i;
			break;
		}
	}
	rs.pb(nx);
	for(i=0;i<n;i++)if(i!=nx)a.pb(i);
	for(i=1;i<n;i++)
	{
		pr=nx;
		cur=a;
		while(1)
		{
			if((int)cur.size()==1)
			{
				nx=cur[0];
				break;
			}
			v1.clear(),v2.clear();
			for(j=0;j<(int)cur.size();j++)
			{
				if(j<(int)cur.size()/2)v1.pb(cur[j]);
				else v2.pb(cur[j]);
			}
			for(j=0;j<n;j++)vc[j]=0;
			for(j=0;j<(int)v1.size();j++)vc[v1[j]]=1;
			x=ask(vc);
			vc[pr]=1;
			y=ask(vc);
			if(x==y)cur=v1;
			else cur=v2;
		}
		nw=a;
		a.clear();
		for(j=0;j<(int)nw.size();j++)if(nw[j]!=nx)a.pb(nw[j]);
		rs.pb(nx);
	}
	for(i=0;i<n;i++)rs[i]++;
	Answer(rs);
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	
	return 0;
}*/

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