제출 #414945

#제출 시각아이디문제언어결과실행 시간메모리
414945SuhaibSawalha1통행료 (IOI18_highway)C++17
0 / 100
16 ms1096 KiB
#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(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...