제출 #300949

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300949		TMJN	자동 인형 (IOI18_doll)	C++17	0 / 100	7 ms	6860 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
     
static vector<int>X,Y,K;
static int c;
     
int dfs(int num,int dep){
	if(K.size()-1<num+(1<<dep)){
		return K[num];
    }
    else{
    	int t=c;
    	c++;
    	X[t]=dfs(num,dep+1);
    	Y[t]=dfs(num+(1<<dep),dep+1);
    	return -t-1;
    }
}
     
void create_circuit(int M,vector<int>A) {
    X=Y=vector<int>(400000,0);
    K=A;
    c=0;
    for(int i=0;;i++){
    	if((1<<i)>K.size()){
    		while((1<<i)>K.size()){
    			K.push_back(-c-1);
    			c++;
    		}
    		K.back()=0;
    		c--;
    		break;
    	}
    }
    int cc=c;
    int tt=dfs(0,0);
    for(int i=0;i<cc;i++){
    	X[i]=-i-1;
    	Y[i]=tt;
    }
    vector<int>C(M+1,tt);
    //	while(!X.empty()&&X.back()==0xE869120){
    //		X.pop_back();
    //		Y.pop_back();
    //	}
    vector<bool>B(400000,false);
	int p=0;
	vector<int>T;
	do{
		if(p>=0){
			if(p)T.push_back(p);
			p=C[p];
		}
		else{
			if(B[-p-1]){
				p=Y[-p-1];
			}
			else{
				p=X[-p-1];
			}
			B[-p-1]=!B[-p-1];
		}
	}while(p);
	assert(A==T);
	bool f=false;
	for(int i=0;i<400000;i++){
		f|=B[i];
	}
//	assert(!f);
   	answer(C,X,Y);
}

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

doll.cpp: In function 'int dfs(int, int)':
doll.cpp:9:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    9 |  if(K.size()-1<num+(1<<dep)){
      |     ~~~~~~~~~~^~~~~~~~~~~~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:26:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |      if((1<<i)>K.size()){
      |         ~~~~~~^~~~~~~~~
doll.cpp:27:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |       while((1<<i)>K.size()){
      |             ~~~~~~^~~~~~~~~

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