Submission #1244888

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244888		j_vdd16	Mechanical Doll (IOI18_doll)	C++20	10 / 100	0 ms	328 KiB

doll

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <limits.h>

#include "doll.h"

using namespace std;

#define loop(X, N) for (int X = 0; X < (N); X++)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;

int numBits = 0;
int rev(int n) {
    int out = 0;
    for (int i = 0; i < numBits; i++) {
        if (n & (1 << i))
            out |= 1 << (numBits - 1 - i);
    }

    return out;
}

bool cmp(int a, int b) {
    return rev(a) < rev(b);
}

void create_circuit(int m, vi a) {
    vi c; //exits
    vi x, y;

    int n = a.size();
    c.push_back(a[0]);
    
    int pow = 1;
    while (pow < n) {
        numBits++;
        pow *= 2;
    }

    vi order(n);
    for (int i = 0; i < n; i++) {
        order[i] = i;
    }

    sort(order.begin(), order.end(), cmp);

    if (pow == 1) {
        c.push_back(0);
    }
    else {
        vi exits(pow * 2);
        for (int j = 0; j < n - 1; j++) {
            exits[order[j] + pow] = a[j + 1];
        }
        for (int j = n - 1; j < pow - 1; j++) {
            exits[j + pow] = INT_MAX;
        }
        exits[pow - 1 + pow] = 0;

        int nodes = 1;
        for (int j = pow - 1; j >= 1; j--) {
            if (exits[j * 2] == INT_MAX && exits[j * 2 + 1] == INT_MAX) {
                exits[j] = INT_MAX;
            }
            else {
                x.push_back(exits[j * 2]);
                y.push_back(exits[j * 2 + 1]);
                exits[j] = -(nodes++);
            }
        }

        for (int& idx : c) if (idx == INT_MAX) idx = -(nodes - 1);
        for (int& idx : x) if (idx == INT_MAX) idx = -(nodes - 1);
        for (int& idx : y) if (idx == INT_MAX) idx = -(nodes - 1);

        for (int i = 0; i < m; i++)
            c.push_back(-(nodes - 1));
    }
    
    answer(c, x, y);
}

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