# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125325 | khsoo01 | Park (JOI17_park) | C++11 | 314 ms | 804 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 "park.h"
using namespace std;
namespace {
const int N = 1505;
int place[N];
bool vis[N], blk[N];
int n;
vector<int> tree[N];
}
int check (int S, int E, vector<int> &O) {
for(int i=0;i<n;i++) place[i] = 0;
for(auto &T : O) place[T] = 1;
place[S] = 1;
place[E] = 1;
return Ask(min(S, E), max(S, E), place);
}
int Find (int A, int B, vector<int> &O) {
int S = 0, E = O.size();
while(S<E) {
int M = (S+E)/2;
vector<int> V;
for(int i=0;i<M;i++) {
V.push_back(O[i]);
}
check(A, B, V) ? E = M : S = M+1;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |