# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680560 | nutella | Xylophone (JOI18_xylophone) | C++17 | 2 ms | 304 KiB |
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 <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
void solve(int N) {
vector<bool> was(N + 1);
vector<int> A(N);
int lo = -1, hi = N - 1;
while (lo + 1 < hi) {
int mid = lo + hi >> 1;
if (query(1, mid + 1) == N - 1) {
hi = mid;
} else {
lo = mid;
}
}
answer(hi + 1, N);
A[hi] = N;
was[N] = true;
int p = N, pp = -1;
for (int i = hi - 1; i >= 0; --i) {
int diff = query(i + 1, i + 2);
int a;
if (diff + p > N || was[diff + p]) {
a = p - diff;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |