oj.uz

Submission #618132

# Submission time Handle Problem Language Result Execution time Memory
618132 2022-08-01T23:53:42 Z Temmie Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 472 KB 
#include "messy.h"
#include <bits/stdc++.h>

std::vector <int> restore_permutation(int n, int W, int R) {
	auto wr = [&] (auto&& self, int l, int r) -> void {
		std::string s(n, '1');
		for (int i = l; i <= r; i++) {
			s[i] = '0';
		}
		if (!(r - l - 1)) {
			s[l] = '1';
			add_element(s);
			return;
		}
		for (int i = l; i <= (r + l) / 2; i++) {
			s[i] = '1';
			add_element(s);
			s[i] = '0';
		}
		self(self, l, (l + r) / 2);
		self(self, (l + r) / 2 + 1, r);
	};
	wr(wr, 0, n - 1);
	std::vector <int> ans(n);
	auto re = [&] (auto&& self, int l, int r, std::set <int> st) -> void {
		if (!(r - l - 1)) {
			std::string s(n, '1');
			s[*st.begin()] = '0';
			ans[*st.begin()] = l;
			ans[*next(st.begin())] = r;
			if (check_element(s)) {
				std::swap(ans[*st.begin()], ans[*next(st.begin())]);
			}
			return;
		}
		std::set <int> ts[2];
		for (int x : st) {
			std::string s(n, '0');
			for (int i = 0; i < n; i++) {
				s[i] ^= st.count(i) ^ 1;
			}
			s[x] = '1';
			ts[check_element(s) ^ 1].insert(x);
		}
		self(self, l, (l + r) / 2, ts[0]);
		self(self, (l + r) / 2 + 1, r, ts[1]);
	};
	std::set <int> st;
	for (int i = 0; i < n; i++) {
		st.insert(i);
	}
	compile_set();
	re(re, 0, n - 1, st);
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 296 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 300 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 0 ms 212 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 304 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB n = 32
2 Correct 1 ms 304 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 296 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 296 KB n = 32
11 Correct 0 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 2 ms 468 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 2 ms 432 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

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