oj.uz

답안 #828886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828886 2023-08-17T18:29:21 Z HamletPetrosyan 자동 인형 (IOI18_doll) C++17
10 / 100
 19 ms 14952 KB 
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;

#define len(a) ((int)(a).size())
#define pii pair<int, int>
#define fr first
#define sc second

int n, avl, logn;
vector<int> X, Y;
vector<pii> HRT;
int CNTR = -1, S = 0;

bool dfs(int v, int x, int y, int h){
	if(h >= logn - 1){
		HRT[y] = {v, x};
		HRT[y + (1 << (logn - 1))] = {v, x + 1};
		if(x + 1 < avl) return false;
		if(x < avl) X[-v - 1] = -1;
		S++;
		return true;
	}
	int rch = --CNTR;
	if(!dfs(rch, x + (1 << (logn - h - 1)), y + (1 << h), h + 1)) return false;
	Y[-v - 1] = rch;
	int lch = --CNTR;
	if(!dfs(lch, x, y, h + 1)){
		X[-v - 1] = -1;
		S++;
		return true;
	}
	X[-v - 1] = lch;
	S++;
	return true;
}

void create_circuit(int M, vector<int> A) {
	n = A.size();
	vector<int> C(M + 1);
	C[0] = A[0];
	for (int i = 1; i <= M; ++i) C[i] = -1;
	logn = ceil(log2(n));
	avl = (1 << logn) - n;

	X.resize(3 * n);
	Y.resize(3 * n);
	HRT.resize(3 * n);
	dfs(-1, 0, 0, 0);

	X.resize(S);
	Y.resize(S);

	if(n == 1){
		C[A[0]] = 0;
		answer(C, X, Y);
		return;
	}

	// cout << avl << "\n";

	int avlcnt = 0;
	for(int i = 0, v, x, ind; i < len(HRT); i++){
		// cout << "(" << HRT[i].fr << ", " << HRT[i].sc << ") ";
		v = -HRT[i].fr - 1;
		x = HRT[i].sc;
		if(x < avl){
			avlcnt++;
			continue;
		}
		ind = i - avlcnt + 1;
		if(x % 2) Y[v] = (ind == n) ? 0 : A[ind];
		else X[v] = (ind == n) ? 0 : A[ind]; 
	}

	// cout << endl;
	// for(auto h : C) cout << h << " ";
	// cout << endl << endl;
	// for(auto h : X) cout << h << " ";
	// cout << endl;
	// for(auto h : Y) cout << h << " ";
	// cout << endl;

	answer(C, X, Y);
}

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 10 ms 8448 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 10 ms 8448 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 10 ms 8448 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #5
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 19 ms 14952 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 19 ms 14952 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -