Submission #764155

#	Time	Username	Problem	Language	Result	Execution time	Memory
764155		t6twotwo	Mechanical Doll (IOI18_doll)	C++17	16 / 100	54 ms	9388 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
void create_circuit(int M, vector<int> A) {
    int N = A.size();
    vector<int> f(M + 1);
    for (int i = 0; i < N; i++) {
        f[A[i]]++;
    }
    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);
}

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