oj.uz

Submission #1048329

# Submission time Handle Problem Language Result Execution time Memory
1048329 2024-08-08T06:48:32 Z Alihan_8 Mechanical Doll (IOI18_doll) C++17
47 / 100
 178 ms 28072 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);
	
	{ // 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);
			}
			
			assert(X[v - 1] != -1 && Y[v - 1] != -1);
			
			x = dfs(dfs, L[v]) | dfs(dfs, R[v]);
			
			return x;
		};
		
		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]);
				} else x[u - 1] = -1;
				
				if ( good[R[v]] ){
					y[u - 1] = -get(R[v]);
				} else y[u - 1] = -1;
				
				trav(trav, L[v]); 
				trav(trav, R[v]);
			}
			
			return u;
		};
		
		trav(trav, 1);
		
		answer(C, x, y);
	}
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB Output is partially correct
2 Correct 73 ms 14788 KB Output is correct
3 Partially correct 151 ms 26056 KB Output is partially correct
4 Partially correct 161 ms 27704 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB Output is partially correct
2 Correct 73 ms 14788 KB Output is correct
3 Partially correct 151 ms 26056 KB Output is partially correct
4 Partially correct 161 ms 27704 KB Output is partially correct
5 Partially correct 164 ms 28072 KB Output is partially correct
6 Partially correct 157 ms 27964 KB Output is partially correct
7 Partially correct 178 ms 28036 KB Output is partially correct
8 Partially correct 159 ms 27704 KB Output is partially correct
9 Partially correct 161 ms 25916 KB Output is partially correct
10 Partially correct 160 ms 27704 KB Output is partially correct
11 Partially correct 151 ms 27708 KB Output is partially correct
12 Partially correct 163 ms 26056 KB Output is partially correct
13 Correct 78 ms 14952 KB Output is correct
14 Partially correct 151 ms 26168 KB Output is partially correct
15 Partially correct 160 ms 26424 KB Output is partially correct
16 Partially correct 3 ms 1112 KB Output is partially correct
17 Correct 80 ms 14748 KB Output is correct
18 Correct 73 ms 14660 KB Output is correct
19 Partially correct 156 ms 26052 KB Output is partially correct
20 Partially correct 169 ms 27676 KB Output is partially correct
21 Partially correct 156 ms 27704 KB Output is partially correct
22 Partially correct 162 ms 27808 KB Output is partially correct