This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "highway.h"
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1<<17;
using ll = long long;
int m;
vector<int> c;
vector<int> res;
vector<array<int, 2>> g[maxn];
int D, a, b;
void dfs(int v, int p, int h = 0) {
for(auto [i, id] : g[v]) if(i != p) {
if(h+1 == D) c.push_back(id), res.push_back(i);
dfs(i, v, h+1);
}
}
bool go(vector<int> c, int p) {
vector<int> w(m);
for(int i = 0; i <= p; i++) w[c[i]] = 1;
return ask(w) == a*1ll*D;
}
void solve3() {
}
void find_pair(int n, std::vector<int> U, std::vector<int> V, int A, int B) {
a = A, b = B;
m = U.size();
if(m != n-1) return;
int s3 = 1;
for(int i = 0; i < U.size(); i++) {
s3 &= U[i] == i && V[i] == i+1;
g[U[i]].push_back({V[i], i});
g[V[i]].push_back({U[i], i});
}
if(0&&s3) {
solve3();
return;
}
D = ask(vector<int>(m))/A;
dfs(0, 0, 0);
int ans = -1;
for(int z = 1<<17; z>>=1;)
if(ans+z < c.size() && go(c, ans+z)) ans += z;
answer(0, res[ans+1]);
}
Compilation message (stderr)
highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:31:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < U.size(); i++) {
~~^~~~~~~~~~
highway.cpp:44:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(ans+z < c.size() && go(c, ans+z)) ans += z;
~~~~~~^~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |