oj.uz

Submission #58578

# Submission time Handle Problem Language Result Execution time Memory
58578 2018-07-18T10:01:59 Z radoslav11 Unscrambling a Messy Bug (IOI16_messy) C++14
20 / 100
 3 ms 512 KB 
#include <bits/stdc++.h>
#include "messy.h"
//#include "Lgrader.cpp"

using namespace std;
template<class T, class T2> inline int chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline int chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const int MAXN = (1 << 20);

int n;

void prec(int l, int r)
{
	if(l == r)
		return;

	int mid = (l + r) >> 1;
	for(int i = l; i <= mid; i++)
	{
		string s(::n, '0');
		for(int j = l; j <= r; j++)
			s[j] = '1';

		s[i] = '0';
		add_element(s);
	}

	prec(l, mid);
	prec(mid + 1, r);
}

void get(int l, int r, vector<int> cands, vector<int> &ret)
{
	if(l == r)
	{
		ret[l] = cands.back();
		return;
	}

	vector<int> L, R;
	int mid = (l + r) >> 1;

	for(int i: cands)
	{
		string s(::n, '0');
		for(int j: cands)
			s[j] = '1';

		s[i] = '0';

		if(check_element(s))
			L.push_back(i);
		else 
			R.push_back(i);
	}

	get(l, mid, L, ret);
	get(mid + 1, r, R, ret);
}

vector<int> restore_permutation(int n, int w, int r) 
{
	::n = n;

	string tmp(n, '0');
	w--;
	r--;

	prec(0, n - 1);
	compile_set();
	
	vector<int> ret(n, 0);
	vector<int> cands(n, 0);
	for(int i = 0; i < n; i++)
		cands[i] = i;

	get(0, n - 1, cands, ret);
	return ret;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.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 Incorrect 2 ms 384 KB grader returned WA
5 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 512 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 512 KB grader returned WA
2 Halted 0 ms 0 KB -