제출 #836031

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
836031		Kerim	자동 인형 (IOI18_doll)	C++17	53 / 100	99 ms	24880 KiB

doll

#include "doll.h"
#include "bits/stdc++.h"
#define pb(x) push_back(x)
using namespace std;
const int N = 4e5+5;
vector<int> X, Y;
vector<int> adj[N];
int who[N], sw[N], S;
 
void f(int nd, int pos, int pw, int id){
    if (!pw){
        who[pos] = id;
        return;
    }
    sw[nd] ^= 1;
    if (sw[nd])
        f(nd*2, pos, pw/2, id);
    else
        f(nd*2+1, pos+pw, pw/2, id);
}
int get_switch(){
    return --S;
}
int get_root(vector<int> &values){
    int sz = values.size();
    if (sz == 0)
        return 0;
    if (sz == 1)
        return values[0];
    int pw = 1;
    while (pw < sz) pw *= 2;
    for (int i = 0; i < pw; i++)
        f(1, 0, pw/2, i);
    int root = get_switch();
    int to_the_root = pw - sz;
    for (int i = 1; i < pw / 2; i++){
        X.push_back(get_switch());
        Y.push_back(get_switch());
    }
    for (int i = 0; i < pw / 2; i++){
        int l = i * 2;
        int r = i * 2 + 1;
        if (who[l] < to_the_root) X.push_back(root);
        else X.push_back(values[who[l] - to_the_root]);
        if (who[r] < to_the_root) Y.push_back(root);
        else Y.push_back(values[who[r] - to_the_root]);
    }
    return root;
}
void create_circuit(int M, vector<int> A) {
    vector<int> C(M + 1);
    int N = A.size();
    if (N == 16 and 1 == 0){
        A.push_back(0);
        int one_root =  get_root(A);
        for (int i = 0; i <= M; ++i)
            C[i] = one_root;
    }
    else{
        adj[0].pb(A[0]);
        for (int i = 0; i < N - 1; i++)
            adj[A[i]].pb(A[i+1]);
        adj[A[N-1]].pb(0);
        for (int i = 0; i <= M; ++i)
            C[i] = get_root(adj[i]);
    }
    answer(C, X, Y);
}

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