# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
348233 | jamielim | Library (JOI18_library) | C++17 | 57 ms | 364 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 "library.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
int n;
vector<int> ans;
bitset<1005> rem;
vector<int> q;
void dnc(int idx,int sz){
if(sz<=1){
for(int i=0;i<n;i++)if(rem[i]){ans[idx]=i;break;}
return;
}
int m=(sz-1)/2;
for(int i=0;i<n;i++)q[i]=0;
int x=0;
for(int i=0;i<n&&x<=m;i++)if(rem[i]){q[i]=1;x++;}
int cur=Query(q);
for(int i=0;i<idx;i++)q[ans[i]]=1;
if(cur==Query(q)){
x=0;
for(int i=0;i<n;i++){
if(rem[i]){
if(x>m){
rem[i]=0;
}
x++;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |