| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 47200 | Kmcode | Hidden Sequence (info1cup18_hidden) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
bool isSubsequence(vector<int> S) {
for (int el : S) {
cout << el << " ";
}
cout << endl;
int k;
cin >> k;
return k;
}
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, 0, (3 * N) / 4 + 1, N);
}
}
int main() {
int n;
cin >> n;
vector<int> ans=findSequence(n);
for (int el : ans) {
cout << el << " ";
}
return 0;
}