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 "doll.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef double ld;
typedef complex<ld> point;
void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
cerr << H << ' ';
debug_out(T...);
}
#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)
const int maxn = 4e5 + 10;
int n, m, a[maxn], out[maxn], out1[maxn], out2[maxn], res;
vector<int> idx[maxn];
void solve(int v, int root, vector<int> tmp){
// debug(v);
// for (auto x: tmp) debug(x);
vector<int> l;
vector<int> r;
for (int i = 0; i < tmp.size(); i++){
if (i&1) r.push_back(tmp[i]);
else l.push_back(tmp[i]);
}
bool flgl = false;
bool flgr = false;
for (auto x: l) if (x != -1) flgl = true;
for (auto x: r) if (x != -1) flgr = true;
if (!flgl){
out1[v-1] = -root;
}
else if (l.size() == 1){
out1[v-1] = a[l[0]+1];
}
else{
res++;
out1[v-1] = -res;
solve(res, root, l);
}
if (!flgr){
out2[v-1] = -root;
}
else if (r.size() == 1){
out2[v-1] = a[r[0]+1];
}
else{
res++;
out2[v-1] = -res;
solve(res, root, r);
}
}
vector<int> Calc(int l, int r){
// debug(l, r);
if (l + 1 == r){
return vector<int>{l};
}
int mid = (l + r) >> 1;
vector<int> lc = Calc(l, mid);
vector<int> rc = Calc(mid, r);
vector<int> ans;
for (int i = 0; i < lc.size(); i++){
ans.push_back(lc[i]);
ans.push_back(rc[i]);
}
return ans;
}
void create_circuit(int M, vector<int> A) {
n = A.size(); m = M;
for (int i = 0; i < n; i++){
a[i] = A[i];
idx[a[i]].push_back(i);
}
a[n] = 0;
out[0] = a[0];
for (int i = 1; i <= m; i++){
int tmp = idx[i].size();
if (tmp == 0){
out[i] = 0;
continue;
}
while(tmp % 2 == 0) tmp /= 2;
vector<int> bad;
while(tmp != 1){
bad.push_back(-1);
tmp = idx[i].size() + bad.size();
while(tmp % 2 == 0) tmp /= 2;
}
int sz = idx[i].size() + bad.size();
if (sz == 1){
out[i] = a[idx[i][0]+1];
continue;
}
reverse(all(idx[i]));
vector<int> val;
// debug(sz);
vector<int> ptr = Calc(0, sz);
// debug(i, ptr.size(), bad.size());
int sz2 = idx[i].size();
for (int j = 0; j < sz; j++){
if (ptr[j] >= bad.size()){
val.push_back(idx[i].back());
idx[i].pop_back();
}
else{
val.push_back(-1);
}
}
res++;
out[i] = -res;
solve(res, res, val);
}
vector<int> C(m+1), X(res), Y(res);
for (int i = 0; i <= m; i++){
C[i] = out[i];
//debug(i, C[i]);
}
//debug(res);
for (int i = 0; i < res; i++){
X[i] = out1[i];
Y[i] = out2[i];
// debug(-(i+1), X[i], Y[i]);
}
answer(C, X, Y);
}
Compilation message (stderr)
doll.cpp: In function 'void solve(int, int, std::vector<int>)':
doll.cpp:35:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
35 | for (int i = 0; i < tmp.size(); i++){
| ~~^~~~~~~~~~~~
doll.cpp: In function 'std::vector<int> Calc(int, int)':
doll.cpp:76:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
76 | for (int i = 0; i < lc.size(); i++){
| ~~^~~~~~~~~~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:117:15: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
117 | if (ptr[j] >= bad.size()){
doll.cpp:115:7: warning: unused variable 'sz2' [-Wunused-variable]
115 | int sz2 = idx[i].size();
| ^~~
# | 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... |