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;
#define SIZE(x) (int)x.size()
#define forn(i,n) for(int i=0;i<int(n);i++)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define pb push_back
typedef vector<int> vi;
vi L, R, v, state;
int t=1, skip, s=-1;
void build(int u, int l, int r) {
L.pb(0), R.pb(0), v.pb(0);
if(r-l<=skip) {
v[u]=-1;
skip-=r-l;
return;
}
if(r-l==1) return;
v[u] = s--;
int m=(l+r)/2;
L[u] = t++;
build(L[u], l, m);
R[u] = t++;
build(R[u], m, r);
}
bool dfs(int u, int a) {
if(u && v[u]==-1) return false;
if(!v[u]) {
v[u]=a;
return true;
}
if(state[u]^=1) return dfs(L[u],a);
return dfs(R[u],a);
}
void create_circuit(int m, vi A) {
vi c(m+1,0), x, y;
c[0]=A[0];
int n=SIZE(A);
if(n==1) {
answer(c,x,y);
return;
}
forsn(i,1,m+1) c[i]=-1;
int sz=1;
while(sz<n) sz*=2;
skip = sz-n;
build(0,0,sz);
vi a;
forsn(i,1,n) a.pb(A[i]);
a.pb(0);
state.assign(SIZE(v),0);
forn(i,n) while(!dfs(0,a[i]));
forn(i,SIZE(v)) {
if(L[i] || R[i]) {
x.pb(v[L[i]]);
y.pb(v[R[i]]);
}
}
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... |