제출 #139239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
139239		qrno	자동 인형 (IOI18_doll)	C++14	6 / 100	67 ms	7316 KiB

doll

#include "doll.h"

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

const int MAXN = 100100;
const int INF = 123456;

int app[MAXN];
bool secondTime[MAXN];

void printAns(vector<int> C, vector<int> X, vector<int> Y) {
    cout << "C: ";
    for (int x : C)
        cout << x << " ";
    cout << endl;

    cout << "(X, Y): ";
    for (int i = 0; i < (int)X.size(); i++) {
        cout << "(" << X[i] << ", "
            << Y[i] << ") ";
    }
    cout << endl;
}

void create_circuit(int M, std::vector<int> A) {

    A.push_back(0);
    int reqTrig = A.size();

    memset(app, 0, sizeof(app));
    memset(secondTime, false, sizeof(secondTime));

    vector<int> C(M + 1, INF);
    vector<int> X, Y;

    for (int x : A)
        app[x]++;

    int sCount = -1;

    C[0] = A[0];
    for (int i = 0; i < reqTrig-1; i++) {
        int now = A[i];
        int nex = A[i+1];

        if (secondTime[now]) {
            Y[-C[now]-1] = nex;
        } else if (app[A[i]] == 2) {
            C[now] = sCount;
            sCount -= 1;

            X.push_back(nex);
            Y.push_back(-1);
        } else {
            C[now] = nex;
        }

        secondTime[now] = true;
    }

    for (int i = 1; i <= M; i++) {
        if (C[i] == INF)
            C[i] = 0;
    }

    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