Submission #294212

#	Time	Username	Problem	Language	Result	Execution time	Memory
294212		Muhammetali	Highway Tolls (IOI18_highway)	C++11	100 / 100	302 ms	14484 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
template<class T>bool tmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool tmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
ll k;
vpl con[100000];
vi u,v,w,tree[2];
bool vis[100000],fin[100000];
int func(vector<int> &tree)
{
	int l=0;int r=sz(tree)-1;
	while(l<r)
	{
		int mid=(l+r)/2;
		for (int i=mid+1;i<=r;i++) fin[tree[i]]=1;
		for (int i=0;i<sz(u);i++)
		{
			if (fin[u[i]]!=fin[v[i]])
			{
				w[i]=1;
			}
		}
		if (k!=ask(w)) l=mid+1;
		else r=mid;
		for (int i=0;i<sz(u);i++) w[i]=0;
		for (int i=mid+1;i<=r;i++) fin[tree[i]]=0;
	}
	return tree[l];
}
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B)
{
	u=U;v=V;
	for (int i=0;i<sz(U);i++)
	{
		con[U[i]].pb({V[i],i});
		con[V[i]].pb({U[i],i});
	}
	w.resize(sz(U));
	k=ask(w);
	int l=0;int r=sz(U)-1;
	while(l<r)
	{
		int mid=(l+r)/2;
		for (int i=l;i<=mid;i++) w[i]=1;
		if (k!=ask(w)) r=mid;
		else l=mid+1;
		for (int i=l;i<=mid;i++) w[i]=0;
	}
	queue<pl> q;
	q.push({0,U[l]});
	q.push({1,V[l]});
	vis[U[l]]=vis[V[l]]=1;
	while(sz(q))
	{
		int bar=q.front().f;
		int la=q.front().s;
		q.pop();
		tree[bar].pb(la);
		for (auto i:con[la])
		{
			if (!vis[i.f])
			{
				vis[i.f]=1;
				q.push({bar,i.f});
			}
		}
	}
	answer(func(tree[0]),func(tree[1]));
}

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