# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47199 | 2018-04-29T05:00:46 Z | Kmcode | Hidden Sequence (info1cup18_hidden) | C++14 | 7 ms | 504 KB |
#include "bits/stdc++.h" #include "grader.h" using namespace std; vector<int> calc(vector<int> v, int add,int lim,int n) { vector<pair<int, int> > vv; vector<int> v1; for (int i = v.size(); i >= 0; i--) { vector<int> tmp; tmp = v; int z = 0; while (1) { tmp.insert(tmp.begin() + tmp.size() - i, add); if (tmp.size() > lim) { tmp.pop_back(); break; } if (isSubsequence(tmp)) { } else { tmp.pop_back(); break; } z++; } v1.push_back(z); } int sum = n-v.size(); for (int el : v1) { sum -= el; } int id = max_element(v1.begin(), v1.end()) - v1.begin(); v1[id] += sum; int z = v.size(); for (int i = z; i >= 0; i--) { while (v1[z - i]--) { v.insert(v.begin() + v.size() - i, add); } } return v; } vector<int> findSequence(int N) { vector<int> zero; vector<int> one; for (int i = 0; i < N/2 +1; i++) { zero.push_back(0); one.push_back(1); if (isSubsequence(zero)) { } else{ zero.pop_back(); } if (!isSubsequence(one)) { one.pop_back(); } } while (zero.size() + one.size() < N) { if (zero.size() > one.size()) { one.push_back(1); } else { zero.push_back(0); } } if (one.size() > zero.size()) { return calc(zero, 1, (3 * N) / 4 + 1, N); } else { return calc(one, 3, (3 * N) / 4 + 1, N); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 504 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 504 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |