제출 #601589

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
601589		Mazaalai	자동 인형 (IOI18_doll)	C++17	0 / 100	20 ms	8096 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define ff first
#define ss second
using namespace std;
using VI = vector <int>;
using PII = pair <int, int>;
int n, m, p = 1;
const int N = 2e5;
VI c, x(N), y(N), state(N);
int switchNo = 1;
bool vis;
int generate(int l, int r) {
    if (l == r) {
        /* 
            n+1 down, others up
            int lim = p-n-1
        */
        return (r <= p-n-1 ? -1 : 0); // not switch // makes n+1 zero
    }
    int mid = (l+r)>>1, curNode = switchNo++;
    x[curNode] = generate(l, mid);
    y[curNode] = generate(mid+1, r);
    return -curNode;
}
void addPos(int pos, int v) { // removes n zero
    int& nx = (state[-pos] ? y[-pos] : x[-pos]);
    state[-pos] ^= 1;
    if (nx == 0) {
        nx = v;
        return;
    }
    return addPos(nx, v);
}
void create_circuit(int M, vector<int> nums) {
    m = M;
    n = sz(nums);
    c = VI(m+1, -1);
    while(p < n+1) p *= 2;
    nums.pb(0);
    generate(1, p);
    for (int i = 0; i <= n; i++) addPos(-1, nums[i]);
    for (int i = 0; i < switchNo-1; i++) {
        x[i] = x[i+1];
        y[i] = y[i+1];
    }
    x.resize(switchNo-1);
    y.resize(switchNo-1);
    answer(c, x, y);
}

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