# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105161 | 2019-04-10T18:48:24 Z | stefdasca | Hidden Sequence (info1cup18_hidden) | C++14 | 5 ms | 256 KB |
#include<bits/stdc++.h> #include "grader.h" using namespace std; vector<int>findSequence(int N) { vector<int> ans (N, 0); vector<int> qu; vector<int> qu1; vector<int> qu2; int nr0 = 0, nr1 = 0; while(1) { qu.push_back(0); qu1.push_back(1); if(isSubsequence(qu)) ++nr0; else { nr1 = N - nr0; break; } if(isSubsequence(qu1)) ++nr1; else { nr0 = N - nr1; break; } } int cntsf0 = nr0, cntsf1 = nr1; for(int i = 0; i < N; ++i) { qu.clear(); qu2.clear(); for(int j = 0; j < nr0 - cntsf0 + 1; ++j) qu.push_back(0); for(int j = 0; j < cntsf1; ++j) qu.push_back(1); for(int j = 0; j < nr1 - cntsf1 + 1; ++j) qu2.push_back(1); for(int j = 0; j < cntsf0; ++j) qu2.push_back(0); if(qu.size() <= (N/2+1)) { if(isSubsequence(qu)) ans[i] = 0, --cntsf0; else ans[i] = 1, --cntsf1; } else { if(isSubsequence(qu)) ans[i] = 1, --cntsf1; else ans[i] = 0, --cntsf0; } if(cntsf0 == 0) { for(int j = i+1; j < N; ++j) ans[j] = 1; break; } if(cntsf1 == 0) break; } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output is not correct: The returned sequence does not match the hidden one |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 256 KB | Output is not correct: The returned sequence does not match the hidden one |
2 | Halted | 0 ms | 0 KB | - |