Submission #1209530

#	Time	Username	Problem	Language	Result	Execution time	Memory
1209530		Aviansh	자동 인형 (IOI18_doll)	C++20	16 / 100	47 ms	11192 KiB

doll

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

using namespace std;

void create_circuit(int m, vector<int> a) {
    vector<int>c(m+1);
    vector<int>x;
    vector<int>y;
    vector<int>nxs[m+1];
    int n = a.size();
    for(int i = 0;i<n-1;i++){
        nxs[a[i]].push_back(a[i+1]);
    }
    nxs[a[n-1]].push_back(0);
    nxs[0].push_back(a[0]);
    for(int i = 0;i<=m;i++){
        if(nxs[i].size()==1){
            c[i]=nxs[i][0];
        }
        if(nxs[i].size()==2){
            x.push_back(nxs[i][0]);
            y.push_back(nxs[i][1]);
            c[i]=-x.size();
        }
        if(nxs[i].size()==3){
            int t = x.size();
            t++;
            x.push_back(-t-1);
            x.push_back(nxs[i][0]);
            x.push_back(nxs[i][1]);
            y.push_back(-t-2);
            y.push_back(-t);
            y.push_back(nxs[i][2]);
            c[i]=-t;
        }
        if(nxs[i].size()==4){
            int t = x.size();
            t++;
            x.push_back(-t-1);
            x.push_back(nxs[i][0]);
            x.push_back(nxs[i][1]);
            y.push_back(-t-2);
            y.push_back(nxs[i][2]);
            y.push_back(nxs[i][3]);
            c[i]=-t;
        }
    }
    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