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"
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define pb push_back
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
int M = U.size();
vector<int> tmp(M, 0);
vector<bool> sirve(M, 1);
ll W = ask(tmp);
for(int i=0; i<M; ++i){
tmp[i] = 1;
ll w = ask(tmp);
if(w == W){
sirve[i] = 0;
}
tmp[i] = 0;
}
vector<vector<int>> adj(N+1);
for(int i=0; i<M; ++i) if(sirve[i]){
adj[U[i]].pb(V[i]);
adj[V[i]].pb(U[i]);
}
auto dfs = [&](auto dfs, int at, int pa=-1) -> int {
for(int u : adj[at]){
if(u == pa) continue;
return dfs(dfs, u, at);
}
return at;
};
int s = dfs(dfs, 0);
answer(0, s);
}
# | 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... |