제출 #99962

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
99962		tinjyu	자동 인형 (IOI18_doll)	C++14	0 / 100	1 ms	204 KiB

doll

#include <iostream>
#include <vector>
#include "doll.h"
using namespace std;
int l[1000000],r[1000000],num[25],d[1000000];

void create_circuit(int M, std::vector<int> A) {
  int n = A.size(); 
  int t=1,p=0;
	while(t<n)
	{
		t*=2;
		p++;
	}
	if(t==n)
	{
		t*=2;
		p++;
	}
  std::vector<int> C(M + 1);
  C[0] = -1;
  for (int i = 1; i <= M; ++i) {
    C[i] = 1;
  }
  std::vector<int> X(t-1), Y(t-1);
  for (int k = 0; k < n; ++k) {
    X[k] = Y[k] = A[k];
  }
 
	num[1]=-1;
	for(int i=1;i<=t+1;i++)
	{
		num[1]++;
		for(int j=1;j<=p+1;j++)
		{
			if(num[j]==2)
			{
				num[j]=0;
				num[j+1]++;
			}
			else break;
		}
		int q=1;
		for(int j=p;j>=1;j--)
		{
			d[i]+=q*num[j];
			q*=2;
		}
	}
	for(int i=1;i<=t-1;i++)
	{
		l[i]=(i*2)*-1;
		r[i]=(i*2+1)*-1;
		if(i*2>t-1)l[i]=-1;
		if(i*2+1>t-1)r[i]=-1;
	}
	//for(int i=1;i<=t-1;i++)cout<<l[i]<<" ";
	//cout<<endl;
	//for(int i=1;i<=t-1;i++)cout<<r[i]<<" ";
	//cout<<endl;
	for(int i=1;i<=n;i++)
	{
		if(d[i]%2==1)r[(t+d[i])/2]=A[i-1];
		else l[(t+d[i])/2]=A[i-1];
		//cout<<d[i]%2<<" "<<(t+d[i])/2<<endl;
	}
	//for(int i=t/2;i<=t-1;i++)cout<<l[i]<<" "<<r[i]<<" ";
  	//cout<<endl;
	  C[0]=-1;
  	for(int i=1;i<=M;i++)C[i]=-1;
  	if(n==t)C[A[n-1]]=0;
  	else r[t-1]=0;
	//cout<<endl;
	for(int i=0;i<t-1;i++)X[i]=l[i+1];
	//cout<<endl;
	for(int i=0;i<t-1;i++)Y[i]=r[i+1];
	
	for(int i=0;i<t-1;i++)cout<<X[i]<<" ";
	cout<<endl;
	for(int i=0;i<t-1;i++)cout<<Y[i]<<" ";
	cout<<endl;
  	answer(C, X, Y);
}

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