oj.uz

Submission #66964

# Submission time Handle Problem Language Result Execution time Memory
66964 2018-08-12T23:30:48 Z fallingstar Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 512 KB 
#include <vector>
#include "messy.h"
#include <string>

using namespace std;

// [l..r)
void Add(int l, int r, string base)
{
	if (l + 1 == r) return;
	int mid = (l + r) / 2;
	for (int i = l; i < mid; ++i)
	{
		base[i] = '1';
		add_element(base.c_str());
		base[i] = '0';
	}
	
	// fill one side, recurse in other side
	fill(base.begin() + l, base.begin() + mid, '1');
	Add(mid, r, base);
	fill(base.begin() + l, base.begin() + mid, '0');
	fill(base.begin() + mid, base.begin() + r, '1');
	Add(l, mid, base);
}

vector<int> ans;

void Solve(int l, int r, vector<int> miss, string base)
{
	if (l + 1 == r)
	{
		ans[miss[0]] = l;
		return;
	}
	vector<int> grL, grR;
	for (int x: miss)
	{
		base[x] = '1';
		if (check_element(base.c_str())) grL.push_back(x);
		else grR.push_back(x);
		base[x] = '0';
	}
	int mid = (l + r) / 2;

	// fill one side, recurse in other side
	for (int x: grR) base[x] = '1';
	Solve(l, mid, grL, base);
	for (int x: grR) base[x] = '0';
	for (int x: grL) base[x] = '1';
	Solve(mid, r, grR, base);
}

vector<int> restore_permutation(int n, int w, int r) {
    Add(0, n, string(n, '0'));

    compile_set();

    ans.resize(n);
    vector<int> all;
    for (int i = 0; i < n; ++i) all.push_back(i);
    Solve(0, n, all, string(n, '0'));
    return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 8
2 Correct 2 ms 256 KB n = 8
3 Correct 2 ms 256 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 384 KB n = 8
8 Correct 2 ms 256 KB n = 8
9 Correct 2 ms 256 KB n = 8
10 Correct 1 ms 256 KB n = 8
11 Correct 1 ms 256 KB n = 8
12 Correct 2 ms 256 KB n = 8
13 Correct 2 ms 252 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 256 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 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 256 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 32
2 Correct 2 ms 384 KB n = 32
3 Correct 2 ms 256 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 2 ms 384 KB n = 32
12 Correct 3 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 #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 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 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 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 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 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 512 KB n = 128
15 Correct 3 ms 512 KB n = 128