oj.uz

Submission #961339

# Submission time Handle Problem Language Result Execution time Memory
961339 2024-04-11T20:57:09 Z MinaRagy06 Unscrambling a Messy Bug (IOI16_messy) C++17
70 / 100
 3 ms 640 KB 
#include <bits/stdc++.h>
#include "messy.h"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long

vector<int> restore_permutation(int n, int w, int r) {
	string s, t;
	for (int i = 0; i < n; i++) {
		s.push_back('1');
		t.push_back('0');
	}
	for (int i = 1; i < n; i *= 2) {
		s[i] = '0';
//		cout << "> " << s << '\n';
		add_element(s);
		if (i % 2 == 0) s[i / 2] = '1';
	}
	int lg = __lg(n);
	for (int i = 0; i < n; i++) {
		if ((i & -i) == i) continue;
		for (int j = 0; j < lg; j++) {
			if ((i >> j) & 1) {
				t[i] = '1';
				t[1 << j] = '1';
				add_element(t);
				t[1 << j] = '0';
				t[i] = '0';
			}
		}
	}
	compile_set();
	vector<int> p(n, -1);
	for (int i = 0; i < n; i++) s[i] = '1', t[i] = '0';
	bool used[n]{};
	for (int j = 0; j < lg; j++) {
		for (int k = 0; k < n; k++) {
			if (used[k]) continue;
			s[k] = '0';
			if (check_element(s)) {
//				cout << s << '\n';
				used[k] = 1;
				p[1 << j] = k;
				break;
			}
			s[k] = '1';
		}
		if (j - 1 >= 0) {
			s[p[1 << (j - 1)]] = '1';
		}
	}
//	for (auto i : p) {
//		cout << i << ' ';
//	}
//	cout << endl;
	set<int> gud[lg];
	for (int j = 0; j < lg; j++) {
		t[p[1 << j]] = '1';
		for (int k = 0; k < n; k++) {
			if (t[k] == '1') continue;
			t[k] = '1';
			if (check_element(t)) {
				gud[j].insert(k);
			}
			t[k] = '0';
		}
		t[p[1 << j]] = '0';
	}
//	for (int j = 0; j < lg; j++) {
//		for (auto i : gud[j]) {
//			cout << i << ' ';
//		}
//		cout << '\n';
//	}
	vector<int> order;
	for (int i = 0; i < n; i++) {
		if ((i & -i) == i && i) continue;
		order.push_back(i);
	}
	sort(order.begin(), order.end(), [&] (int x, int y) {return __builtin_popcount(x) > __builtin_popcount(y);});
	set<int> rem;
	for (int i = 0; i < n; i++) {
		rem.insert(i);
	}
	for (int i = 1; i < n; i *= 2) {
		rem.erase(p[i]);
	}
	for (auto i : order) {
		set<int> cur = rem;
		for (int j = 0; j < lg; j++) {
			if ((i >> j) & 1) {
				set<int> cur2;
				for (auto k : cur) {
					if (gud[j].find(k) != gud[j].end()) {
						cur2.insert(k);
					}
				}
				cur = cur2;
			}
		}
		int pos = *cur.begin();
//		cout << i << ' ' << pos << '\n';
		p[i] = pos;
		rem.erase(pos);
	}
	vector<int> ans(n);
	for (int i = 0; i < n; i++) {
		ans[p[i]] = i;
	}
//	for (auto i : ans) {
//		cout << i << ' ';
//	}
//	cout << '\n';
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 30.0

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