# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
770079 | 2023-06-30T18:11:04 Z | Andrei | Hidden Sequence (info1cup18_hidden) | C++17 | 4 ms | 296 KB |
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector <int> aux; int cntPref[2]; int cntSuff[2]; vector <int> ans; vector <int> findSequence(int n) { aux.push_back(1); while((int)aux.size()<=n) { if(isSubsequence(aux)==1) cntSuff[1]++; aux.push_back(1); } cntSuff[0]=n-cntSuff[1]; while((int)ans.size()<n) { if(cntPref[0]+1+cntSuff[1]<cntPref[1]+1+cntSuff[0]) { aux.clear(); for(int i=1; i<=cntPref[0]+1; i++) aux.push_back(0); for(int i=1; i<=cntSuff[1]; i++) aux.push_back(1); if(isSubsequence(aux)==1) ans.push_back(0); else ans.push_back(1); } else { aux.clear(); for(int i=1; i<=cntPref[1]+1; i++) aux.push_back(0); for(int i=1; i<=cntSuff[0]; i++) aux.push_back(1); if(isSubsequence(aux)==1) ans.push_back(1); else ans.push_back(0); } cntPref[ans.back()]++; cntSuff[ans.back()]--; } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 296 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 | 4 ms | 208 KB | Output is not correct: The returned sequence does not match the hidden one |
2 | Halted | 0 ms | 0 KB | - |