# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317096 | 2020-10-29T03:17:33 Z | casperwang | Hidden Sequence (info1cup18_hidden) | C++14 | 9 ms | 376 KB |
#include <bits/stdc++.h> #include "grader.h" #define pb push_back using namespace std; vector <int> findSequence (int N) { vector <int> G, T; int cnt0, cnt1; for (int i = 1; i <= N/2+1; i++) { G.pb(0); if (!isSubsequence(G)) { cnt0 = i-1, cnt1 = N-(i-1); break; } } G.clear(); for (int i = 1; i <= N/2+1; i++) { G.pb(1); if (!isSubsequence(G)) { cnt1 = i-1, cnt0 = N-(i-1); break; } } int o = (cnt1 < cnt0), len = min(cnt1, cnt0); if (len == N) { G.clear(); for (int i = 0; i < N; i++) G.pb(o); return G; } vector <int> p(len+1); for (int i = 0; i <= len; i++) { for (int j = 1; j <= N-len; j++) { G.clear(); for (int k = 0; k < i; k++) G.pb(o); for (int k = 0; k < j; k++) G.pb(!o); for (int k = 0; k < len-i; k++) G.pb(o); if (!isSubsequence(G)) { p[i] = j-1; break; } else if (j == N-len) { p[i] = j; } } } G.clear(); for (int i = 0; i <= len; i++) { if (i) G.pb(o); for (int j = 0; j < p[i]; j++) G.pb(!o); } return G; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 256 KB | Output is partially correct: Maximum length of a query = 7 |
2 | Partially correct | 1 ms | 256 KB | Output is partially correct: Maximum length of a query = 8 |
3 | Partially correct | 1 ms | 256 KB | Output is partially correct: Maximum length of a query = 7 |
4 | Partially correct | 1 ms | 256 KB | Output is partially correct: Maximum length of a query = 9 |
5 | Partially correct | 1 ms | 256 KB | Output is partially correct: Maximum length of a query = 6 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 4 ms | 376 KB | Output is partially correct: Maximum length of a query = 86 |
2 | Partially correct | 6 ms | 256 KB | Output is partially correct: Maximum length of a query = 92 |
3 | Partially correct | 7 ms | 256 KB | Output is partially correct: Maximum length of a query = 102 |
4 | Partially correct | 6 ms | 256 KB | Output is partially correct: Maximum length of a query = 87 |
5 | Partially correct | 9 ms | 256 KB | Output is partially correct: Maximum length of a query = 103 |
6 | Partially correct | 6 ms | 256 KB | Output is partially correct: Maximum length of a query = 130 |
7 | Partially correct | 8 ms | 256 KB | Output is partially correct: Maximum length of a query = 145 |
8 | Partially correct | 8 ms | 256 KB | Output is partially correct: Maximum length of a query = 124 |
9 | Partially correct | 8 ms | 256 KB | Output is partially correct: Maximum length of a query = 126 |
10 | Partially correct | 9 ms | 256 KB | Output is partially correct: Maximum length of a query = 125 |
11 | Partially correct | 7 ms | 256 KB | Output is partially correct: Maximum length of a query = 97 |
12 | Partially correct | 8 ms | 256 KB | Output is partially correct: Maximum length of a query = 150 |
13 | Partially correct | 9 ms | 256 KB | Output is partially correct: Maximum length of a query = 107 |