oj.uz

답안 #481378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
481378 2021-10-20T14:21:59 Z HamletPetrosyan Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 488 KB 
#include <bits/stdc++.h>
using namespace std;

#include "messy.h"

int n, w, r;
vector<int> res;

void add_all_elements(int l, int r){
	if(l == r) return;

	string s(n, '1');
	for(int i = l; i <= r; i++) {
		s[i] = '0';
	}
	int mid = (l + r) / 2;
	for(int i = l; i <= mid; i++){
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}
	add_all_elements(l, mid);
	add_all_elements(mid + 1, r);
}

void get_positions(int l, int r, string s){
	// cout << l << " " << r << " - " << s << endl;
	string now = s;
	if(l == r - 1){
		bool doit = false;
		for(int i = 0; i < n; i++){
			if(s[i] == '0'){
				if(doit){
					now[i] = '1';
					break;
				}
				s[i] = '1';
				if(check_element(s)){
					now[i] = '1';
					s[i] = '0';
					break;
				}
				else {
					doit = true;
				}
				s[i] = '0';
			}
		}
		for(int i = 0; i < n; i++){
			if(now[i] != s[i]){
				res[i] = l;
			}
			if(now[i] == '0'){
				res[i] = r;
			}
		}
		// cout << l << " " << r << " " << res[l] << " " << res[r] << endl;
		return;
	}
	for(int i = 0; i < n; i++){
		if(s[i] == '0'){
			s[i] = '1';
			if(check_element(s)){
				now[i] = '1';
			}
			s[i] = '0';
		}
	}
	// cout << s << " | " << now << endl;
	int mid = (l + r) / 2;
	get_positions(mid + 1, r, now);
	for(int i = 0; i < n; i++){
		if(s[i] != now[i]){
			now[i] = '0';
		}
		else {
			now[i] = '1';
		}
	}
	get_positions(l, mid, now);
}

vector<int> restore_permutation(int N, int W, int R) {
	n = N, w = W, r = R;
	res = vector<int>(n, 0);
	add_all_elements(0, n - 1);
	compile_set();
	get_positions(0, n - 1, string(n, '0'));
	return res; 
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 288 KB n = 8
2 Correct 1 ms 204 KB n = 8
3 Correct 0 ms 204 KB n = 8
4 Correct 1 ms 204 KB n = 8
5 Correct 1 ms 204 KB n = 8
6 Correct 1 ms 204 KB n = 8
7 Correct 1 ms 204 KB n = 8
8 Correct 1 ms 264 KB n = 8
9 Correct 1 ms 204 KB n = 8
10 Correct 1 ms 332 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 1 ms 204 KB n = 8

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 288 KB n = 32
2 Correct 1 ms 204 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 288 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 1 ms 332 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n = 32
2 Correct 1 ms 204 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 296 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 292 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 1 ms 284 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 KB n = 128
2 Correct 2 ms 460 KB n = 128
3 Correct 2 ms 460 KB n = 128
4 Correct 2 ms 460 KB n = 128
5 Correct 1 ms 460 KB n = 128
6 Correct 2 ms 460 KB n = 128
7 Correct 1 ms 460 KB n = 128
8 Correct 1 ms 460 KB n = 128
9 Correct 2 ms 460 KB n = 128
10 Correct 2 ms 460 KB n = 128
11 Correct 2 ms 460 KB n = 128
12 Correct 1 ms 460 KB n = 128
13 Correct 2 ms 460 KB n = 128
14 Correct 2 ms 460 KB n = 128
15 Correct 2 ms 460 KB n = 128

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB n = 128
2 Correct 2 ms 460 KB n = 128
3 Correct 2 ms 460 KB n = 128
4 Correct 2 ms 460 KB n = 128
5 Correct 2 ms 460 KB n = 128
6 Correct 2 ms 460 KB n = 128
7 Correct 2 ms 424 KB n = 128
8 Correct 2 ms 460 KB n = 128
9 Correct 2 ms 424 KB n = 128
10 Correct 2 ms 460 KB n = 128
11 Correct 2 ms 460 KB n = 128
12 Correct 1 ms 460 KB n = 128
13 Correct 2 ms 460 KB n = 128
14 Correct 2 ms 416 KB n = 128
15 Correct 2 ms 488 KB n = 128