# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370666 | TosakaUCW | Poklon (COCI17_poklon7) | C++17 | 1095 ms | 167692 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 <stdio.h>
#include <algorithm>
#include <vector>
int read(int x = 0, int f = 0, char ch = getchar())
{
while ('0' > ch or ch > '9')
f = ch == '-', ch = getchar();
while ('0' <= ch and ch <= '9')
x = x * 10 + (ch ^ 48), ch = getchar();
return f ? -x : x;
}
const int N = 1e6 + 5;
int n;
int L[N], R[N];
std::vector<int> convert(int x)
{
std::vector<int> res;
for (; x; x /= 2)
res.push_back(x % 2);
return std::reverse(res.begin(), res.end()), res;
}
std::vector<int> dfs(int v)
{
std::vector<int> a, b;
a = L[v] > 0 ? dfs(L[v]) : convert(-L[v]);
b = R[v] > 0 ? dfs(R[v]) : convert(-R[v]);
if (a.size() < b.size())
swap(a, b);
if (a.size() ^ b.size())
return a.push_back(0), a;
for (int i = 0; i < a.size(); i++)
if (a[i] ^ b[i])
{
if (b[i] == 1)
std::swap(a, b);
break;
}
return a.push_back(0), a;
}
int main()
{
n = read();
for (int i = 1; i <= n; i++)
L[i] = read(), R[i] = read();
std::vector<int> ans = dfs(1);
for (auto x : ans)
printf("%d", x);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |