# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
105144 | 2019-04-10T17:31:18 Z | stefdasca | Hidden Sequence (info1cup18_hidden) | C++14 | 4 ms | 384 KB |
#include<bits/stdc++.h> #include "grader.h" using namespace std; vector<int>findSequence(int N) { vector<int> ans; vector<int> qu; vector<int> qu1; int stp = 0, nr0 = 0, nr1 = 0; while(1) { qu.push_back(0); qu1.push_back(1); if(!isSubsequence(qu)) { nr1 = N - stp; nr0 = stp; break; } if(isSubsequence(qu1)) { nr1 = stp; nr0 = N - stp; break; } ++stp; } int cntsf0 = 0, cntsf1 = 0; for(int i = 0; i < N; ++i) { qu.clear(); if(cntsf0 <= cntsf1) for(int j = 0; j < cntsf0; ++j) qu.push_back(0); else for(int j = 0; j < cntsf1; ++j) qu.push_back(1); if(nr0 <= nr1) { qu.push_back(1); for(int j = 0; j < nr0; ++j) qu.push_back(0); if(isSubsequence(qu)) ans.push_back(1), ++cntsf1, --nr1; else ans.push_back(0), ++cntsf0, --nr0; } else { qu.push_back(0); for(int j = 0; j < nr1; ++j) qu.push_back(1); if(isSubsequence(qu)) ans.push_back(0), ++cntsf0, --nr0; else ans.push_back(1), ++cntsf1, --nr1; } } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 384 KB | Output is not correct: The returned sequence does not match the hidden one |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 256 KB | Output is not correct: The returned sequence does not match the hidden one |
2 | Halted | 0 ms | 0 KB | - |