# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
923355 | vjudge1 | Hidden Sequence (info1cup18_hidden) | C++17 | 4 ms | 1112 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"
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
using namespace std;
#define pb push_back
vector<int> findSequence(int n){
int L=(n/2)+1;
int c1=-1,c0=-1;
for(int i=1;i<=L;i++){
vector<int> v;
for(int j=1;j<=i;j++)v.pb(1);
if(!isSubsequence(v)){
c1=i-1;
c0=n-c1;
break;
}
}
if(c1==-1){
for(int i=1;i<=L;i++){
vector<int> v;
for(int j=1;j<=i;j++)v.pb(0);
if(!isSubsequence(v)){
c0=i-1;
c1=n-c1;
break;
}
}
}
vector<int> ans;
if(c1<=0){
for(int i=1;i<=n;i++)ans.pb(0);
return ans;
}
if(!c0){
for(int i=1;i<=n;i++)ans.pb(1);
return ans;
}
int cnt0=0,cnt1=0;
bool ok=0;
if(c0<L){
ok=0;
}
else ok=1;
if(!ok){
vector<int> v;
v.pb(1);
for(int i=1;i<=c0;i++)v.pb(0);
if(!isSubsequence(v)){
ans.pb(0);
c0--;
cnt0++;
}
else{
ans.pb(1);
c1--;
cnt1++;
}
}
else{
vector<int> v;
v.pb(0);
for(int i=1;i<=c1;i++)v.pb(1);
if(!isSubsequence(v)){
ans.pb(1);
c1--;
cnt1++;
}
else{
ans.pb(0);
c0--;
cnt0++;
}
}
for(int i=2;i<=n;i++){
vector<int> v=ans;
if(c1){
v.pb(1);
for(int j=1;j<=c0;j++)v.pb(0);
if(isSubsequence(v)){
ans.pb(1);
cnt1++;
c1--;
}
else{
ans.pb(0);
cnt0++;
c0--;
}
}
else{
ans.pb(0);
}
}
return ans;
}
// main(){
// // freopen("prizes.in", "r", stdin);
// // freopen("prizes.out", "w", stdout);
// ios_base::sync_with_stdio(0);
// cin.tie(0);
// cout.tie(0);
// int t=1;
// // cin>>t;
// while(t--){
// solve();
// }
// }
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |