oj.uz

Submission #789154

# Submission time Handle Problem Language Result Execution time Memory
789154 2023-07-21T06:45:10 Z Sohsoh84 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 504 KB 
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

const int MAXN = 1e6 + 10;

#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl;

int n, P[MAXN];

void ask(string s, int l, int r) {
	if (r - l + 1 < 2) return;	
	int mid = (l + r) >> 1;
	for (int i = l; i <= mid; i++) {
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}

	for (int i = l; i <= mid; i++) s[i] = '1';
	ask(s, mid + 1, r);
	for (int i = l; i <= mid; i++) s[i] = '0';
	for (int i = mid + 1; i <= r; i++) s[i] = '1';
	ask(s, l, mid);
}

void get(string s, int l, int r, vector<int> poss) {
	if (l == r) {
		P[poss.front()] = l;
		return;
	}

	vector<int> f[2];
	for (int e : poss) {
		s[e] = '1';
		if (check_element(s)) f[0].push_back(e);
		else f[1].push_back(e);
		s[e] = '0';
	}


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

	for (int e : f[0]) s[e] = '1';
	get(s, mid + 1, r, f[1]);
	for (int e : f[0]) s[e] = '0';
	for (int e : f[1]) s[e] = '1';
	get(s, l, mid, f[0]);
}

vector<int> restore_permutation(int n_, int w, int r) {
	n = n_;
	string s;
	vector<int> vec;
	for (int i = 0; i < n; i++) {
		vec.push_back(i);
		s.push_back('0');
	}

	ask(s, 0, n - 1);
	compile_set();
	get(s, 0, n - 1, vec);
	vector<int> ans;

	for (int i = 0; i < n; i++)
		ans.push_back(P[i]);

	return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 0 ms 212 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 1 ms 312 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 1 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 1 ms 308 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 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 0 ms 224 KB n = 32
6 Correct 0 ms 312 KB n = 32
7 Correct 0 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 312 KB n = 32
10 Correct 0 ms 308 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 340 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 0 ms 212 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 308 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 1 ms 212 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 312 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 2 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 2 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 436 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 1 ms 440 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 440 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 2 ms 468 KB n = 128
4 Correct 1 ms 428 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 2 ms 396 KB n = 128
7 Correct 1 ms 484 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 436 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 444 KB n = 128
15 Correct 2 ms 504 KB n = 128