제출 #1210039

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1210039		Aviansh	자동 인형 (IOI18_doll)	C++20	37 / 100	78 ms	12604 KiB

doll

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

using namespace std;
int n;
int cn;
vector<int>x;
vector<int>y;

int create(vector<int>req){
    if(req.size()==1){
        return req[0];
    }
    cn--;
    int curr = cn;
    vector<int>reqx,reqy;
    for(int i = 0;i<req.size();i++){
        if(i%2){
            reqy.push_back(req[i]);
        }
        else{
            reqx.push_back(req[i]);
        }
    }
    if(reqx.size()!=reqy.size()){
        reqy.push_back(reqx[reqx.size()-1]);
        reqx[reqx.size()-1]=curr;
    }
    x.push_back(-1e9);
    y.push_back(-1e9);
    int retx = create(reqx);
    x[-curr-1]=retx;
    int rety = create(reqy);
    y[-curr-1]=rety;
    return curr;
}

void create_circuit(int m, vector<int> a) {
    vector<int>c(m+1);
    a.push_back(0);
    n=a.size();
    cn=0;
    x.clear();
    y.clear();
    int node = create(a);
    for(int i = 0;i<=m;i++){
        c[i]=node;
    }
    answer(c,x,y);
}

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