# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997817 | 2024-06-12T23:48:47 Z | 12345678 | Hidden Sequence (info1cup18_hidden) | C++17 | 27 ms | 424 KB |
#include<bits/stdc++.h> #include "grader.h" using namespace std; const int nx=205; int used[nx], sz[nx], mn=-1, a, b; vector<int> findSequence (int N) { vector<int> tmp, res; for (int i=1; i<=(N+1)/2; i++) { tmp.push_back(0); if (!isSubsequence(tmp)) { mn=0; a=i-1; break; } } tmp.clear(); for (int i=1; i<=(N+1)/2; i++) { tmp.push_back(1); if (!isSubsequence(tmp)) { mn=1; a=i-1; break; } } if (mn==-1) mn=0, a=N/2; for (int t=1; t<=200; t++) { int cnt=0; for (int i=0; i<=a; i++) if (!used[i]) cnt++; if (cnt==1) { int sm=0; vector<int> res; for (int i=0; i<=a; i++) sm+=sz[i]; for (int i=0; i<=a; i++) if (!used[i]) sz[i]=N-a-sm; cnt=0; } if (cnt==0) { vector<int> res; for (int i=0; i<=a; i++) { for (int j=0; j<sz[i]; j++) res.push_back(!mn); if (i!=a) res.push_back(mn); } return res; } for (int i=0; i<=a; i++) { if (!used[i]) { vector<int> qrs; for (int j=0; j<i; j++) if (!used[j]) qrs.push_back(mn); for (int j=0; j<t; j++) qrs.push_back(!mn); for (int j=i; j<a; j++) if (!used[j]) qrs.push_back(mn); if (!isSubsequence(qrs)) used[i]=1, sz[i]=t-1; } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output is not correct: The length of the returned sequence is not N |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 27 ms | 424 KB | Output is not correct: The length of the returned sequence is not N |
2 | Halted | 0 ms | 0 KB | - |