oj.uz

Submission #817717

# Submission time Handle Problem Language Result Execution time Memory
817717 2023-08-09T15:16:14 Z pavement Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 1 ms 468 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

int n;
vector<int> ans_r;

void dnc(int in_l, int in_r, vector<int> out) {
	assert(in_r - in_l + 1 == (int)out.size());
	if (in_l == in_r) {
		ans_r[in_l] = out[0];
		return;
	}
	vector<int> fh_out, sh_out;
	string cur = "";
	for (int i = 0; i < n; i++) {
		cur.pb(!binary_search(out.begin(), out.end(), i) + '0');
	}
	for (int i = 0; i < (int)out.size(); i++) {
		cur[out[i]] = '1';
		if (check_element(cur)) {
			fh_out.pb(out[i]);
		} else {
			sh_out.pb(out[i]);
		}
		cur[out[i]] = '0';
	}
	int in_m = (in_l + in_r) / 2;
	dnc(in_l, in_m, fh_out);
	dnc(in_m + 1, in_r, sh_out);
}

vector<int> restore_permutation(int n, int w, int r) {
	::n = n;
	for (int i = 1; (1 << i) <= n; i++) {
		for (int j = 0; j < n; j += (1 << i)) {
			string base = "";
			for (int k = 0; k < n; k++) {
				base.pb('1');
			}
			for (int k = j; k < j + (1 << i); k++) {
				base[k] = '0';
			}
			for (int k = j; k < j + (1 << (i - 1)); k++) {
				base[k] = '1';
				add_element(base);
				base[k] = '0';
			}
		}
	}
	compile_set();
	vector<int> all;
	for (int i = 0; i < n; i++) all.pb(i);
	ans_r.resize(n);
	dnc(0, n - 1, all);
	vector<int> ans(n);
	for (int i = 0; i < n; i++) {
		ans[ans_r[i]] = i;
	}
	return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 0 ms 304 KB n = 8
3 Correct 0 ms 212 KB n = 8
4 Correct 0 ms 296 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 0 ms 212 KB n = 8
8 Correct 0 ms 296 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 300 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 296 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 300 KB n = 32
10 Correct 1 ms 300 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 292 KB n = 32
13 Correct 0 ms 300 KB n = 32
14 Correct 0 ms 212 KB n = 32
15 Correct 0 ms 212 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 300 KB n = 32
3 Correct 1 ms 300 KB n = 32
4 Correct 0 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 296 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 296 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 424 KB n = 128
2 Correct 1 ms 416 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 432 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 428 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 424 KB n = 128
15 Correct 1 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 428 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128