oj.uz

Submission #601260

# Submission time Handle Problem Language Result Execution time Memory
601260 2022-07-21T14:23:33 Z SeDunion Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 468 KB 
#include <iostream>
#include <algorithm>
#include <vector>

#include "messy.h"

using namespace std;

int n;

void go(int l, int r) {
	if (l == r) return;
	int m = (l + r) >> 1;
	string cur(n, '1');
	for (int i = l ; i <= r ; ++ i) cur[i] = '0';
	for (int i = m + 1 ; i <= r ; ++ i) {
		cur[i] = '1';
		//cerr << cur  << endl;
		add_element(cur);
		cur[i] = '0';
	}
	go(l, m), go(m + 1, r);
}

#include<assert.h>
void go(int l, int r, vector<int>&ans, vector<int>&id) {
	if (id.size() == 1) {
		assert(l == r);
		ans[id[0]] = l;
		return;
	}
	string cur(n, '1');
	for (int i : id) cur[i] = '0';
	vector<int>bar, jok;
	for (int i : id) {
		cur[i] = '1';
		if (check_element(cur)) bar.emplace_back(i);
		else jok.emplace_back(i);
		cur[i] = '0';
	}
	int m = (l + r) >> 1;
	go(m + 1, r, ans, bar);
	go(l, m, ans, jok);
}

vector<int> restore_permutation(int n_, int w, int r) {
	n = n_;
	go(0, n - 1);
	compile_set();
	vector<int>ans(n,-1), id(n);
	for (int i = 0 ; i < n ; ++ i) id[i] = i;
	go(0, n - 1, ans, id);
	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 1 ms 308 KB n = 8
5 Correct 0 ms 224 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 1 ms 304 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 212 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 1 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 304 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 300 KB n = 32
12 Correct 1 ms 212 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 #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 300 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 304 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 300 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 296 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 2 ms 468 KB n = 128
3 Correct 1 ms 428 KB n = 128
4 Correct 1 ms 428 KB n = 128
5 Correct 1 ms 396 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 2 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 424 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 428 KB n = 128
3 Correct 1 ms 432 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 1 ms 424 KB n = 128
6 Correct 2 ms 428 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 2 ms 428 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 1 ms 424 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128