oj.uz

Submission #765988

# Submission time Handle Problem Language Result Execution time Memory
765988 2023-06-25T08:28:20 Z SanguineChameleon Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 5 ms 496 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

int n;

string make1(int lt, int rt, int x) {
	string res;
	for (int i = 0; i < n; i++) {
		if (i != x && lt <= i && i <= rt) {
			res += "0";
		}
		else {
			res += "1";
		}
	}
	return res;
}

void solve1(int lt, int rt) {
	if (lt == rt) {
		return;
	}
	int mt = (lt + rt) / 2;
	for (int i = lt; i <= mt; i++) {
		add_element(make1(lt, rt, i));
	}
	solve1(lt, mt);
	solve1(mt + 1, rt);
}

string make2(vector<int> cand, int x) {
	string res;
	for (int i = 0; i < n; i++) {
		if (i != x && find(cand.begin(), cand.end(), i) != cand.end()) {
			res += "0";
		}
		else {
			res += "1";
		}
	}
	return res;
}

vector<int> res;

void solve2(int lt, int rt, vector<int> cand) {
	if (lt == rt) {
		res[cand[0]] = lt;
		return;
	}
	int mt = (lt + rt) / 2;
	vector<int> left;
	vector<int> right;
	for (auto x: cand) {
		if (check_element(make2(cand, x))) {
			left.push_back(x);
		}
		else {
			right.push_back(x);
		}
	}
	solve2(lt, mt, left);
	solve2(mt + 1, rt, right);
}

vector<int> restore_permutation(int _n, int w, int r) {
	n = _n;
	solve1(0, n - 1);
	compile_set();
	vector<int> cand(n);
	for (int i = 0; i < n; i++) {
		cand[i] = i;
	}
	res.resize(n);
	solve2(0, n - 1, cand);
	return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB n = 128
2 Correct 3 ms 468 KB n = 128
3 Correct 4 ms 428 KB n = 128
4 Correct 3 ms 424 KB n = 128
5 Correct 3 ms 468 KB n = 128
6 Correct 3 ms 468 KB n = 128
7 Correct 3 ms 468 KB n = 128
8 Correct 3 ms 468 KB n = 128
9 Correct 3 ms 468 KB n = 128
10 Correct 4 ms 468 KB n = 128
11 Correct 3 ms 468 KB n = 128
12 Correct 3 ms 496 KB n = 128
13 Correct 5 ms 468 KB n = 128
14 Correct 3 ms 468 KB n = 128
15 Correct 4 ms 468 KB n = 128