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>
#include "doll.h"
using namespace std;
const int INF = 1e9 + 5;
void create_circuit(int m, vector<int> a) {
int n, k;
n = a.size(), k = __lg(n);
vector<int> c(m + 1), x(n + k + 1, INF), y(n + k + 1, INF);
for(int i = 0; i <= m; i++) c[i] = -1;
int cur = k + 2;
for(int i = k; i >= 0; i--){
if(n & (1 << i)){
x[(k - i) + 1] = -cur;
y[(k - i) + 1] = (i == 0 ? -cur : -((k - i) + 2));
for(int len = 0; len < i - 1; len++){
for(int j = 0; j < (1 << len); j++){
x[cur] = -(cur + (1 << len) + j);
y[cur] = -(cur + (1 << len) + 1 + j);
cur++;
}
}
cur += (1 << i) / 2;
}
else{
x[(k - i) + 1] = -1;
y[(k - i) + 1] = (i == 0 ? 0 : -((k - i) + 2));
}
}
if(n & 1) y[-x[k + 1]] = 0;
vector<char> where(n + k + 1, 'X');
int v = -1;
for(int i = 0; i < n; i++){
if(v > 0) v = c[v];
while(v < 0){
if(where[-v] == 'X'){
where[-v] = 'Y';
if(x[-v] == INF) x[-v] = a[i];
v = x[-v];
}
else if(where[-v] == 'Y'){
where[-v] = 'X';
if(y[-v] == INF) y[-v] = a[i];
v = y[-v];
}
}
}
for(auto &i : x) if(i == INF) i = -1;
for(auto &i : y) if(i == INF) i = -1;
x.erase(x.begin());
y.erase(y.begin());
answer(c, x, y);
}
# | 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... |