oj.uz

Submission #141136

# Submission time Handle Problem Language Result Execution time Memory
141136 2019-08-07T01:04:47 Z Namnamseo Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 556 KB 
#include <vector>
#include <bits/stdc++.h>
using namespace std;

#include "messy.h"

char s[200];

void search(int tl, int tr) {
	if(tl+1 == tr) {
		return;
	}

	int mid = (tl+tr) / 2;
	for(int i = tl; i < mid; ++i) {
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}

	fill(s+tl, s+mid, '1');
	search(mid, tr);
	fill(s+tl, s+mid, '0');

	fill(s+mid, s+tr, '1');
	search(tl, mid);
	fill(s+mid, s+tr, '0');
}

int ans[200];

void hcraes(int tl, int tr) {
	int mid = (tl + tr) / 2;
	if(tl+1 == tr) return;

	for(int i=tl, ni=tl; i<tr; ++i) {
		s[ans[i]] = '1';
		bool res = check_element(s);
		s[ans[i]] = '0';

		if(res) {
			swap(ans[i], ans[ni++]);
		}
	}

	for(int i=mid; i<tr; ++i) s[ans[i]] = '1';
	hcraes(tl, mid);
	for(int i=mid; i<tr; ++i) s[ans[i]] = '0';

	for(int i=tl; i<mid; ++i) s[ans[i]] = '1';
	hcraes(mid, tr);
	for(int i=tl; i<mid; ++i) s[ans[i]] = '0';
}

std::vector<int> restore_permutation(int n, int w, int r) {
	fill(s, s+n, '0');
	search(0, n);

    compile_set();

	iota(ans, ans+n, 0);
	fill(s, s+n, '0');
	hcraes(0, n);

	vector<int> ret(n);
	for(int i=0; i<n; ++i) ret[ans[i]] = i;
	return ret;
}

Subtask #1
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

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