제출 #99971

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

doll

#include <iostream>
#include <vector>
#include "doll.h"
using namespace std;
int l[1000000],r[1000000],num[25],d[1000000],b[1000000];
int qs(int s,int e){
	//cout<<s<<" "<<e<<endl;
	int l=s,r=e,mid=(d[l]+d[r])/2;
	while(l<=r)
	{
		while(d[l]<mid)l++;
		while(d[r]>mid)r--;
		if(l<=r)
		{
			swap(d[l],d[r]);
			swap(b[l],b[r]);
			l++;
			r--;
		}
	}
	if(s<r)qs(s,r);
	if(l<e)qs(l,e);
}
void create_circuit(int M, std::vector<int> A) {
  int n = A.size(); 
  n++;
  A[n-1]=-1;
  int t=1,p=0;
	while(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=t;i>=t-n+1;i--)b[i]=i-1;
	//for(int i=t-n+1;i<=t;i++)cout<<d[i]<<" "<<b[i]<<endl;
	//cout<<endl;
	qs(t-n+1,t);
	//for(int i=t-n+1;i<=t;i++)cout<<d[i]<<" "<<b[i]<<endl;
	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=t-n+1;i<=t;i++)
	{
		//cout<<(t+b[i])/2<<" ";
		if(b[i]%2==1)r[(t+b[i])/2]=A[i-(t-n)-1];
		else l[(t+b[i])/2]=A[i-(t-n)-1];
	}
	//cout<<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;
	r[t-1]=0;
	for(int i=0;i<t-1;i++)X[i]=l[i+1];
	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);
}

컴파일 시 표준 에러 (stderr) 메시지

doll.cpp: In function 'int qs(int, int)':
doll.cpp:23:1: warning: no return statement in function returning non-void [-Wreturn-type]
   23 | }
      | ^

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