Submission #414945

#	Time	Username	Problem	Language	Result	Execution time	Memory
414945		SuhaibSawalha1	Highway Tolls (IOI18_highway)	C++17	0 / 100	16 ms	1096 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>
using namespace std;

vector<vector<array<int, 2>>> adj;
int n, m, dp;

void dfs (int u = 0, int p = -1, int d = 1) {
	for (auto &v : adj[u]) {
		if (v[0] ^ p) {
			if (d == dp) {
				vector<int> ak(m, 0);
				ak[v[1]] = 1;
				if (ask(ak) != d) {
					answer(0, v[0]);
					return;
				}
			}	
			else {
				dfs(v[0], u, d + 1);
			}
		}
	}
}

void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
	n = N;
	m = U.size();
	adj.assign(n, {});
	for (int i = 0; i < n; ++i) {
		adj[U[i]].push_back({V[i], i});
		adj[V[i]].push_back({U[i], i});
	}	
	dp = ask(vector<int>(m, 0)) / A;
	dfs();
}	

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