oj.uz

답안 #1048308

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048308 2024-08-08T06:38:05 Z Alihan_8 자동 인형 (IOI18_doll) C++17
47 / 100
 101 ms 12740 KB 
#include "doll.h"

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define ln '\n'
#define all(x) x.begin(), x.end() 

template <class F, class S>
bool chmax(F &u, const S &v){
	bool flag = false;
	
	if ( u < v ){
		u = v; flag |= true;
	}
	
	return flag;
}

void create_circuit(int m, std::vector<int> A) {
	int n = A.size(), x = (n + 1) / 2;
	
	int lg = __lg(x);
	
	if ( (1 << lg) < x ) ++lg;
	
	vector <int> L(2 * n), R(2 * n);
	
	int ct = 0;
	
	auto build_tree = [&](auto build_tree, int v, int d) -> void{
		chmax(ct, v);
		
		L[v] = R[v] = -1;
		
		if ( d == 0 ) return;
		
		L[v] = v * 2, R[v] = v * 2 + 1;
		
		build_tree(build_tree, v * 2, d - 1);
		build_tree(build_tree, v * 2 + 1, d - 1);
	};
	
	build_tree(build_tree, 1, lg);
	
	vector <int> C(m + 1, -1), X(ct), Y(ct);
	
	C[0] = A[0];
	
	vector <int> state(ct + 1);
	
	auto f = [&](int v){
		return v - (1 << lg) + 1;
	};
	
	auto dfs = [&](auto dfs, int v, int p) -> void{
		state[v] ^= 1;
		
		if ( v == ct && !state[v] ){ // last Vertex
			Y[v - 1] = 0; return;
		}
		
		if ( L[v] == -1 ){ // leaf vertex
			if ( state[v] > 0 ){
				X[v - 1] = (p < n && f(v) < n ? A[p] : -1);
			} else Y[v - 1] = (p < n && f(v) < n ? A[p] : -1);
			
			dfs(dfs, 1, p + 1);
			
			return;
		}
		
		X[v - 1] = -L[v];
		Y[v - 1] = -R[v];
		
		if ( state[v] ){
			dfs(dfs, L[v], p);
		} else dfs(dfs, R[v], p);
	};
	
	dfs(dfs, 1, 1);
	
	answer(C, X, Y); return;
	
	{ // compressing 
		vector <int> good(ct + 1);
		
		auto dfs = [&](auto dfs, int v) -> int{
			auto &x = good[v]; 
			
			if ( L[v] == -1 ){ // leaf
				return x = (X[v - 1] != -1 || Y[v - 1] != -1);
			}
			
			return x = (dfs(dfs, L[v]) || dfs(dfs, R[v]));
		};
		
		dfs(dfs, 1);
		
		int cnt = 0;
		
		map <int,int> id;
		
		vector <int> x, y;
		
		auto get = [&](int u){
			if ( !id.count(u) ){
				id[u] = ++cnt;
				x.pb(0), y.pb(0);
			} return id[u];
		};
		
		auto trav = [&](auto trav, int v) -> int{
			int u = get(v);
			
			if ( L[v] == -1 ){ // leaf
				x[u - 1] = X[v - 1];
				y[u - 1] = Y[v - 1];
			} else{
				if ( good[L[v]] ){
					x[u - 1] = -get(L[v]);
				} 
				
				if ( good[R[v]] ){
					y[u - 1] = -get(R[v]);
				}
				
				trav(trav, L[v]); 
				trav(trav, R[v]);
			}
			
			return u;
		};
		
		trav(trav, 1);
		
		for ( int i = 0; i <= m; i++ ){
			cout << i << " " << C[i] << ln;
		}
		
		for ( int i = 0; i < (int)id.size(); i++ ){
			cout << -(i + 1) << ' ' << x[i] << ln;
			cout << -(i + 1) << " " << y[i]  << ln; 
		}	
		
		answer(C, x, y);
	}
}

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB Output is partially correct
2 Correct 43 ms 7128 KB Output is correct
3 Partially correct 82 ms 10720 KB Output is partially correct
4 Partially correct 101 ms 12116 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB Output is partially correct
2 Correct 43 ms 7128 KB Output is correct
3 Partially correct 82 ms 10720 KB Output is partially correct
4 Partially correct 101 ms 12116 KB Output is partially correct
5 Partially correct 89 ms 12740 KB Output is partially correct
6 Partially correct 93 ms 12400 KB Output is partially correct
7 Partially correct 89 ms 12628 KB Output is partially correct
8 Partially correct 93 ms 12604 KB Output is partially correct
9 Partially correct 86 ms 10716 KB Output is partially correct
10 Partially correct 89 ms 12372 KB Output is partially correct
11 Partially correct 87 ms 12112 KB Output is partially correct
12 Partially correct 86 ms 10704 KB Output is partially correct
13 Correct 45 ms 7252 KB Output is correct
14 Partially correct 85 ms 10836 KB Output is partially correct
15 Partially correct 85 ms 10836 KB Output is partially correct
16 Partially correct 2 ms 600 KB Output is partially correct
17 Correct 43 ms 7136 KB Output is correct
18 Correct 44 ms 6996 KB Output is correct
19 Partially correct 81 ms 10700 KB Output is partially correct
20 Partially correct 98 ms 12372 KB Output is partially correct
21 Partially correct 87 ms 12268 KB Output is partially correct
22 Partially correct 90 ms 12112 KB Output is partially correct