# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
766029 | ono_de206 | Mechanical Doll (IOI18_doll) | C++14 | 78 ms | 11652 KiB |
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;
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
// #define int long long
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
void create_circuit(int m, std::vector<int> a) {
int n = a.size();
vector<int> c(m + 1, 0), x, y;
vector<vector<int>> g(m + 1);
a.pb(0);
g[0].pb(a[0]);
for(int i = 0; i < n; i++) {
g[a[i]].pb(a[i + 1]);
}
auto add = [&](int X, int Y) -> int {
x.pb(X);
y.pb(Y);
return -(int)x.size();
};
for(int i = 0; i <= m; i++) {
int sz = g[i].size();
if(sz == 0) continue;
if(sz == 1) {
c[i] = g[i][0];
continue;
}
int tmp = 1;
while(tmp * 2 < sz) tmp *= 2;
while(g[i].size() < tmp * 2) g[i].pb(0);
while(g[i].size() > 1) {
vector<int> nwg;
for(int j = 0; j < g[i].size(); j += 2) {
nwg.pb(add(g[i][j], g[i][j + 1]));
}
swap(nwg, g[i]);
}
c[i] = g[i][0];
}
answer(c, x, y);
}
Compilation message (stderr)
# | 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... |