oj.uz

Submission #828493

# Submission time Handle Problem Language Result Execution time Memory
828493 2023-08-17T10:30:11 Z happypotato Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 1 ms 496 KB 
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back

#include "messy.h"

int flog2(int x) {
	return 31 - __builtin_clz(x);
}

void AddElements(int n) {
	string str(n, '0');
	for (int i = (n >> 1); i < n; i++) {
		str[i] = '1';
		add_element(str);
		str[i] = '0';
	}
	for (int bit = flog2(n) - 2; bit >= 0; bit--) {
		for (int flag = 0; flag < 2; flag++) {
			for (int i = 0; i < n; i++) {
				str[i] = (flag ^ bool(i & (1 << (bit + 1))) ? '1' : '0');
			}
			for (int i = 0; i < n; i++) {
				if (str[i] == '0' && bool(i & (1 << bit))) {
					str[i] = '1';
					add_element(str);
					str[i] = '0';
				}
			}
		}
	}
}
vector<int> restore_permutation(int n, int w, int r) {
	AddElements(n);
	compile_set();
	vector<int> ans(n, 0);
	string cur(n, '0'), sto(n, '0');
	int mxbit = flog2(n) - 1;
	for (int i = 0; i < n; i++) {
		cur[i] = '1';
		if (check_element(cur)) {
			ans[i] |= (1 << mxbit);
			sto[i] = '1';
		}
		cur[i] = '0';
	}
	// for (int &x : ans) cerr << x << ' '; cerr << endl;
	for (int bit = mxbit - 1; bit >= 0; bit--) {
		cur = sto;
		for (int i = 0; i < n; i++) sto[i] = '0';
		for (int flag = 0; flag < 2; flag++) {
			for (int i = 0; i < n; i++) {
				if (cur[i] == '1') continue;
				cur[i] = '1';
				if (check_element(cur)) {
					ans[i] |= (1 << bit);
					sto[i] = '1';
				}
				cur[i] = '0';
			}
			for (int i = 0; i < n; i++) {
				cur[i] = (cur[i] == '0' ? '1' : '0');
			}
		}
		// for (int &x : ans) cerr << x << ' '; cerr << endl;
	}
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 1 ms 420 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 468 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 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 416 KB n = 128
3 Correct 1 ms 424 KB n = 128
4 Correct 1 ms 496 KB n = 128
5 Correct 1 ms 424 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 1 ms 428 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 1 ms 428 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