# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1060337 | 2024-08-15T13:06:59 Z | pera | Hidden Sequence (info1cup18_hidden) | C++17 | 6 ms | 440 KB |
#include<bits/stdc++.h> #include "grader.h" using namespace std; vector<int> findSequence(int N){ vector<int> ans , X , e(2); for(int i = 1;i <= N / 2 + 1;i ++){ X.emplace_back(1); if(isSubsequence(X)){ e[1] = i; e[0] = N - i; } } if(e[1] == N / 2 + 1){ vector<int>().swap(X); for(int i = 1;i <= N / 2 + 1;i ++){ X.emplace_back(0); if(isSubsequence(X)){ e[0] = i; e[1] = 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 = [&](){ if(o[0] + (e[1] - o[1]) <= N / 2 + 1){ return isSubsequence(Get(o[0] + 1 , e[1] - o[1] , 0)); }else{ return !isSubsequence(Get(o[1] + 1 , e[0] - o[0] , 1)); } }; for(int i = 1;i <= N;i ++){ ans.emplace_back(!is_Zero()); o[ans.back()]++; } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 344 KB | Output is partially correct: Maximum length of a query = 6 |
2 | Partially correct | 0 ms | 344 KB | Output is partially correct: Maximum length of a query = 7 |
3 | Partially correct | 1 ms | 344 KB | Output is partially correct: Maximum length of a query = 6 |
4 | Partially correct | 1 ms | 344 KB | Output is partially correct: Maximum length of a query = 6 |
5 | Partially correct | 0 ms | 344 KB | Output is partially correct: Maximum length of a query = 5 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 3 ms | 344 KB | Output is partially correct: Maximum length of a query = 84 |
2 | Partially correct | 3 ms | 440 KB | Output is partially correct: Maximum length of a query = 91 |
3 | Partially correct | 3 ms | 440 KB | Output is partially correct: Maximum length of a query = 97 |
4 | Partially correct | 3 ms | 344 KB | Output is partially correct: Maximum length of a query = 78 |
5 | Partially correct | 4 ms | 344 KB | Output is partially correct: Maximum length of a query = 96 |
6 | Partially correct | 3 ms | 344 KB | Output is partially correct: Maximum length of a query = 88 |
7 | Partially correct | 5 ms | 344 KB | Output is partially correct: Maximum length of a query = 98 |
8 | Partially correct | 2 ms | 436 KB | Output is partially correct: Maximum length of a query = 84 |
9 | Partially correct | 4 ms | 344 KB | Output is partially correct: Maximum length of a query = 102 |
10 | Partially correct | 6 ms | 344 KB | Output is partially correct: Maximum length of a query = 101 |
11 | Partially correct | 4 ms | 344 KB | Output is partially correct: Maximum length of a query = 97 |
12 | Partially correct | 3 ms | 344 KB | Output is partially correct: Maximum length of a query = 101 |
13 | Partially correct | 3 ms | 344 KB | Output is partially correct: Maximum length of a query = 102 |