oj.uz

Submission #254933

# Submission time Handle Problem Language Result Execution time Memory
254933 2020-07-30T21:40:58 Z ChrisT Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 512 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
int n; vector<int> ret;
void build (int l, int r) {
	if (l == r) return;
	string go = string(n,'0');
	for (int i = l; i <= r; i++) go[i] = '1';
	int mid = (l + r) / 2;
	for (int i = l; i <= mid; i++) {
		go[i] = '0';
		add_element(go);
		go[i] = '1';
	}
	build(l,mid); build(mid+1,r);
}
void solve (int l, int r, vector<int> &wot) {
	if (l == r) return (void) (ret[wot[0]] = l);
	vector<int> wotL, wotR;
	string go = string(n,'0');
	for (int i : wot) go[i] = '1';
	for (int i : wot) {
		go[i] = '0';
		if (check_element(go)) wotL.push_back(i);
		else wotR.push_back(i);
		go[i] = '1';
	}
	int mid = (l + r) / 2;
	solve(l,mid,wotL); solve(mid+1,r,wotR);
}
vector<int> restore_permutation (int N, int w, int r) {
	n=N;
	vector<int> go(n); iota(go.begin(),go.end(),0); ret.resize(n);
	build(0,n-1);
	compile_set();
	solve(0,n-1,go);
	return ret;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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