oj.uz

Submission #67778

# Submission time Handle Problem Language Result Execution time Memory
67778 2018-08-15T09:54:16 Z gnoor Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 540 KB 
#include <vector>
#include <string>

#include "messy.h"

using namespace std;

string tmp;

void add(int l,int r) {
	int m=(l+r)>>1;
	for (int i=l;i<m;i++) {
		tmp[i]='1';
		add_element(tmp);
		tmp[i]='0';
	}
	if (l+2==r) return;
	for (int i=m;i<r;i++) tmp[i]='1';
	add(l,m);
	for (int i=l;i<m;i++) tmp[i]='1';
	for (int i=m;i<r;i++) tmp[i]='0';
	add(m,r);
	for (int i=l;i<r;i++) tmp[i]='0';
}

vector<int> ans;

void solve(int l,int r,const vector<int> &candid,const vector<int> &pre) {
	if (l+1==r) {
		ans[candid.front()]=l;
		return;
	}
	for (auto i:pre) {
		tmp[i]='1';
	}
	vector<int> ll;
	vector<int> rr;
	for (auto i:candid) {
		tmp[i]='1';
		if (check_element(tmp)) {
			ll.push_back(i);
		} else {
			rr.push_back(i);
		}
		tmp[i]='0';
	}
	int m=(l+r)>>1;
	solve(l,m,ll,rr);
	solve(m,r,rr,ll);
	for (auto i:pre) {
		tmp[i]='0';
	}
}

std::vector<int> restore_permutation(int n, int w, int r) {
	for (int i=0;i<n;i++) {
		tmp.push_back('0');
	}
	add(0,n);
	compile_set();
	ans.resize(n);
	for (int i=0;i<n;i++) {
		tmp[i]='0';
	}
	vector<int> init(n);
	for (int i=0;i<n;i++) {
		init[i]=i;
	}
	solve(0,n,init,vector<int>());
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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