#include "doll.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
int id = 0;
vi X,Y;
int newtree(const vi& v,int l,int r) {
cerr << l sp r << endl;
if (l == r) {
return v[l-1];
}
if (l == r-1) {
++id;
X.push_back(v[l-1]);
Y.push_back(v[l]);
return -id;
}
int m = (l+r) >> 1;
int id1 = newtree(v,l,m);
int id2 = newtree(v,m+1,r);
++id;
X.push_back(id1);
Y.push_back(id2);
return -id;
}
void create_circuit(int M, std::vector<int> A) {
int N = A.size();
vi go[M+1];
go[0].push_back(A[0]);
for (int i=0;i<N-1;i++) go[A[i]].push_back(A[i+1]);
go[A.back()].push_back(0);
std::vector<int> C(M + 1);
for (int i = 0; i <= M; ++i) {
if (big(go[i])) C[i] = newtree(go[i],1,big(go[i]));
else C[i] = 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... |