제출 #1130933

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1130933		mnbvcxz123	Longest beautiful sequence (IZhO17_subsequence)	C++20	100 / 100	2840 ms	95980 KiB

subsequence

#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int N = 1e5;
const int B = 10;
int bc[1 << B][1 << B];
struct State {
	int len;
	int end;
} dp[1 << B][1 << B][B + 1];

int main() {
	for (int i = 0; i < (1 << B); i++) {
		for (int j = 0; j < (1 << B); j++) { bc[i][j] = __builtin_popcount(i & j); }
	}

	int n;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; i++) cin >> a[i];
	vector<int> k(n);
	for (int i = 0; i < n; i++) cin >> k[i];
	int ans = 1;
	int best_i = 0;
	vector<int> prv(n);
	iota(prv.begin(), prv.end(), 0);

	for (int i = 0; i < n; i++) {
		int l = a[i] >> B;
		int r = a[i] % (1 << B);
		int lbs = 1;
		for (int j = 0; j < (1 << B); j++) {
			int needed = k[i] - bc[j][l];
			if (needed < 0 || needed > B) continue;
			if (dp[j][r][needed].len + 1 > lbs) {
				lbs = dp[j][r][needed].len + 1;
				prv[i] = dp[j][r][needed].end;
			}
		}

		if (lbs > ans) {
			ans = lbs;
			best_i = i;
		}

		for (int j = 0; j < (1 << B); j++) {
			State &new_state = dp[l][j][bc[r][j]];
			if (lbs > new_state.len) {
				new_state.len = lbs;
				new_state.end = i;
			}
		}
	}

	cout << ans << endl;

	vector<int> res;
	while (prv[best_i] != best_i) {
		res.push_back(best_i);
		best_i = prv[best_i];
	}
	res.push_back(best_i);

	reverse(res.begin(), res.end());
	for (int x : res) { cout << x + 1 << " "; }
}

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