oj.uz

Submission #293679

# Submission time Handle Problem Language Result Execution time Memory
293679 2020-09-08T09:39:21 Z VodkaInTheJar Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 512 KB 
#include <bits/stdc++.h>
#include "messy.h"
 
using namespace std;

int n;
void add_elements(int l, int r)
{
	if (l == r)
	return;
	
	int mid = (l + r) / 2;
	
	string s;
	for (int i = 0; i < n; i++)
	s += "1";
	
	for (int i = l; i <= r; i++)
	s[i] = '0';
	
	for (int i = l; i <= mid; i++)
	{
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}
	
	add_elements(l, mid);
	add_elements(mid + 1, r);
}

int p[128];
void get_elements(int l, int r, vector <int> el)
{
	if (l == r)
	{
		p[el[0]] = l;
		return;
	}
	
	vector <int> left;
	string s; 
	for (int i = 0; i < n; i++)
	s += "1";
	
	for (auto i: el)
	s[i] = '0';
	
	for (auto i: el)
	{
		s[i] = '1';
		if (check_element(s))
		left.push_back(i);
		
		s[i] = '0';
	}
	
	vector <int> right; 
	for (auto i: el)
	{
		bool is = false;
		for (auto j: left)
		if (i == j)
		{
			is = true;
			break;
		}
		
		if (!is)
		right.push_back(i);
	}
	
	int mid = (l + r) / 2; 
	get_elements(l, mid, left);
	get_elements(mid + 1, r, right);
}

vector <int> restore_permutation(int _n, int w, int r)
{
	n = _n; 
	
	add_elements(0, n-1);
	compile_set();
	
	vector <int> v;
	for (int i = 0; i < n; i++)
	v.push_back(i);
	
	get_elements(0, n-1, v);
	
	vector <int> ans;
	for (int i = 0; i < n; i++)
	ans.push_back(p[i]);
	
	return ans;
}

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 0 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 256 KB n = 8
8 Correct 1 ms 256 KB n = 8
9 Correct 1 ms 256 KB n = 8
10 Correct 0 ms 256 KB n = 8
11 Correct 1 ms 256 KB n = 8
12 Correct 0 ms 256 KB n = 8
13 Correct 0 ms 256 KB n = 8
14 Correct 1 ms 256 KB n = 8
15 Correct 1 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 384 KB n = 32
11 Correct 1 ms 384 KB n = 32
12 Correct 1 ms 288 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 328 KB n = 32
7 Correct 1 ms 384 KB n = 32
8 Correct 1 ms 512 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 492 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