제출 #1045000

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1045000		RecursiveCo	자동 인형 (IOI18_doll)	C++17	6 / 100	43 ms	11340 KiB

doll

#include <bits/stdc++.h>
#include "doll.h"

using namespace std;

#define out(o) cout << o

void create_circuit(int M, vector<int> A) {
    int N = A.size();
    A.push_back(0);
    vector<vector<int>> occ(M + 1);
    for (int i = 0; i < N; i++) occ[A[i]].push_back(i);
    vector<bool> equal(M + 1, true);
    for (int i = 1; i <= M; i++) {
        int s = occ[i].size();
        for (int j = 1; j < s; j++) if (A[occ[i][j] + 1] != A[occ[i][j - 1] + 1]) equal[i] = false;
    }
    vector<int> C(M + 1, 0);
    vector<int> X;
    vector<int> Y;
    int S = 0;
    C[0] = A[0];
    for (int i = 0; i < N; i++) {
        if (occ[A[i]].size() == 1 || equal[A[i]]) C[A[i]] = A[i + 1];
        else if (occ[A[i]][0] == i) {
            if (occ[A[i]].size() == 2) {
                S++;
                X.push_back(A[i + 1]);
                Y.push_back(A[occ[A[i]][1] + 1]);
                C[A[i]] = -S;
            } else if (occ[A[i]].size() == 3) {
                S++;
                X.push_back(A[i + 1]);
                Y.push_back(-(S + 1));
                S++;
                X.push_back(A[occ[A[i]][1] + 1]);
                Y.push_back(-(S + 2));
                S++;
                X.push_back(A[occ[A[i]][2] + 1]);
                Y.push_back(-S);
                C[A[i]] = -S;
            } else {
                S++;
                X.push_back(-(S + 1));
                Y.push_back(-(S + 2));
                S++;
                X.push_back(A[i + 1]);
                Y.push_back(A[occ[A[i]][2] + 1]);
                S++;
                X.push_back(A[occ[A[i]][1] + 1]);
                Y.push_back(A[occ[A[i]][3] + 1]);
                C[A[i]] = -S;
            }
        }
    }
    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