oj.uz

답안 #779503

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779503 2023-07-11T13:30:08 Z amunduzbaev 자동 인형 (IOI18_doll) C++17
84 / 100
 128 ms 14568 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;
		}
	}
	
	fill(used.begin() + sz, used.end(), -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++){
		used[sz + p[i]] = a[i];
	}
	
	assert(last <= n - 1 + __lg(n - 1));
	//~ assert(last <= 2 * (n - 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];
	}
	
	//~ a.pop_back();
	//~ assert(check(c, x, y, a));
	
	answer(c, x, y);
}

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 49 ms 7056 KB Output is correct
3 Correct 47 ms 6676 KB Output is correct
4 Correct 3 ms 212 KB Output is correct
5 Correct 8 ms 1364 KB Output is correct
6 Correct 64 ms 8624 KB Output is correct
7 Runtime error 1 ms 340 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 49 ms 7056 KB Output is correct
3 Correct 47 ms 6676 KB Output is correct
4 Correct 3 ms 212 KB Output is correct
5 Correct 8 ms 1364 KB Output is correct
6 Correct 64 ms 8624 KB Output is correct
7 Runtime error 1 ms 340 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 49 ms 7056 KB Output is correct
3 Correct 47 ms 6676 KB Output is correct
4 Correct 3 ms 212 KB Output is correct
5 Correct 8 ms 1364 KB Output is correct
6 Correct 64 ms 8624 KB Output is correct
7 Runtime error 1 ms 340 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 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 300 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 88 ms 11476 KB Output is correct
3 Correct 93 ms 11360 KB Output is correct
4 Correct 114 ms 14060 KB Output is correct

Subtask #6
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 88 ms 11476 KB Output is correct
3 Correct 93 ms 11360 KB Output is correct
4 Correct 114 ms 14060 KB Output is correct
5 Correct 119 ms 14568 KB Output is correct
6 Correct 117 ms 14396 KB Output is correct
7 Correct 128 ms 14436 KB Output is correct
8 Correct 114 ms 14304 KB Output is correct
9 Correct 90 ms 11464 KB Output is correct
10 Correct 114 ms 14168 KB Output is correct
11 Correct 116 ms 14080 KB Output is correct
12 Correct 102 ms 11588 KB Output is correct
13 Correct 90 ms 11552 KB Output is correct
14 Correct 92 ms 11584 KB Output is correct
15 Correct 93 ms 11728 KB Output is correct
16 Correct 3 ms 700 KB Output is correct
17 Correct 88 ms 11964 KB Output is correct
18 Correct 87 ms 11436 KB Output is correct
19 Correct 87 ms 11468 KB Output is correct
20 Correct 116 ms 14168 KB Output is correct
21 Correct 124 ms 14188 KB Output is correct
22 Correct 114 ms 14112 KB Output is correct