# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1060333 | 2024-08-15T13:01:16 Z | pera | Hidden Sequence (info1cup18_hidden) | C++17 | 2 ms | 344 KB |
#include<bits/stdc++.h> #include "grader.h" using namespace std; vector<int> findSequence(int N){ int zero = 0 , one = 0; vector<int> ans , X; for(int i = 1;i <= N / 2 + 1;i ++){ X.emplace_back(1); if(isSubsequence(X)){ one = i; zero = N - i; } } if(one == N / 2 + 1){ vector<int>().swap(X); for(int i = 1;i <= N / 2 + 1;i ++){ X.emplace_back(0); if(isSubsequence(X)){ zero = i; one = N - i; } } } vector<int> o(2); auto Get = [&](int x , int y , int z){ vector<int> v; for(int i = 1;i <= x + y;i ++){ v.push_back(z ^ (i <= x)); } return v; }; auto is_Zero = [&](){ vector<int> v; if(o[0] + (one - o[1]) <= N / 2 + 1){ return isSubsequence(Get(o[0] + 1 , one - o[1] , 0)); }else{ return !isSubsequence(Get(o[1] + 1 , zero - o[0] , 1)); } }; for(int i = 1;i <= N;i ++){ ans.emplace_back(!is_Zero()); o[ans.back()]++; } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output is not correct: The returned sequence does not match the hidden one |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 344 KB | Output is not correct: The returned sequence does not match the hidden one |
2 | Halted | 0 ms | 0 KB | - |