Submission #604965

#	Time	Username	Problem	Language	Result	Execution time	Memory
604965		yuto1115	자동 인형 (IOI18_doll)	C++17	100 / 100	92 ms	9520 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); ++i)
#define rrep(i, n) for (ll i = ll(n)-1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(),a.end()
#define SZ(a) int(a.size())
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

void create_circuit(int m, vi a) {
    int n = SZ(a);
    vi c(m + 1, -1), x, y;
    int _n = 1;
    while (_n <= n) _n *= 2;
    vi ls;
    auto f = [&](auto &f, int l, int r, int id, int d) -> int {
        if (r + n + 1 <= _n) return -1;
        if (r - l == 1) {
            ls.pb(id);
            return id;
        }
        int now = SZ(x);
        x.pb(0), y.pb(0);
        x[now] = f(f, l, (l + r) / 2, id, d + 1);
        y[now] = f(f, (l + r) / 2, r, id + (1 << d), d + 1);
        return -(now + 1);
    };
    f(f, 0, _n, 0, 0);
    sort(all(ls));
    assert(SZ(ls) == n + 1);
    assert(ls.back() == _n - 1);
    vi rev(_n);
    rep(i, n + 1) rev[ls[i]] = (i == n ? 0 : a[i]);
    for (int &i: x) if (i >= 0) i = rev[i];
    for (int &i: y) if (i >= 0) i = rev[i];
    answer(c, x, y);
}

• Subtask 1: 2 / 2
• Subtask 2: 4 / 4
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 18 / 18
• Subtask 6: 56 / 56