oj.uz

Submission #704163

# Submission time Handle Problem Language Result Execution time Memory
704163 2023-03-01T18:24:57 Z SamNguyen Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 488 KB 
#include <vector>
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

namespace subtask_full {
	int N, W, R;
	vector<int> perm;

	void add_elements(int l, int r) {
		if (l >= r)
			return;

		int m = (l + r) >> 1;
		
		string tmp(N, '1');
		for (int i = l; i <= r; i++)
			tmp[i] = '0';

		for (int i = l; i <= m; i++) {
			tmp[i] = '1';
			add_element(tmp);
			tmp[i] = '0';
		}

		add_elements(l, m);
		add_elements(m + 1, r);
	}

	inline void add_elements() { add_elements(0, N - 1); }

	void check_elements(int l, int r, vector<int> vals) {
		if (l >= r) {
			perm[vals[0]] = r;
			return;
		}

		int m = (l + r) >> 1;

		string tmp(N, '1');
		for (int i : vals)
			tmp[i] = '0';

		vector<int> left_vals, right_vals;

		for (int v : vals) {
			tmp[v] = '1';
			if (check_element(tmp))
				left_vals.push_back(v);
			else
				right_vals.push_back(v);

			tmp[v] = '0';
		}

		check_elements(l, m, left_vals);
		check_elements(m + 1, r, right_vals);
	}

	inline void check_elements() { 
		vector<int> vals(N);
		iota(vals.begin(), vals.end(), 0);
		perm.resize(N);
		check_elements(0, N - 1, vals); 
	}

	vector<int> restore_permutation(int n, int w, int r) {
		N = n, W = w, R = r;

		add_elements();
		compile_set();
		check_elements();

		return perm;
	}
};

vector<int> restore_permutation(int n, int w, int r) {
	return subtask_full::restore_permutation(n, w, r);
}

Subtask #1
20.0 / 20.0

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

Subtask #3
11.0 / 11.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 300 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 0 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 304 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 300 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 428 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 1 ms 468 KB n = 128
2 Correct 1 ms 468 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 2 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 2 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 468 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 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 488 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 468 KB n = 128
15 Correct 1 ms 468 KB n = 128