| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1060660 | ArthuroWich | Mechanical Doll (IOI18_doll) | C++17 | 141 ms | 23616 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 "doll.h"
#include<bits/stdc++.h>
using namespace std;
struct node {
int l = -1, r = -1, y = 0;
};
int timer = 2, dep;
vector<int> x, y;
node tree[500005];
void build(int n, int d) {
if (dep-1 == d) {
return;
}
tree[n].l = -timer;
timer++;
tree[n].r = -timer;
timer++;
build(-tree[n].l, d+1);
build(-tree[n].r, d+1);
}
void create(int n, int d, int v) {
if (dep-1 == d) {
if (tree[n].y == 0) {
tree[n].l = v;
} else {
tree[n].r = v;
}
} else {
if (tree[n].y == 0) {
create(-tree[n].l, d+1, v);
} else {
create(-tree[n].r, d+1, v);
}
}
tree[n].y ^= 1;
}
void create_circuit(int m, vector<int> a) {
vector<int> d(m+1, -1);
a.push_back(0);
vector<set<int>> edges(m+1);
d[0] = a.front();
for (int i = 1; i < a.size(); i++) {
edges[a[i-1]].insert(a[i]);
}
a.pop_back();
vector<int> c;
for (int i = 0; i < a.size(); i++) {
if (edges[a[i]].size() == 0) {
d[a[i]] = 0;
} else if (edges[a[i]].size() == 1) {
d[a[i]] = *edges[a[i]].begin();
} else {
c.push_back(a[i]);
}
}
a = c;
if (!a.empty()) {
int n = a.size(), s;
dep = ceil(log2(n));
s = 1 << dep;
build(1, 0);
for (int i = 1; i < s; i++) {
if (i < n) {
create(1, 0, a[i]);
} else {
create(1, 0, -1);
}
}
create(1, 0, 0);
for (int i = 1; i < s; i++) {
x.push_back(tree[i].l);
y.push_back(tree[i].r);
}
}
answer(d, x, y);
}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... | ||||
