Submission #1133529

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133529		stdfloat	Longest beautiful sequence (IZhO17_subsequence)	C++20	40 / 100	62 ms	1996 KiB

subsequence

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int N = 1 << 8;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n;
	cin >> n;

	vector<int> a(n);
	for (auto &i : a)
		cin >> i;

	vector<int> k(n);
	for (auto &i : k)
		cin >> i;

	vector<int> dp(n), pr(n);
	if (n <= (int)5e3) {
		for (int i = 0; i < n; i++) {
			dp[i] = 1; pr[i] = i;
			for (int j = i - 1; j >= 0; j--) {
				if (__builtin_popcount(a[j] & a[i]) == k[i] && dp[j] + 1 > dp[i]) {
					dp[i] = dp[j] + 1; pr[i] = j;
					// break;
				}
			}
		}
	}
	else {
		vector<int> ps(N, -1);
		for (int i = 0; i < n; i++) {
			dp[i] = 1; pr[i] = i;
			for (int j = 0; j < N; j++) {
				if (ps[j] != -1 && dp[ps[j]] + 1 > dp[i] && __builtin_popcount(j & a[i]) == k[i]) {
					dp[i] = dp[ps[j]] + 1; pr[i] = ps[j];
				}
			}

			if (ps[a[i]] == -1 || dp[ps[a[i]]] < dp[i]) ps[a[i]] = i;
		}
	}

	int mx = max_element(dp.begin(), dp.end()) - dp.begin();
	cout << dp[mx] << '\n';

	vector<int> v = {mx};
	while (mx != pr[mx]) v.push_back(mx = pr[mx]);

	reverse(v.begin(), v.end());

	for (auto i : v)
		cout << i + 1 << ' ';
}

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