| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1080179 | KhoaDuy | Library (JOI18_library) | C++14 | 0 ms | 0 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 int long long
//#define endl '\n'
void solve(int n){
vector<int> m(n,0);
vector<vector<int>> inter;
int input;
for(int i=0;i<n;i++){
m[i]=1;
input=Query(m);
if(input!=i+1){
break;
}
inter.push_back(i);
}
for(int k=inter.size();k<n;k++){
int low=0,high=inter.size()-1;
low--,high++;
while(high-low>1){
int mid=((high-low)>>1)+low;
fill(m.begin(),m.end(),0);
m[k]=1;
for(int i=0;i<=mid;i++){
for(int x:inter[i]){
m[x]=1;
}
}
input=Query(m);
if(input<mid+2){
high=mid;
}
else{
low=mid;
}
}
if(high==inter.size()){
inter.push_back(k);
continue;
}
fill(m.begin(),m.end(),0);
m[k]=1,m[inter[high][0]]=1;
input=Query(m);
if(input==1){
inter[high].insert(inter[high].begin(),k);
}
else{
inter[high].push_back(k);
}
int l=high;
if(l<inter.size()-1){
low=l+1,high=inter.size()-1;
low--,high++;
while(high-low>1){
int mid=((high-low)>>1)+low;
fill(m.begin(),m.end(),0);
m[k]=1;
for(int i=l+1;i<=mid;i++){
for(int x:inter[i]){
m[x]=1;
}
}
input=Query(m);
if(input<mid-l+1){
high=mid;
}
else{
low=mid;
}
}
if(high<inter.size()){
fill(m.begin(),m.end(),0);
m[k]=1;
m[inter[high][0]]=1;
input=Query(m);
if(inter[l][0]==k){
vector<int> temp;
if(input==1){
}
else{
for(int x:inter[high]){
temp.push_back(x);
}
for(int x:inter[l]){
temp.push_back(x);
}
inter[high]=temp;
auto it=inter.begin()+l;
inter.erase(it);
}
}
else{
if(input==1){
}
else{
}
}
}
}
}
}
signed main(){
}