제출 #96199

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96199		lyc	Mechanical Doll (IOI18_doll)	C++14	6 / 100	110 ms	14068 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXM = 100005;
vector<int> nxt[MAXM];
int S = -1;
vector<int> C, X, Y;

void build(int rt, int i, int s, int e) {
    if (s > e) return;
    //cout << "BUILD " << rt << " " << i << " " << s << " " << e << endl;

    if (s == e) {
        if (i >= 0) C[i] = nxt[rt][s];
        else {
            //X[-i] = i, Y[-i] = nxt[rt][s];
            X.push_back(i);
            Y.push_back(nxt[rt][s]);
        }
    }
    else if (s+1 == e && i < 0) {
        //X[-i] = nxt[rt][s];
        //Y[-i] = nxt[rt][e];
        X.push_back(nxt[rt][s]);
        Y.push_back(nxt[rt][e]);
    }
    else {
        int m = (s+e)/2;
        if (i >= 0) {
            C[i] = S--;
            build(rt, C[i], s, e);
        }
        else {
            X.push_back(S);
            build(rt, S--, s, m);
            Y.push_back(S);
            build(rt, S--, m+1, e);
        }
    }
}

void create_circuit(int M, std::vector<int> A) {
    int N = A.size();
    C.resize(M+1);

    A.push_back(0);
    for (int i = 0; i <= N; ++i) {
        nxt[A[i]].push_back(A[(i+1)%(N+1)]);
    }

    //X.resize(2*N);
    //Y.resize(2*N);
    for (int i = 0; i <= M; ++i) {
        build(i, i, 0, (int)nxt[i].size()-1);
        //cout << i << ": "; for (auto x : nxt[i]) cout << x << ' '; cout << endl;
    }

    //cout << endl;
    //for (auto x : C) cout << x << ' '; cout << endl;
    //for (auto x : X) cout << x << ' '; cout << endl;
    //for (auto x : Y) cout << x << ' '; cout << endl;
    answer(C, X, Y);
}

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