oj.uz

Submission #791057

# Submission time Handle Problem Language Result Execution time Memory
791057 2023-07-23T11:29:07 Z khshg Unscrambling a Messy Bug (IOI16_messy) C++14
70 / 100
 2 ms 468 KB 
#include"messy.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> restore_permutation(int N, int W, int R) {
	int B = __lg(N);
	for(int i = 0; i < B; ++i) {
		string S(N, '0');
		for(int j = 0; j <= i; ++j) {
			S[j] = '1';
		}
		add_element(S);
	}
	for(int i = B - 1; i >= 0; --i) {
		string S(N, '1');
		S[B - i - 1] = '0';
		for(int j = B; j < N; ++j) {
			if(j % (1 << (i + 1)) < (1 << i)) {
				S[j] = '0';
				add_element(S);
				S[j] = '1';
			}
		}
	}
	compile_set();
	vector<int> P(N, -1);
	for(int i = 0; i < B; ++i) {
		string S(N, '0');
		for(int j = 0; j < i; ++j) S[P[j]] = '1';
		for(int j = 0; j < N; ++j) {
			if(S[j] == '1') continue;
			S[j] = '1';
			if(!check_element(S)) {
				S[j] = '0';
				continue;
			}
			P[i] = j;
			break;
		}
		if (P[i] == -1) {
			while (1) {
			}
		}
	}
	string og(N, '0');
	for(int i = 0; i < B; ++i) og[P[i]] = '1';
	for(int i = 0; i < N; ++i) {
		if (og[i] == '1') continue;
		int k = 0;
		string S(N, '1');
		S[i] = '0';
		for(int j = 0; j < B; ++j) {
			S[P[j]] = '0';
			if (!check_element(S)) {
				k += 1 << (B - j - 1);
			}
			S[P[j]] = '1';
		}
		P[k] = i;
	}
	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 0 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 0 ms 212 KB n = 8
4 Correct 0 ms 296 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 300 KB n = 8
12 Correct 1 ms 300 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 32
2 Correct 1 ms 296 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 0 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 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 0 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 32
2 Correct 0 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 296 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 300 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 216 KB n = 32
15 Correct 1 ms 256 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 30.0

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