# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
241022 | SamAnd | Paralelogrami (COCI17_paralelogrami) | C++17 | 5 ms | 384 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;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 1000006;
int n;
int l[N], r[N];
int d[N];
void dfs(int x)
{
if (l[x] > 0)
{
d[l[x]] = d[x] + 1;
dfs(l[x]);
}
if (r[x] > 0)
{
d[r[x]] = d[x] + 1;
dfs(r[x]);
}
}
void solv()
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
{
scanf("%d%d", &l[i], &r[i]);
}
dfs(1);
int maxd = 0;
for (int i = 1; i <= n; ++i)
maxd = max(maxd, d[i]);
int maxu = 0;
for (int i = 1; i <= n; ++i)
{
if (l[i] < 0)
{
int ymax = -l[i];
for (int j = d[i]; j < maxd; ++j)
{
if (ymax == 1)
break;
ymax = (ymax / 2) + (ymax % 2);
}
maxu = max(maxu, ymax);
}
if (r[i] < 0)
{
int ymax = -r[i];
for (int j = d[i]; j < maxd; ++j)
{
if (ymax == 1)
break;
ymax = (ymax / 2) + (ymax % 2);
}
maxu = max(maxu, ymax);
}
}
assert(maxu);
vector<int> v;
while (maxu)
{
v.push_back(maxu % 2);
maxu /= 2;
}
reverse(all(v));
for (int i = 0; i < v.size(); ++i)
printf("%d", v[i]);
for (int i = 0; i <= maxd; ++i)
printf("0");
printf("\n");
}
int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
//ios_base::sync_with_stdio(false), cin.tie(0);
solv();
return 0;
}
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |