oj.uz

Submission #570486

# Submission time Handle Problem Language Result Execution time Memory
570486 2022-05-30T07:40:55 Z franfill Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 468 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
string base = "";

std::vector<int> restore_permutation(int n, int w, int r) {
	int P = 0;
	while(1<<P < n) P++;
	//cerr << P << "\n";
	for (int i = 0; i < n; i++) base += "0";
	for (int v = 0; v < n; v++)
	{
		for (int p = 0; p < P; p++) 
		{
			if ((v&(1<<p)) == 0) 
			{
				string query = base;
				for (int i = (v>>(p+1))<<(p+1); (i>>(p+1)) == (v>>(p+1)); i++) if (i != v)
				{
					query[i] = '1';
				}
				add_element(query);
				//cerr << query << "\n";
			}
		}
	}
    compile_set();
	vector < set < int > > ranges(n);
	for (int i = 0; i < n; i++) ranges[0].insert(i);
	for (int p = P-1; p >= 0; p--)
	{
		for (int i = 0; i < n; i += (1<<(p+1)))
		{
			set < int > zeros;		
			set < int > ones = ranges[i];
			string s = base;
			for (auto v : ranges[i])
			{
				s[v] = '1';
			}
			for (auto v : ranges[i])
			{
				s[v] = '0';
				//cerr << "check " << s << "\n";
				if (check_element(s))
				{
					//cerr << "ok\n";
					zeros.insert(v);
					ones.erase(v);
				}
				s[v] = '1';
			}
			ranges[i] = zeros;
			ranges[i+(1<<p)] = ones;
		}
	}
	vector < int > ans(n);
	for (int i = 0; i < n; i++)
	{
		assert(ranges[i].size() == 1);
		ans[*ranges[i].begin()] = i;
	}
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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