제출 #612097

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
612097		Jomnoi	자동 인형 (IOI18_doll)	C++17	16 / 100	89 ms	14260 KiB

doll

#include <bits/stdc++.h>
#include "doll.h"
using namespace std;

const int MAX_M = 1e5 + 5;

int N, M, S;
vector <int> nxt[MAX_M];
vector<int> C, X, Y;

void create_circuit(int m, vector <int> A) {
    N = A.size(), M = m;
    C.resize(M + 1);

    A.push_back(0);
    for(int i = 0; i < N; i++) {
        nxt[A[i]].push_back(A[i + 1]);
    }

    C[0] = A[0];
    for(int a = 1; a <= M; a++) {
        if(nxt[a].empty()) {
            continue;
        }
        else if(nxt[a].size() == 1) {
            C[a] = nxt[a][0];
        }
        else {
            S++;
            C[a] = -S;
            if(nxt[a].size() == 2) {
                X.push_back(nxt[a][0]);
                Y.push_back(nxt[a][1]);
            }
            else if(nxt[a].size() == 3) {
                X.push_back(-(++S));
                Y.push_back(-(++S));

                X.push_back(nxt[a][0]);
                Y.push_back(-(S - 2));

                X.push_back(nxt[a][1]);
                Y.push_back(nxt[a][2]);
            }
            else if(nxt[a].size() == 4) {
                X.push_back(-(++S));
                Y.push_back(-(++S));

                X.push_back(nxt[a][0]);
                Y.push_back(nxt[a][2]);

                X.push_back(nxt[a][1]);
                Y.push_back(nxt[a][3]);
            }
        }
    }

    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