제출 #117532

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

doll

#include <bits/stdc++.h>

using namespace std;

void answer(vector<int> C, vector<int> X, vector<int> Y);

vector<int> C, X, Y;

int rev(int r, int st){
	int ret = 0, i = 0;

	while(r > 0){
		if(r & 1){
			ret += (1 << (st - 1 - i));
		}

		i++;
		r /= 2;
	}

	return ret;
}

void create_circuit(int M, vector<int> A){
	for(int i = 0; i < M; i++){
		C.push_back(0);
	}
	C.push_back(0);

	int st = 0;

	while((1 << st) < (int)A.size()){
		st++;
	}

	int t;

	if(st == 0){
		t = 1;
	}
	else{
		t = (1 << (st - 1));
	}

	for(int i = 0; i < t - 1; i++){
		X.push_back(-(2 * i + 2));
		Y.push_back(-(2 * i + 3));
	}

	for(int i = 0; i < t; i++){
		int r = 2 * i;

		r = rev(r, st);

		if(r < (int)A.size()){
			X.push_back(A[r]);
		}
		else{
			X.push_back(0);
		}

		r = 2 * i + 1;

		r = rev(r, st);

		if(r < (int)A.size()){
			Y.push_back(A[r]);
		}
		else{
			Y.push_back(0);
		}
	}

	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