# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598408 | alextodoran | Hidden Sequence (info1cup18_hidden) | C++17 | 7 ms | 308 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.
/**
____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|
**/
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
typedef long long ll;
bool isSubsequence (vector <int> v);
vector <int> findSequence (int N) {
int suff[2]; {
if (isSubsequence(vector <int> (N / 2 + 1, 0)) == false) {
suff[0] = 0;
while (isSubsequence(vector <int> (suff[0] + 1, 0)) == true) {
suff[0]++;
}
suff[1] = N - suff[0];
} else {
suff[1] = 0;
while (isSubsequence(vector <int> (suff[1] + 1, 1)) == true) {
suff[1]++;
}
suff[0] = N - suff[1];
}
}
int pref[2];
pref[0] = pref[1] = 0;
vector <int> v;
while ((int) v.size() < N) {
if (pref[0] + 1 + suff[1] < pref[1] + 1 + suff[0]) {
vector <int> ask;
for (int i = 0; i < pref[0]; i++) {
ask.push_back(0);
}
ask.push_back(0);
for (int i = 0; i < suff[1]; i++) {
ask.push_back(1);
}
if (isSubsequence(ask) == true) {
v.push_back(0);
} else {
v.push_back(1);
}
} else {
vector <int> ask;
for (int i = 0; i < pref[1]; i++) {
ask.push_back(1);
}
ask.push_back(1);
for (int i = 0; i < suff[0]; i++) {
ask.push_back(0);
}
if (isSubsequence(ask) == true) {
v.push_back(1);
} else {
v.push_back(0);
}
}
pref[v.back()]++;
suff[v.back()]--;
}
return v;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |