# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
418221 | FlippenFaz | Mechanical Doll (IOI18_doll) | C++11 | 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> c;
vector<int> x;
vector<int> y;
vector<vector<int>> cons;
void connect(int start, int end) {
if (c[start] == 0) {
c[start] = end;
} else if (c[start] > 0) {
x.push_back( c[start] );
y.push_back( end );
c[start] = -x.size();
} else {
}
}
void create_circuit(int m, vector<int> a) {
cons.resize(m+1);
c.resize(m+1);
int prev = 0;
for (int i = 0; i < a.size(); i++) {
cons[prev].push_back(a[i]);
}
for (int i = 0; i < cons.size(); i++) {
if (cons[i].size() == 0) {
c[i] = 0;
} else if (cons[i].size() == 1) {
c[i] == cons[i][0];
} else {
int offset = -x.size();
int added = pow(2,ceil(log2(cons[i].size()))) - 1;
for (int i = 1; i < added+1; i++) {
x.push_back( offset -i*2 );
y.push_back( offset -i*2 - 1);
}
int last = added/2+1;
int start = x.size()-1-last;
int cnt = 0;
for (int i = start; i < x.size(); i++) {
x[i] = -i-1;
y[i] = cons[i][cnt++];
}
for (int i = start; cnt < cons[i].size(); i++) {
x[i] = y[i];
y[i] = cons[i][cnt++];
}
}
}
answer(c, x, y);
}