oj.uz

Submission #299850

# Submission time Handle Problem Language Result Execution time Memory
299850 2020-09-15T20:36:40 Z MatheusLealV Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 640 KB 
#include <bits/stdc++.h>
#include "messy.h"
#define pb push_back
using namespace std;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
#define all(x) begin(x), end(x)

int n;
vector<int> ans;
void add(int ini, int fim){
	if(fim==ini)return;
	int mid = (ini + fim)/2;
	string curr;
	for(int i = 0; i < n; i++){
		if(ini <= i and i <= fim) curr.pb('1');
		else curr.pb('0');
	}
	for(int i = ini; i <= mid; i++){
		curr[i] = '0';
		add_element(curr);
		curr[i]='1';
	}
	add(ini, mid), add(mid+1, fim);
}
void solve(int ini, int fim, vector<int> caras){
	if(ini == fim){
		ans[caras[0]]=ini;
		return;
	}
	int mid = (ini+fim)/2;
	string curr;
	for(int i = 0; i < n; i++){
		if(binary_search(all(caras), i)) curr.pb('1');
		else curr.pb('0');
	}
	vector<int> L, R;
	for(auto i: caras){
		curr[i]='0';
		if(check_element(curr)) L.pb(i);
		else R.pb(i);
		curr[i] = '1';
	}
	solve(ini,mid,L), solve(mid+1, fim, R);
}
vector<int> restore_permutation(int n_, int w, int r) {
	n=n_;
	ans.resize(n);
	vector<int> caras;
	for(int i = 0; i<n;i++)caras.pb(i);
	add(0,n-1);
	compile_set();
	solve(0,n-1,caras);
	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 0 ms 256 KB n = 8
4 Correct 0 ms 256 KB n = 8
5 Correct 1 ms 256 KB n = 8
6 Correct 0 ms 256 KB n = 8
7 Correct 0 ms 256 KB n = 8
8 Correct 1 ms 256 KB n = 8
9 Correct 0 ms 256 KB n = 8
10 Correct 0 ms 384 KB n = 8
11 Correct 1 ms 384 KB n = 8
12 Correct 0 ms 256 KB n = 8
13 Correct 0 ms 384 KB n = 8
14 Correct 1 ms 384 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 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 288 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 512 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 3 ms 512 KB n = 128
8 Correct 2 ms 512 KB n = 128
9 Correct 3 ms 512 KB n = 128
10 Correct 3 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 544 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 3 ms 640 KB n = 128
3 Correct 3 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 3 ms 512 KB n = 128
10 Correct 2 ms 512 KB n = 128
11 Correct 2 ms 512 KB n = 128
12 Correct 3 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