oj.uz

Submission #48055

# Submission time Handle Problem Language Result Execution time Memory
48055 2018-05-09T16:05:06 Z cheater2k Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 560 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

const int N = 128;
int n;
int p[N];

void add(int l, int r) {
	if (l == r) return;
	int mid = ((l + r) >> 1);
	// l...mid: 0
	// mid + 1...r: 1
	for (int i = l; i <= mid; ++i) {
		string s(n, '0');
		for (int j = l; j <= r; ++j) s[j] = '1';
		s[i] = '0';
		add_element(s);
	}

	add(l, mid);
	add(mid + 1, r);
}

void check(int l, int r, vector<int> &can) {
	if (l == r) {
		assert(can.size() == 1);
		p[l] = can[0];
		return;
	}

	vector <bool> have(n, 0);
	for (int i : can) have[i] = true;

	vector <int> can_lef, can_rig;
	for (int i : can) {
		string s(n, '1');
		for (int j = 0; j < n; ++j) if (!have[j]) s[j] = '0';
		s[i] = '0';
		
		if (check_element(s)) {
			can_lef.push_back(i);
		} else {
			can_rig.push_back(i);
		}
	}

	int mid = ((l + r) >> 1);
	check(l, mid, can_lef);
	check(mid + 1, r, can_rig);
}

vector<int> restore_permutation(int _n, int w, int r) {
    n = _n;
    add(0, n - 1);
    compile_set();

    vector <int> can;
    for (int i = 0; i < n; ++i) can.push_back(i);
    check(0, n - 1, can);

	vector <int> P(n);
	for (int i = 0; i < n; ++i) P[p[i]] = i;
    return P;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 8
2 Correct 2 ms 384 KB n = 8
3 Correct 2 ms 384 KB n = 8
4 Correct 2 ms 256 KB n = 8
5 Correct 2 ms 256 KB n = 8
6 Correct 2 ms 256 KB n = 8
7 Correct 2 ms 256 KB n = 8
8 Correct 2 ms 256 KB n = 8
9 Correct 2 ms 256 KB n = 8
10 Correct 2 ms 256 KB n = 8
11 Correct 2 ms 256 KB n = 8
12 Correct 2 ms 256 KB n = 8
13 Correct 2 ms 256 KB n = 8
14 Correct 2 ms 256 KB n = 8
15 Correct 2 ms 256 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 256 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 2 ms 384 KB n = 32
12 Correct 2 ms 256 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 256 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 256 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 256 KB n = 32
11 Correct 2 ms 384 KB n = 32
12 Correct 2 ms 256 KB n = 32
13 Correct 2 ms 256 KB n = 32
14 Correct 2 ms 256 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 3 ms 512 KB n = 128
4 Correct 4 ms 512 KB n = 128
5 Correct 3 ms 512 KB n = 128
6 Correct 4 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 560 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 4 ms 512 KB n = 128
15 Correct 4 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 4 ms 512 KB n = 128
3 Correct 3 ms 512 KB n = 128
4 Correct 3 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 4 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 4 ms 512 KB n = 128
14 Correct 4 ms 512 KB n = 128
15 Correct 3 ms 512 KB n = 128