# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48072 | kawaiigrabrielneko | Library (JOI18_library) | C++14 | 51 ms | 528 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 <cstdio>
#include <vector>
#include "library.h"
using namespace std;
void Solve(int N){
vector<int> A(N);
vector<int> B(N);
vector<int> AP(N);
vector<int> AMB(N);
vector<int> APUB(N);
int na = N/2;
vector<int> ans(N);
for (int i = 0; i < N/2; i++){
A[i] = 1;
AP[i] = 0;
}
for (int i = N/2; i < N; i++){
A[i] = 0;
AP[i] = 1;
}
if (Query(A)<Query(AP)){
for (int i = 0; i < N; i++){
A[i] = 1 - A[i];
AP[i] = 1 - AP[i];
}
na = N - na;
}
// A contains an endpoint
while (na > 1){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |