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 namespace std;
#define pb push_back
void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
int M = U.size(), d = B - A;
vector<int> w(M, 0), adj[N];
for(int i = 0; i < M; ++i){
adj[U[i]].pb(i);
adj[V[i]].pb(i);
}
int S = -1, T = -1;
long long toll = ask(w);
for(int i = 0; i < N - 1; ++i){
for(auto id:adj[i]){
w[id] = 1;
}
long long cur = ask(w);
if(cur - toll == d && S == -1){
S = i;
}else if(cur - toll == d) T = i;
for(auto id:adj[i]){
w[id] = 0;
}
}
if(T == -1) T = N - 1;
answer(S, T);
}
# | 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... |