Submission #764234

#	Time	Username	Problem	Language	Result	Execution time	Memory
764234		t6twotwo	Mechanical Doll (IOI18_doll)	C++17	35 / 100	79 ms	13076 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> ord(int lg) {
    int N = 1 << lg;
    vector<int> ans(N), s(N);
    int x = 1, t = 0;
    while (1) {
        if (x >= N) {
            ans[x - N] = t++;
            if (x == 2 * N - 1) {
                break;
            }
            x = 1;
        } else {
            if (s[x] == 0) {
                s[x] = 1;
                x = x * 2;
            } else {
                s[x] = 0;
                x = x * 2 + 1;
            }
        }
    }
    return ans;
}
void create_circuit(int M, vector<int> A) {
    int N = A.size();
    if (N == 16) {
        vector<int> C(M + 1, -1), X(15), Y(15);
        for (int i = 0; i < 7; i++) {
            X[i] = ~(2 * i + 1);
            Y[i] = ~(2 * i + 2);
        }
        C[0] = A[0];
        auto a = ord(4);
        for (int i = 0; i < 8; i++) {
            X[i + 7] = A[a[i * 2] + 1];
            Y[i + 7] = i == 7 ? 0 : A[a[i * 2 + 1] + 1];
        }
        answer(C, X, Y);
        return;
    }
    vector<int> f(M + 1);
    for (int i = 0; i < N; i++) {
        f[A[i]]++;
    }
    if (*max_element(f.begin(), f.end()) <= 4) {
        vector<int> S1(M + 1), S2(M + 1), S3(M + 1);
        int K = 0;
        for (int i = 1; i <= M; i++) {
            if (f[i] == 2) {
                S1[i] = K++;
            } else if (f[i] > 2) {
                S1[i] = K++;
                S2[i] = K++;
                S3[i] = K++;
            }
        }
        vector<int> X(K), Y(K), C(M + 1);
        for (int i = 1; i <= M; i++) {
            if (f[i] > 1) {
                C[i] = ~S1[i];
                if (f[i] > 2) {
                    X[S1[i]] = ~S2[i];
                    Y[S1[i]] = ~S3[i];
                    if (f[i] == 3) {
                        Y[S2[i]] = ~S1[i];
                    }
                }
            }
        }
        C[0] = A[0];
        vector<int> cnt(M + 1);
        for (int i = 0; i < N; i++) {
            if (f[A[i]] == 1) {
                C[A[i]] = i + 1 < N ? A[i + 1] : 0;
            } else if (f[A[i]] == 2) {
                if (cnt[A[i]] == 0) {
                    X[S1[A[i]]] = A[i + 1];
                } else {
                    Y[S1[A[i]]] = i + 1 < N ? A[i + 1] : 0;
                }
            } else if (f[A[i]] == 3) {
                if (cnt[A[i]] == 0) {
                    X[S2[A[i]]] = A[i + 1];
                } else if (cnt[A[i]] == 1) {
                    X[S3[A[i]]] = A[i + 1];
                } else {
                    Y[S3[A[i]]] = i + 1 < N ? A[i + 1] : 0;
                }
            } else if (f[A[i]] == 4) {
                if (cnt[A[i]] == 0) {
                    X[S2[A[i]]] = A[i + 1];
                } else if (cnt[A[i]] == 1) {
                    X[S3[A[i]]] = A[i + 1];
                } else if (cnt[A[i]] == 2) {
                    Y[S2[A[i]]] = A[i + 1];
                } else {
                    Y[S3[A[i]]] = i + 1 < N ? A[i + 1] : 0;
                }
            }
            cnt[A[i]]++;
        }
        answer(C, X, Y);
        return;
    }
    if (M == 1) {
        int lg = __lg(N - 1) + 1;
        int K = 1 << lg;
        vector<int> C{1, -1}, X(K - 1, -1), Y(K - 1, -1);
        for (int i = 0; i < (K / 2) - 1; i++) {
            X[i] = ~(2 * i + 1);
            Y[i] = ~(2 * i + 2);
        }
        auto a = ord(lg);
        for (int i = 0; i < K / 2; i++) {
            if (a[i * 2] < N - 1) {
                X[i + K / 2 - 1] = 1;
            }
            if (a[i * 2 + 1] < N - 1) {
                Y[i + K / 2 - 1] = 1;
            }
        }
        Y[K - 2] = 0;
        answer(C, X, Y);
        return;
    }
    vector<vector<int>> pos(M + 1);
    for (int i = 0; i < N; i++) {
        pos[A[i]].push_back(i);
    }
    vector<int> C(M + 1), X, Y;
    C[0] = A[0];
    for (int i = 1; i <= M; i++) {
        if (!f[i]) {
            continue;
        }
        if (f[i] == 1) {
            C[i] = pos[i][0] + 1 < N ? A[pos[i][0] + 1] : 0;
            continue;
        }
        int T = X.size();
        int lg = __lg(f[i] - 1) + 1;
        int K = 1 << lg;
        auto a = ord(lg);
        X.resize(T + K - 1, ~T);
        Y.resize(T + K - 1, ~T);
        C[i] = ~T;
        for (int j = 0; j < K / 2; j++) {
            if (a[j * 2] < f[i]) {
                X[T + j + K / 2 - 1] = pos[i][a[j * 2]] + 1 < N ? A[pos[i][a[j * 2]] + 1] : 0;
            }
            if (a[j * 2 + 1] < f[i]) {
                Y[T + j + K / 2 - 1] = pos[i][a[j * 2 + 1]] + 1 < N ? A[pos[i][a[j * 2 + 1]] + 1] : 0;
            }
        }
    }
    answer(C, X, Y);
}

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