Submission #486640

#	Time	Username	Problem	Language	Result	Execution time	Memory
486640		ez_ioi	Longest beautiful sequence (IZhO17_subsequence)	C++17	23 / 100	432 ms	262148 KiB

subsequence

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int mxN = 3e6 + 5, mod = 1e9 + 7, LOG = 20;

int n, a[mxN], k[mxN], dp[mxN], p[mxN];

pair <int, int> d[mxN];

int main() {
	ios :: sync_with_stdio(false), cin.tie(nullptr);
	cin >> n;
	for (int i = 1; i <= n; ++i) cin >> a[i];
	for (int i = 1; i <= n; ++i) cin >> k[i];
	if (n <= 5000) {
		pair <int, int> ans = {0, 0};
		for (int i = 1; i <= n; ++i) {
			dp[i] = 1;
			for (int j = i - 1; j > 0; j--) {
				if (__builtin_popcount((a[i] & a[j])) == k[i]) {
					if (dp[j] + 1 > dp[i]) {
						dp[i] = dp[j] + 1;
						p[i] = j;
					}
				}
			}
			ans = max(ans, {dp[i], i});
		}
		cout << ans.first << '\n';
		int now = ans.second;
		vector <int> seq;
		while (now) { seq.push_back(now); now = p[now]; }
		reverse(seq.begin(), seq.end());
		for (auto x : seq) cout << x << ' ';
		return 0;
	}
	bool ok = 1;
	for (int i = 1; i <= n; ++i) {
		ok &= (a[i] < (1 << 8));
	}
	assert(ok == 1);
	pair <int, int> ans = {0, 0};
	for (int i = 1; i <= n; ++i) {
		if (!d[a[i]].first) d[a[i]] = {1, i};
		for (int j = 0; j < (1 << 8); ++j) {
			if (__builtin_popcount((a[i] & j)) == k[i]) {
				if (d[j].second != i && d[j].first + 1 > d[a[i]].first) {
					d[a[i]] = {d[j].first + 1, i};
					p[i] = d[j].second;
				}
			}
		}
		ans = max(ans, d[a[i]]);
	}
	cout << ans.first << '\n';
	int now = ans.second;
	vector <int> seq;
	while (now) { seq.push_back(now); now = p[now]; }
	reverse(seq.begin(), seq.end());
	for (auto x : seq) cout << x << ' ';
	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 16 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 60