Submission #293558

#	Time	Username	Problem	Language	Result	Execution time	Memory
293558		Dovran	Highway Tolls (IOI18_highway)	C++11	0 / 100	232 ms	262148 KiB

highway

#include <bits/stdc++.h>
#include "highway.h"
#define N 200009
#define pii pair <int, int>
#define ff first
#define ss second
#define pb push_back
#define ll long long

using namespace std;

ll n, m, dsa, l[N];
vector<int>e[N];
ll x;

void f(int nd, int lv){
	l[nd]=lv;
	if(nd and e[nd].size()==1)
		return;
	for(auto i:e[nd])
		f(i, lv+1);
}

void find_pair(int NN, std::vector<int>u, std::vector<int>v, int a, int b){
	n=NN;
	m=u.size();
	vector<int>asd;
	for(int i=0; i<m; i++){
		e[u[i]].pb(v[i]);
		e[v[i]].pb(u[i]);
		
		asd.pb(0);
	}
	x=ask(asd);
	x=x/a;
	f(0, 0);
	for(int i=0; i<=n; i++){
		if(l[i]==x){
			answer(0, i);
			return;
		}
	}
}

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