oj.uz

Submission #779461

# Submission time Handle Problem Language Result Execution time Memory
779461 2023-07-11T12:54:05 Z amunduzbaev Mechanical Doll (IOI18_doll) C++17
84 / 100
 120 ms 15144 KB 
#include "doll.h"
#include "bits/stdc++.h"
using namespace std;

#ifndef EVAL
#include "grader.cpp"
#endif

#define ar array
typedef int64_t ll;
typedef int32_t ii;
//~ #define int ll

void create_circuit(ii m, vector<ii> a){
	a.push_back(0);
	int n = a.size(); 
	
	int sz = 1;
	while(sz <= n) sz <<= 1;
	vector<int> used(sz * 2);
	function<void(int, int, int)> dfs = [&](int lx, int rx, int x){
		if(rx + n <= sz){
			return;
		}
		used[x] = 1;
		if(lx == rx){
			return;
		}
		
		int m = (lx + rx) >> 1;
		dfs(lx, m, x << 1);
		dfs(m + 1, rx, x << 1 | 1);
	};
	
	dfs(1, sz, 1);
	
	vector<int> sw(sz * 2), pos(sz);
	for(int i=0;i<sz;i++){
		function<void(int, int, int)> go = [&](int x, int lx, int rx){
			if(lx == rx){
				pos[lx] = i;
				return;
			}
			
			int m = (lx + rx) >> 1;
			if(sw[x]) go(x << 1 | 1, m + 1, rx);
			else go(x << 1, lx, m);
			
			sw[x] ^= 1;
		};
		
		go(1, 0, sz - 1);
	}
	
	int last = 0;
	vector<int> id;
	for(int i=0;i<sz;i++){
		if(used[i]){
			used[i] = -(++last);
			id.push_back(i);
		} else {
			used[i] = -1;
		}
	}
	
	vector<int> p(n); 
	iota(p.begin(), p.end(), sz - n);
	sort(p.begin(), p.end(), [&](int i, int j){
		return pos[i] < pos[j];
	});
	//~ for(int i=0;i<n;i++) cout<<a[i]<<" ";
	//~ cout<<"\n";
	for(int i=0;i<n;i++){
		used[sz + p[i]] = a[i];
	}
	for(int i=0;i<sz - n;i++){
		used[sz + i] = -1;
	}
	
	vector<int> c(m + 1, -1), x(last), y(last);
	for(int i=0;i<last;i++){
		x[i] = used[id[i] << 1];
		y[i] = used[id[i] << 1 | 1];
	}
	
	answer(c, x, y);
	//~ for(int i=0;i<=m;i++) cout<<c[i]<<" ";
	//~ cout<<"\n";
	//~ for(int i=0;i<last;i++){
		//~ cout<<x[i]<<" "<<y[i]<<"\n";
	//~ }
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 61 ms 7052 KB Output is correct
3 Correct 47 ms 6660 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 1364 KB Output is correct
6 Correct 60 ms 8568 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 61 ms 7052 KB Output is correct
3 Correct 47 ms 6660 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 1364 KB Output is correct
6 Correct 60 ms 8568 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 61 ms 7052 KB Output is correct
3 Correct 47 ms 6660 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 1364 KB Output is correct
6 Correct 60 ms 8568 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 87 ms 11428 KB Output is correct
3 Correct 86 ms 11468 KB Output is correct
4 Correct 113 ms 14616 KB Output is correct

Subtask #6
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 87 ms 11428 KB Output is correct
3 Correct 86 ms 11468 KB Output is correct
4 Correct 113 ms 14616 KB Output is correct
5 Correct 118 ms 15144 KB Output is correct
6 Correct 116 ms 14896 KB Output is correct
7 Correct 118 ms 15016 KB Output is correct
8 Correct 113 ms 14760 KB Output is correct
9 Correct 96 ms 11504 KB Output is correct
10 Correct 120 ms 14764 KB Output is correct
11 Correct 111 ms 14620 KB Output is correct
12 Correct 87 ms 11424 KB Output is correct
13 Correct 90 ms 11624 KB Output is correct
14 Correct 89 ms 11680 KB Output is correct
15 Correct 97 ms 11756 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 89 ms 12056 KB Output is correct
18 Correct 89 ms 11468 KB Output is correct
19 Correct 90 ms 11504 KB Output is correct
20 Correct 113 ms 14744 KB Output is correct
21 Correct 116 ms 14744 KB Output is correct
22 Correct 111 ms 14652 KB Output is correct