제출 #132714

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
132714		dvdg6566	통행료 (IOI18_highway)	C++14	0 / 100	464 ms	262144 KiB

highway

#include "highway.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
#define mp make_pair
#define pb emplace_back
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound

vpi V[100100];
int sub[100100];
vi q;
int par[100100];
int rt;
int blk[100100];
int ban[100100];

int dfs(int x, int p){
	ban[x]=0;
	if (blk[x])return 0;
	par[x]=p;
	sub[x] = 1;
	for (auto i : V[x]){
		if (i.f==par[x])continue;
		sub[x] += dfs(i.f,x);
	}
	return sub[x];
}

void dfs2(int x, int p){
	// cout<<"DFS2 "<<x<<' '<<p<<'\n';
	for (auto i : V[x]){
		if (i.f==par[x])continue;
		q[i.s] =1;
		dfs2(i.f,x);
	}
}

void find_pair(int N, std::vector<int> U, std::vector<int> _V, int A, int B) {
  int M = U.size();
  q.resize(N-1,0);
  for (int i=0;i<M;++i){
  	int a=_V[i];
  	int b=U[i];
  	V[a].pb(b,i);
  	V[b].pb(a,i);
  }
  dfs(0,-1);
  int pos = N;
  // for (auto i : q)cout<<i<<' ';cout<<'\n';
  int len = ask(q);
  // cout<<len<<'\n';
  while (pos > 1){
  	// cout<<"Position "<<pos<<'\n';
  	ban[rt]=1;
  	int mindst = 1e9;
  	int ind = 0;
  	for (int i=1;i<N;++i)if(!ban[i]){
  		if (abs(sub[rt] - 2*sub[i]) < mindst){
  			mindst = abs(sub[0] - 2*sub[i]);
  			ind = i;
  		}
  	}
  	for (int i=0;i<N;++i)q[i]=0;
  	// cout<<ind<<'\n';
  	dfs2(ind,par[ind]);
  	// for (auto i : q)cout<<i<<' ';cout<<'\n';
  	int t = ask(q);
  	if (t != len){
  		// cout<<"Reroot "<<ind<<'\n';
  		for (int i=0;i<N;++i)ban[i]=1;
  		dfs(ind, par[ind]);
  		pos = sub[ind];
  		rt = ind;
  		if (pos == 1){
  			answer(0,rt);
  			return;
  		}
  	}else{
  		// cout<<"NO Reroot\n";
  		for (int i=0;i<N;++i)ban[i]=1;
  		blk[ind] = 1;
  		dfs(rt,par[rt]);
  		pos = sub[rt];
  		if (pos == 1){
  			answer(0,ind);
  			return;
  		}
  	}
  }
  answer(0,rt);
}

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