oj.uz

Submission #285714

# Submission time Handle Problem Language Result Execution time Memory
285714 2020-08-29T13:48:56 Z eohomegrownapps Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 512 KB 
#include "messy.h"

#include <bits/stdc++.h>
using namespace std;

string curquery;
int n;

void genQueries(int s, int e){
	if (s==e){
		return;
	}
	int m = (s+e)/2;
	for (int i = s; i<=m; i++){
		curquery[i]='1';
		//cout<<curquery<<'\n';
		add_element(curquery);
		curquery[i]='0';
	}


	for (int i = m+1; i<=e; i++){
		curquery[i]='1';
	}
	genQueries(s,m);
	
	for (int i = s; i<=m; i++){
		curquery[i]='1';
	}
	for (int i = m+1; i<=e; i++){
		curquery[i]='0';
	}
	genQueries(m+1,e);
}

vector<int> permutation;
vector<bool> active;

void genResult(int s, int e){
	if (s==e){
		for (int i = 0; i<n; i++){
			if (active[i]){
				permutation[s]=i;
				return;
			}
		}
		assert(1==0);
		return;
	}
	int m = (s+e)/2;
	vector<int> touse;
	for (int i = 0; i<n; i++){
		if (active[i]){
			curquery[i]='0';
			touse.push_back(i);
		} else {
			curquery[i]='1';
		}
	}
	vector<int> l;
	vector<int> r;
	for (int t : touse){
		curquery[t]='1';
		//cout<<curquery<<'\n';
		if (check_element(curquery)){
			//cout<<"l\n";
			l.push_back(t);
		} else {
			//cout<<"r\n";
			r.push_back(t);
		}
		curquery[t]='0';
	}
	/*cout<<"checking "<<s<<' '<<e<<'\n';
	cout<<"l: ";
	for (int i : l){
		cout<<i<<' ';
	}cout<<'\n';
	cout<<"r: ";
	for (int i : r){
		cout<<i<<' ';
	}cout<<'\n';*/
	for (int i : l){
		active[i]=true;
	}
	for (int i : r){
		active[i]=false;
	}
	genResult(s,m);
	for (int i : l){
		active[i]=false;
	}
	for (int i : r){
		active[i]=true;
	}
	genResult(m+1,e);
}

std::vector<int> restore_permutation(int N, int w, int r) {
	n = N;
	curquery.resize(n,'0');
	genQueries(0,n-1);
    compile_set();
    permutation.resize(n);
    active.resize(n,true);
    genResult(0,n-1);
    vector<int> ans(n);
    for (int i = 0; i<n; i++){
    	ans[permutation[i]]=i;
    }
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 #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