| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 512860 | Carmel_Ab1 | Hidden Sequence (info1cup18_hidden) | C++17 | 8 ms | 332 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 "grader.h"
#define pb push_back
using namespace std;
typedef vector<int>vi;
bool ask(vi v){return isSubsequence(v);}
int c0=0,c1=0;
vi buildL(int n){
int cur1=c1,cur0=c0;
vi ans;
while(ans.size()!=n){
if(cur1>cur0){
vi v;
for(int x:ans)
v.pb(x);
v.pb(1);
for(int i=0; i<cur0; i++)
v.pb(0);
if(ask(v))
ans.pb(1),cur1--;
else
ans.pb(0),cur0--;
}
else{
vi v;
for(int x:ans)
v.pb(x);
v.pb(0);
for(int i=0; i<cur1; i++)
v.pb(1);
if(ask(v))
ans.pb(0),cur0--;
else
ans.pb(1),cur1--;
}
}
return ans;
}
vi buildR(int n){
int cur1=c1,cur0=c0;
vi ans;
while(ans.size()!=n){
if(cur1>cur0){
vi v=vi(cur0,0);
v.pb(1);
for(int x:ans)
v.pb(x);
if(ask(v))
ans.insert(ans.begin(),1),cur1--;
else
ans.insert(ans.begin(),0),cur0--;
}
else{
vi v=vi(cur1,1);
v.pb(0);
for(int x:ans)
v.pb(x);
if(ask(v))
ans.insert(ans.begin(),0),cur0--;
else
ans.insert(ans.begin(),1),cur1--;
}
}
return ans;
}
vi findSequence (int n){
for(int i=1; ; i++){
vi all1=vi(i,1);
vi all0=vi(i,0);
if(!ask(all1)){
c1=i-1;
c0=n-c1;
break;
}
if(!ask(all0)){
c0=i-1;
c1=n-c0;
break;
}
}
vi L=buildL((n+1)/2),R=buildR(n/2);
vi ans;
for(int x:L)ans.pb(x);
for(int x:R)ans.pb(x);
return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
