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;
using ll = long long;
void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
int M = U.size();
bool subtask3 = M == N - 1;
for (int i = 0; i < M; i++) {
if (U[i] != i && V[i] != i + 1) {
subtask3 = 0;
}
}
if (subtask3) {
ll s = ask(vector<int>(M));
int lo = 0, hi = N - 1;
while (lo < hi) {
int mi = (lo + hi + 1) / 2;
vector<int> w(M);
fill(w.begin(), w.begin() + mi, 1);
if (ask(w) != s) {
hi = mi - 1;
} else {
lo = mi;
}
}
answer(lo, lo + s / A);
}
}
# | 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... |