# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
725082 | piOOE | Ancient Machine (JOI21_ancient_machine) | C++17 | 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 "Anna.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
constexpr int k2 = 79;
constexpr int fib = 113;
constexpr int LOG = 17;
using i128 = __int128;
i128 fibonacci[fib + 1];
void initFib() {
fibonacci[0] = 1;
fibonacci[1] = 2;
for (int x = 2; x <= fib; ++x) {
fibonacci[x] = fibonacci[x - 1] + fibonacci[x - 2];
}
}
i128 toBase2(vector<int> s) {
i128 x = 0;
reverse(s.begin(), s.end());
for (int c : s) {
x = x * 2 + c;
}
return x;
}
i128 toFib(vector<int> x) {
i128 res = 0;
int n = x.size();
assert(n == fib);
for (int i = 0; i < n; ++i) {
res += x[i] * fibonacci[n - i - 1];
}
return res;
}
vector<int> toVectorFromBase2(i128 x) {
vector<int> res(k2);
for (int i = 0; i < k2; ++i) {
res[i] += x >> i & i128(1);
}
return res;
}
vector<int> toVectorFromFib(i128 x) {
vector<int> a(fib);
for (int i = 0; i < fib; ++i) {
if (x >= fibonacci[fib - i - 1]) {
a[i] = 1;
}
x -= a[i] * fibonacci[fib - i - 1];
}
assert(x == 0);
return a;
}
}
void Anna(int n, std::vector<char> s) {
initFib();
int x = find(s.begin(), s.end(), 'X') - s.begin();
int z = n - (find(s.rbegin(), s.rend(), 'Z') - s.rbegin()) - 1;
if (x > z) {
return;
}
vector<int> a(n);
for (int i = x + 1; i < n; ++i) {
if (s[i] == 'Z' && (i + 1 == n || s[i + 1] != 'Z')) {
a[i] = 1;
}
}
for (int i = 0; i < LOG; ++i) {
Send(x >> i & 1);
}
while (a.size() % fib) {
a.push_back(0);
}
for (int i = 0; i < a.size(); i += fib) {
auto f = toFib(vector(a.begin() + i, a.begin() + i + fib));
auto res = toVectorFromBase2(f);
for (int j = 0; j < k2; ++j) {
Send(res[j]);
}
}
}