#include<bits/stdc++.h>
#include<chrono>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vdd vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
////////////////////Only Clear Code//////////////////////////
void usaco_problem(){
freopen("milkvisits.in", "r", stdin);
freopen("milkvisits.out", "w", stdout);
}
void init(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
}
const int mx = 5e5+5;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 300;
#include "doll.h"
vi C;
vi X, Y;
vi graph[mx];
bool state[mx];
int value[mx];
int _count(int n){
int x = 0;
int cnt = 1;
while(cnt < n){
cnt *=2;
x++;
}
return x;
}
vi v;
void dfs(int node, int l, int r){
if(l == r){
v.pb(node);
return;
}
int md = (l+r)/2;
if(state[node] == 0){
dfs(node*2, l, md);
state[node] = 1;
}
else{
dfs(node*2+1, md+1, r);
state[node] = 0;
}
}
void create_circuit(int m, vi A) {
int N = A.size();
C.clear();
C.resize(m+1);
X.clear();
Y.clear();
C[0] = A[0];
graph[0].pb(A[0]);
for(int i = 0;(i+1) < N;i++){
C[A[i]] = A[i+1];
graph[A[i]].pb(A[i+1]);
}
graph[A[N-1]].pb(0);
int cur = -1;
for(int i = 0; i <= m;i++){
if(graph[i].size() == 0)continue;
if(graph[i].size() == 1){
C[i] = graph[i][0];
}
else{
int k = _count(graph[i].size());
int ind = 0;
int n = (1 << k);
for(int l = 1; l <= n-1;l++){
value[l] = cur--;
X.pb(0);
Y.pb(0);
state[l] = 0;
}
C[i] = value[1];
for(int l = 1; l <= (n-1)/2;l++){
X[-value[l]-1] = (value[l*2]);
Y[-value[l]-1] = (value[l*2+1]);
}
for(int i = 0; i < n;i++){
dfs(1, 0, n-1);
}
int num = n - graph[i].size();
for(int x : v){
if(num > 0){
int node = x/2;
if(x % 2 == 0){
X.pb(0);
X[-cur-1] = value[1];
cur--;
}
else{
Y.pb(0);
Y[-cur-1] = value[1];
cur--;
}
num--;
}
else{
int node = x/2;
if(x % 2 == 0){
X[-value[node]-1] = graph[i][ind];
ind++;
}
else{
Y[-value[node]-1] = graph[i][ind];
ind++;
}
}
}
}
}
answer(C, X, Y);
}
/*
int32_t main(){
init();
speed;
create_circuit(4, {1, 2, 1, 3});
}*/
/*
NEVER GIVE UP!
DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
Your Guide when stuck:
- Continue keyword only after reading the whole input
- Don't use memset with testcases
- Check for corner cases(n=1, n=0)
- Check where you declare n(Be careful of declaring it globally and in main)
*/
Compilation message
highway.cpp:53:10: fatal error: doll.h: No such file or directory
53 | #include "doll.h"
| ^~~~~~~~
compilation terminated.
