oj.uz

Submission #373708

# Submission time Handle Problem Language Result Execution time Memory
373708 2021-03-05T13:34:06 Z LucaDantas Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 512 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> p;
string s;

void add(int l, int r) {
	if(l == r) return;
	int m = (l+r) >> 1;
	for(int i = l; i <= m; i++) {
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}
	for(int i = l; i <= m; i++)
		s[i] = '1';
	add(m+1, r);
	for(int i = l; i <= r; i++)
		s[i] = s[i]=='1'?'0':'1'; // flip
	add(l, m);
	for(int i = m+1; i <= r; i++)
		s[i] = '0';
}

void solve(int l, int r, vector<int> b) {
	if(l == r) return (void)(p[l] = b[0]);

	vector<int> g1, g2;
	for(int x : b) {
		s[x] = '1';
		if(check_element(s)) g1.push_back(x);
		else g2.push_back(x);
		s[x] = '0';
	}

	int m = (l+r) >> 1;
	for(int x : g2)
		s[x] = '1';
	solve(l, m, g1);
	for(int x : g2)
		s[x] = '0';

	for(int x : g1)
		s[x] = '1';
	solve(m+1, r, g2);
	for(int x : g1)
		s[x] = '0';
}

vector<int> restore_permutation(int N, int w, int r) {
	n = N;
	p.resize(n);
	for(int i = 0; i < n; i++)
		s.push_back('0');
	add(0, n-1);
	compile_set();
	vector<int> b(n);
	iota(b.begin(), b.end(), 0);
	for(int i = 0; i < n; i++)
		s[i] = '0';
	solve(0, n-1, b);

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

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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