제출 #713770

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
713770		PixelCat	자동 인형 (IOI18_doll)	C++14	47 / 100	91 ms	10152 KiB

doll

#ifdef NYAOWO
#include "grader.cpp"
#define OUT_VEC(x) { cout << #x << ":"; { for(auto &IT:x) cout << " " << IT; } cout << "\n" << flush; }
#else
#define OUT_VEC(x)
#endif
#include "doll.h"

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXM = 100010;

vector<int> x, y;

int solve(vector<int> &v, int l, int r) {
    if(l == r) return v[l];
    int m = (l + r) / 2;
    int id = sz(x);
    x.eb(0); y.eb(0);
    int a = solve(v, m + 1, r);
    int b = solve(v, l, m);
    x[id] = a; y[id] = b;
    // cout << l << " " << r << " " << id << " " << x[id] << " " << y[id] << " " << (-(id + 1)) << "\n" << flush;
    return -(id + 1);
}

void create_circuit(int M, std::vector<int> A) {
    A.eb(0);
    vector<int> ans(M + 1, -1);
    reverse(all(A));
    ans[0] = A.back();
    A.pop_back();

    int lgn = __lg(sz(A) - 1) + 1;
    int n = (1 << lgn);
    while(sz(A) < n) A.eb(-1);
    {
        int j = 0;
        For(i, 0, n - 1) {
            if(i < j) swap(A[i], A[j]);
            for(int k = n >> 1; (j ^= k) < k; k >>= 1);
        }
    }

    solve(A, 0, n - 1);
    OUT_VEC(ans);
    OUT_VEC(x);
    OUT_VEC(y);
    answer(ans, x, y);
}

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