제출 #102089

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102089		bert30702	자동 인형 (IOI18_doll)	C++17	73.47 / 100	161 ms	10548 KiB

doll

#include <bits/stdc++.h>
 #include "doll.h"
using namespace std;
const int MX = 4e5 + 1000;
int ptr = 0;
int x[MX], y[MX], c[MX];
//void answer(vector<int> c, vector<int> x, vector<int> y) {
//	cout << 9 << ' ' << x.size() << endl;
//	for(auto it: c) cout << it << ' '; cout << endl;
//	for(auto it: x) cout << it << ' '; cout << endl;
//	for(auto it: y) cout << it << ' '; cout << endl;
//}
int build(vector<int> v) {
	if(v.size() == 1) return v[0];
	if(ptr != 0 and *max_element(v.begin(), v.end()) == *min_element(v.begin(), v.end()) and v[0] == -1) return v[0];
	int d = --ptr;
	vector<int> a, b;
	for(int i = 0; i < v.size(); i ++) {
		if(i & 1) b.push_back(v[i]);
		else      a.push_back(v[i]);
	}
	x[-d] = build(a);
	y[-d] = build(b);
	return d;
}
void create_circuit(int n, vector<int> v) {
	// for(auto it: v) cout << it << ' '; cout << endl;
	vector<int> a(v.begin() + 1, v.end()); a.push_back(0);
	// for(auto it: a) cout << it << ' '; cout << endl;
	int k = max(2, 1 << __lg(a.size() * 2 - 1));
	// cout << " ss " << k << ' ' << a.size() << endl;
	vector<int> tmp(k), GG(k, 0);
	int need = k - a.size();
	for(int i = k / 2; i >= 1; i >>= 1) {
		for(int j = 0; j < k; j += i) {
			if(!GG[j] and need) {
				GG[j] = true, tmp[j] = -1, need --;
			}
		}
	}
	for(int i = k - 1; i >= 0; i --) {
		if(!GG[i]) tmp[i] = a.back(), a.pop_back();
	}
	// for(auto it: tmp) cout << it << ' '; cout << endl;
	build(tmp); c[0] = v[0];
	for(int i = 1; i <= n; i ++) c[i] = -1;
	answer(
		vector<int>(c, c + n + 1),
		vector<int>(x + 1, x + 1 - ptr),
		vector<int>(y + 1, y + 1 - ptr)
	);
}
//main () {
//	// create_circuit(4, {1, 2, 1, 3});
//	create_circuit(1, vector<int> (33, 1));
//}

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

doll.cpp: In function 'int build(std::vector<int>)':
doll.cpp:18:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |  for(int i = 0; i < v.size(); i ++) {
      |                 ~~^~~~~~~~~~

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