제출 #101934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
101934		daniel920712	자동 인형 (IOI18_doll)	C++14	100 / 100	149 ms	12596 KiB

doll

#include "doll.h"
#include <vector>
#include <stdio.h>

using namespace std;
int con[1000005]={0};
int This[1000005]={0};
int m[1000005];
int n[1000005];
int start[1000005]={0};
vector < int > C,x,y;
int X[1000005]={0};
int Y[1000005]={0};
int now=1;
int t[1000005]={0};
int how[1000005]={0};
void build(int N,int one,int here,int what)
{
    if(one==1)
    {
        Y[-here]=0;
        if(N==2) X[-here]=0;
        else X[-here]=what;
    }
    else
    {
        if(N<=one) X[-here]=what;
        else
        {
            X[-here]=(-now);
            now++;
        }
        Y[-here]=(-now);
        now++;
        if(N>one)
        {
            build(N-one,one/2,X[-here],what);
            build(one,one/2,Y[-here],what);
        }
        else build(N,one/2,Y[-here],what);

    }
}
void New(int here,int what)
{
    //printf("%d ",here);
    if(how[-here]%2==0)
    {
        how[-here]++;
        if(X[-here]) New(X[-here],what);
        else X[-here]=what;
    }
    else
    {
        how[-here]++;
        if(Y[-here]) New(Y[-here],what);
        else Y[-here]=what;
    }
}
void create_circuit(int M, vector < int > A)
{
    int N=A.size(),i,temp,t=1,big=0;
    C.push_back(A[0]);
    for(i=1;i<=M;i++) C.push_back(i);
    for(i=0;i<N;i++)
    {
        con[A[i]]++;
        big=max(big,con[A[i]]);
    }
    A.push_back(0);
    if(big<=4)
    {
        for(i=0;i<N;i++)
        {
            if(con[A[i]]==1) C[A[i]]=A[i+1];
            else
            {
                if(!This[A[i]])
                {
                    C[A[i]]=-now;
                    now++;
                    temp=1;
                    while(temp<con[A[i]]) temp*=2;
                    build(con[A[i]],temp/2,C[A[i]],C[A[i]]);
                }
                This[A[i]]++;
                New(C[A[i]],A[i+1]);
            }
        }
    }
    else
    {
       while(t<N) t*=2;

        now++;
        build(N,t/2,-1,-1);
        for(i=0;i<N;i++)
        {
            C[A[i]]=-1;
            //printf("a%d: ",i);
            New(C[A[i]],A[i+1]);
            //printf("\n");
        }
    }



    //for(i=1;i<now;i++) printf("%d %d %d\n",-i,X[i],Y[i]);
    for(i=1;i<now;i++) x.push_back(X[i]);
    for(i=1;i<now;i++) y.push_back(Y[i]);
    answer(C,x,y);

}

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