# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174625 | hengliao | Hidden Sequence (info1cup18_hidden) | C++20 | 2 ms | 432 KiB |
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
#define F first
#define S second
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>
typedef int ll;
vector < int > findSequence (int n)
{
vector < int > re (n, 0);
ll cnt0=0, cnt1=0;
vll q;
while(cnt0<n){
q.pb(0);
if(isSubsequence(q)){
cnt0++;
}
else{
break;
}
}
cnt1=n-cnt0;
for(ll i=0;i<n;i++){
if(cnt0==0){
re[i]=1;
continue;
}
if(cnt1==0){
re[i]=0;
continue;
}
for(ll j=0;j<2;j++){
q.clear();
for(ll k=0;k<i;k++){
q.pb(re[k]);
}
q.pb(j);
if(j==0){
for(ll rep=0;rep<cnt1;rep++){
q.pb(1);
}
}
else{
for(ll rep=0;rep<cnt0;rep++){
q.pb(0);
}
}
if(isSubsequence(q)){
re[i]=j;
if(j==0) cnt0--;
else cnt1--;
break;
}
else{
re[i]=j^1;
if(j==0) cnt1--;
else cnt0--;
break;
}
}
}
return re;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |