oj.uz

Submission #231253

# Submission time Handle Problem Language Result Execution time Memory
231253 2020-05-13T08:30:05 Z islingr Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 6 ms 640 KB 
#include "messy.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
 
using namespace std;
 
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
 
bool ask(string &s, int i) {
	s[i] = '1';
	bool b = check_element(s);
	s[i] = '0';
	return b;
}
void add(string &s, int i) { s[i] = '1'; add_element(s); s[i] = '0'; }
 
vector<int> restore_permutation(int n, int _, int __) {
	for (int sz = n; sz != 1; sz >>= 1) {
		for (int l = 0; l != n; l += sz) {
			string s(n, '1');
			rep(i, l, l + sz) s[i] = '0';
			rep(i, l, l + sz / 2) add(s, i);
		}
	}
 
	compile_set();
	
	vector<int> p(n); iota(all(p), 0);
	for (int sz = n; sz != 1; sz >>= 1) {
		vector<bool> v(n);
		for (int l = 0; l != n; l += sz) {
			string s(n, '1');
			rep(i, l, l + sz) s[p[i]] = '0';
			rep(i, l, l + sz) v[p[i]] = ask(s, p[i]);
			partition(begin(p) + l, begin(p) + l + sz, [&v](int x) { return v[x]; });
		}
	}

	vector<int> res(n);
	rep(i, 0, n) res[p[i]] = i;
	return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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