oj.uz

Submission #59774

# Submission time Handle Problem Language Result Execution time Memory
59774 2018-07-23T05:27:20 Z KieranHorgan Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 15 ms 556 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

vector<int> restore_permutation(int n, int w, int r) {
    // add_element("0");
    // compile_set();
    // check_element("0");
	string t;
	for(int i = 0; i < n; i++)
		t+='0';

	queue<pair<int, int>> q;
	q.emplace(0, n);
	while(!q.empty()) {
		int l = q.front().first;
		int r = q.front().second;
		q.pop();
		if(l+1 >= r) continue;
		string s = t;
		for(int i = 0; i < n; i++)
			if(i < l || i >= r)
				s[i] = '1';
		// cerr << s << endl;
		int mid = (l+r)/2;
		for(int i = l; i < mid; i++) {
			s[i] = '1';
			add_element(s);
			// cerr << s << endl;
			s[i] = '0';
		}
		q.emplace(l, mid);
		q.emplace(mid, r);
	}
	// cerr << endl << endl;

	compile_set();

	for(int i = 0; i < n; i++)
		t[i] = '1';
	map<pair<int, int>, set<int>> pos;
	for(int i = 0; i < n; i++)
		pos[{0, n}].insert(i);
	q.emplace(0, n);
	while(!q.empty()) {
		int l = q.front().first;
		int r = q.front().second;
		q.pop();
		if(l+1 >= r) continue;
		string s = t;
		int mid = (l+r)/2;
		for(int i = 0; i < n; i++)
			if(pos[{l, r}].count(i))
				s[i] = '0';

		// cerr << s << endl;
		for(auto i: pos[{l, r}]) {
			s[i] = '1';
			if(check_element(s))
				pos[{l, mid}].insert(i);
			else
				pos[{mid, r}].insert(i);
			s[i] = '0';
		}

		q.emplace(l, mid);
		q.emplace(mid, r);
	}

	vector<int> ans(n);
	for(int i = 0; i < n; i++)
		ans[*pos[{i, i+1}].begin()] = i;

    return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 8
2 Correct 2 ms 384 KB n = 8
3 Correct 2 ms 256 KB n = 8
4 Correct 2 ms 384 KB n = 8
5 Correct 2 ms 256 KB n = 8
6 Correct 2 ms 384 KB n = 8
7 Correct 2 ms 256 KB n = 8
8 Correct 2 ms 256 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 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 2 ms 384 KB n = 8

Subtask #2
18.0 / 18.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 Correct 2 ms 384 KB n = 32
5 Correct 2 ms 384 KB n = 32
6 Correct 3 ms 384 KB n = 32
7 Correct 3 ms 384 KB n = 32
8 Correct 2 ms 384 KB n = 32
9 Correct 2 ms 384 KB n = 32
10 Correct 2 ms 384 KB n = 32
11 Correct 2 ms 384 KB n = 32
12 Correct 2 ms 384 KB n = 32
13 Correct 2 ms 384 KB n = 32
14 Correct 2 ms 384 KB n = 32
15 Correct 2 ms 384 KB n = 32

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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