oj.uz

Submission #135662

# Submission time Handle Problem Language Result Execution time Memory
135662 2019-07-24T09:31:56 Z random0029 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 5 ms 632 KB 
// ItnoE
#include<bits/stdc++.h>
#include "messy.h"
using namespace std;
const int N = 179;
int n, P[N];
void Solve(int l, int r, vector < int > vec)
{
	assert((int)vec.size() == r - l);
	if (r - l == 1)
	{
		P[vec[0]] = l;
		return ;
	}

	int md = (l + r) >> 1;
	vector < int > vel, ver;
	string def = "";
	for (int i = 0; i < n; i ++)
		def += "1";
	for (int v : vec)
	{
		string s = def;
		for (int u : vec)
			s[u] = '0';
		s[v] = '1';
		if (check_element(s))
			vel.push_back(v);
		else
			ver.push_back(v);
	}
	Solve(l, md, vel);
	Solve(md, r, ver);
}
vector < int > restore_permutation(int _n, int w, int r)
{
	n = _n;
	for (int len = 2; len <= n; len <<= 1)
		for (int l = 0, r = len; r <= n; l += len, r += len)
		{
			int md = (l + r) >> 1;
			for (int i = l; i < md; i ++)
			{
				string s = "";
				for (int j = 0; j < n; j ++)
					s += "1";
				for (int j = l; j < i; j ++)
					s[j] = '0';
				for (int j = i + 1; j < r; j ++)
					s[j] = '0';
				add_element(s);
			}
		}
	compile_set();
	vector < int > vec;
	for (int i = 0; i < n; i ++)
		vec.push_back(i);
	Solve(0, n, vec);
	vector < int > ret;
	for (int i = 0; i < n; i ++)
		ret.push_back(P[i]);
	return (ret);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB n = 8
2 Correct 2 ms 376 KB n = 8
3 Correct 2 ms 256 KB n = 8
4 Correct 2 ms 256 KB n = 8
5 Correct 2 ms 256 KB n = 8
6 Correct 2 ms 376 KB n = 8
7 Correct 2 ms 376 KB n = 8
8 Correct 2 ms 424 KB n = 8
9 Correct 2 ms 256 KB n = 8
10 Correct 2 ms 376 KB n = 8
11 Correct 2 ms 256 KB n = 8
12 Correct 2 ms 256 KB n = 8
13 Correct 2 ms 376 KB n = 8
14 Correct 2 ms 256 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 376 KB n = 32
2 Correct 2 ms 376 KB n = 32
3 Correct 2 ms 256 KB n = 32
4 Correct 2 ms 376 KB n = 32
5 Correct 2 ms 256 KB n = 32
6 Correct 2 ms 256 KB n = 32
7 Correct 2 ms 376 KB n = 32
8 Correct 2 ms 352 KB n = 32
9 Correct 2 ms 376 KB n = 32
10 Correct 2 ms 376 KB n = 32
11 Correct 2 ms 376 KB n = 32
12 Correct 2 ms 256 KB n = 32
13 Correct 2 ms 376 KB n = 32
14 Correct 2 ms 376 KB n = 32
15 Correct 2 ms 376 KB n = 32

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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