제출 #293492

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
293492		Dovran	통행료 (IOI18_highway)	C++11	0 / 100	13 ms	3200 KiB

highway

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

using namespace std;

int n, m, dsa, vis[N];
vector<int>e[N];


void f(int nd, int pr, int lv, int x){
	vis[nd]=1;
	if(lv==x){
		dsa=1;
		answer(0, nd);
		return;
	}
	for(auto i:e[nd]){
		if(i!=pr and !vis[i])
			f(i, nd, lv+1, x);
		if(dsa)
			return;
	}
}

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<n-1; i++)
		e[u[i]].pb(v[i]), e[v[i]].pb(u[i]), asd.pb(1);
	int x;
	x=ask(asd), x/=b;
	f(0, 0, 0, x);
}

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