# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81583 | 2018-10-25T12:36:20 Z | farukkastamonuda | Hidden Sequence (info1cup18_hidden) | C++14 | 5 ms | 404 KB |
#include "grader.h" #include <bits/stdc++.h> #define fi first #define se second #define lo long long #define inf 1000000009 #define md 1000000007 #define li 500005 #define mp make_pair #define pb push_back using namespace std; int i,h,k; vector<int> u,ans; vector<int> findSequence(int n){ for(i=0;i<=n/2;i++){ u.pb(1); if(isSubsequence(u)==0) break; } if(i<=n/2){ h=1; k=i; u.pop_back(); } else{ h=0; u.clear(); for(k=0; ;k++){ u.pb(0); if(isSubsequence(u)==0) break; } u.pop_back(); } int kk=n-k; int t=0,tt=0; for(int j=0;j<n;j++){ vector<int> v; if(k+tt<kk+t){ for(int i=1;i<=tt+1;i++) v.pb(!h); for(int i=1;i<=k;i++) v.pb(h); if(isSubsequence(v)){ans.pb(!h);tt++;kk--;} else {ans.pb(!h);t++;k--;} } else{ for(int i=1;i<=t+1;i++) v.pb(h); for(int i=1;i<=kk;i++) v.pb(!h); if(isSubsequence(v)){ans.pb(h);t++;k--;} else{ans.pb(!h);tt++;kk--;} } } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 252 KB | Output is correct: Maximum length of a query = 5 |
2 | Incorrect | 2 ms | 324 KB | Output is not correct: The returned sequence does not match the hidden one |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 404 KB | Output is not correct: The returned sequence does not match the hidden one |
2 | Halted | 0 ms | 0 KB | - |