oj.uz

Submission #32024

# Submission time Handle Problem Language Result Execution time Memory
32024 2017-09-22T14:27:56 Z imeimi2000 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 17 ms 640 KB 
#include <vector>
#include "messy.h"

using namespace std;

string now;
vector<int> per;
vector<int> ans;
void dnc1(int s, int e) {
	if (s == e) return;
	int m = (s + e) / 2;
	for (int i = m + 1; i <= e; ++i) {
		now[i] = '1';
		add_element(now);
		now[i] = '0';
	}
	for (int i = m + 1; i <= e; ++i) now[i] = '1';
	dnc1(s, m);
	for (int i = m + 1; i <= e; ++i) now[i] = '0';
	now[s] = '1';
	dnc1(m + 1, e);
	now[s] = '0';
}

vector<int> group[1024];
void dnc2(int idx, int s, int e) {
	if (s == e) {
		per[s] = group[idx].back();
		return;
	}
	int m = (s + e) / 2;
	for (int i : group[idx]) {
		now[i] = '1';
		if (check_element(now)) group[idx * 2 + 1].push_back(i);
		else group[idx * 2].push_back(i);
		now[i] = '0';
	}
	for (int i : group[idx * 2 + 1]) now[i] = '1';
	dnc2(idx * 2, s, m);
	for (int i : group[idx * 2 + 1]) now[i] = '0';
	now[per[s]] = '1';
	dnc2(idx * 2 + 1, m + 1, e);
	now[per[s]] = '0';
}

std::vector<int> restore_permutation(int n, int w, int r) {
	per.resize(n);
	ans.resize(n);
	now.resize(n, '0');
	dnc1(0, n - 1);
	compile_set();
	group[1].resize(n);
	for (int i = 0; i < n; ++i) group[1][i] = i;
	dnc2(1, 0, n - 1);
	for (int i = 0; i < n; ++i) ans[per[i]] = i;
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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