# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527937 | perchuts | Library (JOI18_library) | C++17 | 300 ms | 284 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 "library.h"
using namespace std;
// int Query(const vector<int>& v);
// void Answer(const vector<int>& res);
bool pos[1011];
void Solve(int N)
{
vector<int> M(N);
for(int i = 0; i < N; i++) {
M[i] = 1;
}
// 4LogN => acho o primeiro e o ultimo. agora, achar os do meio...
//só fazer uma busca simples
//nao ;-;
int A = Query(M);
vector<int> res(N);
int last=-1,cur,l,r;
for(int k=1;k<=N;++k){
l = 1, r = N-k+1, cur = r;
while(l<=r){
int md = l + (r-l+1)/2,cnt=0;
// printf("%d %d\n",l,md);
for(int i=1;i<=N;i++){
if(pos[i]){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |