제출 #348979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348979		Kerim	통행료 (IOI18_highway)	C++17	69 / 100	253 ms	11312 KiB

highway

#include "highway.h"
#include "bits/stdc++.h"
#define MAXN 130009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int M,N;
PII edge[MAXN];
vector<int>A,B,AA,BB;
vector<PII>adj[MAXN];
bool check(){
	if(A.empty() or B.empty())
		return 0;	
	vector<int>col(N),w(M);
	tr(it,A)col[*it]=0;
	tr(it,B)col[*it]=1;
	for(int i=0;i<M;i++)
		w[i]=(col[edge[i].ff]==col[edge[i].ss]);
	return ask(w)%2;
}
void find_pair(int N, vector<int> U, vector<int> V, int a, int b) {
  	M=U.size();::N=N;
  	for(int i=0;i<M;i++)
  		edge[i]=mp(U[i],V[i]);
  	if(a==1 and b==2){//Subtask 5
	  	int hor=0,who=-1;
	  	for(int i=0;i<17;i++){
	  		A.clear();B.clear();
	  		for(int j=0;j<N;j++){
	  			if(j>>i&1)A.pb(j);
	  			else B.pb(j);
	  		}
	  		if(check()) hor^=(1<<i),who=i;
	  	}A.clear();B.clear();assert(who!=-1);
		for(int j=0;j<N;j++){
			if(j>>who&1)A.pb(j);
			else B.pb(j);
		}int sz=A.size();
		while(sz>1){
			AA=A;BB=B;
			A.clear();
			for(int i=0;i<sz/2;i++)A.pb(AA[i]);
			for(int i=sz/2;i<sz;i++)B.pb(AA[i]);
			if(!check()){
				B=BB;A.clear();
				for(int i=sz/2;i<sz;i++)
					A.pb(AA[i]);
			}sz=A.size();
		}
	  	answer(A[0],A[0]^hor);
	}
	else if(M==N-1){
		vector<int>vis(N,0),id(N),par(N),w(N-1,0);
		ll dis=ask(w);
		for(int i=0;i<M;i++){
			adj[edge[i].ff].pb(mp(edge[i].ss,i));
			adj[edge[i].ss].pb(mp(edge[i].ff,i));
		}queue<int>q;q.push(0);vis[0]=1;
		int tmp=0;
		while(!q.empty()){
			int nd=q.front();
			q.pop();
			tr(it,adj[nd])
				if(!vis[it->ff]){
					id[tmp++]=it->ss;
					par[it->ss]=it->ff;
					vis[it->ff]=1;
					q.push(it->ff);	
				}
		}
		int st=0,en=N-2;
		while(st<en){
			int mid=(st+en+1)>>1;
			vector<int>w(M);
			for(int i=0;i<N-1;i++)
				w[id[i]]=(i>=mid);
			if(ask(w)==dis)
				en=mid-1;
			else
				st=mid;
		}
		int s=par[id[st]];
		for(int i=0;i<N;i++)
			vis[i]=0;
		q.push(s);vis[s]=1;
		tmp=0;
		while(!q.empty()){
			int nd=q.front();
			q.pop();
			tr(it,adj[nd])
				if(!vis[it->ff]){
					id[tmp++]=it->ss;
					par[it->ss]=it->ff;
					vis[it->ff]=1;
					q.push(it->ff);	
				}
		}
		st=0;en=N-2;
		while(st<en){
			int mid=(st+en+1)>>1;
			vector<int>w(M);
			for(int i=0;i<N-1;i++)
				w[id[i]]=(i>=mid);
			if(ask(w)==dis)
				en=mid-1;
			else
				st=mid;
		}
		int t=par[id[st]];
		answer(s,t);
	}
	else
		assert(0);
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 6 / 6
• Subtask 4: 33 / 33
• Subtask 5: 18 / 18
• Subtask 6: 0 / 31