oj.uz

Submission #436882

# Submission time Handle Problem Language Result Execution time Memory
436882 2021-06-25T07:31:47 Z dutch Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 588 KB 
#include <bits/stdc++.h>
using namespace std;
#include "messy.h"

vector<int> res(128);
int N;

void init(int l, int r){
	if(r-l < 2) return;
	int m = (l + r) / 2;

	string s(N, '1');
	for(int i=l; i<r; ++i) s[i] = '0';
	for(int i=l; i<m; ++i){
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}
	init(l, m), init(m, r);
}

void find(int l, int r, vector<int> &v){
	if(r-l < 2) return void(res[v[0]] = l);
	int m = (l + r) / 2;

	vector<int> a[2];
	string s(N, '1');
	for(int i : v) s[i] = '0';
	for(int i : v){
		s[i] = '1';
		a[!check_element(s)].push_back(i);
		s[i] = '0';
	}
	find(l, m, a[0]), find(m, r, a[1]);
}

vector<int> restore_permutation(int n, int __0, int __1){
	N = n;
	vector<int> a(n); iota(a.begin(), a.end(), 0);
	init(0, n);
	compile_set();
	find(0, n, a);
	res.resize(n);
    return res;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 8
2 Correct 1 ms 292 KB n = 8
3 Correct 1 ms 204 KB n = 8
4 Correct 1 ms 204 KB n = 8
5 Correct 1 ms 204 KB n = 8
6 Correct 1 ms 204 KB n = 8
7 Correct 1 ms 204 KB n = 8
8 Correct 1 ms 204 KB n = 8
9 Correct 1 ms 204 KB n = 8
10 Correct 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 1 ms 204 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 32
2 Correct 1 ms 288 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 292 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 1 ms 288 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 32
2 Correct 1 ms 204 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB n = 128
2 Correct 2 ms 460 KB n = 128
3 Correct 3 ms 480 KB n = 128
4 Correct 2 ms 396 KB n = 128
5 Correct 2 ms 460 KB n = 128
6 Correct 2 ms 416 KB n = 128
7 Correct 2 ms 420 KB n = 128
8 Correct 2 ms 460 KB n = 128
9 Correct 2 ms 460 KB n = 128
10 Correct 2 ms 460 KB n = 128
11 Correct 2 ms 460 KB n = 128
12 Correct 2 ms 460 KB n = 128
13 Correct 2 ms 460 KB n = 128
14 Correct 2 ms 460 KB n = 128
15 Correct 2 ms 460 KB n = 128