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 answer(vector<int> one, vector<int> two, vector<int> three);
void create_circuit(int m, vector<int> a) {
cons.resize(m+1);
c.resize(m+1, -1);
c[0] = a[0];
int maxPow = ceil(log2(a.size()));
a.resize( pow(2,maxPow), -1 );
a.push_back(0);
for (int j = 1; j < pow(2,maxPow); j++) {
x.push_back(-j*2 );
y.push_back(-j*2 - 1);
}
vector<int> ord;
ord.push_back( pow(2,maxPow) );
int curPow = pow(2,maxPow-1);
while (curPow > 0) {
int curSize = ord.size();
for (int i = 0; i < curSize; i++) {
ord.push_back(ord[i] - curPow);
}
curPow/=2;
}
int cnt = 0;
for (int j = pow(2,maxPow)-2; j >= pow(2,maxPow-1)-1; j--) {
y[j] = a[ord[cnt++]];
x[j] = a[ord[cnt++]];
}
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... |