제출 #867481

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
867481		Halym2007	Longest beautiful sequence (IZhO17_subsequence)	C++11	0 / 100	1 ms	2396 KiB

subsequence

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
#define pb push_back
#define sz size()
#define ff first
#define ss second
int a[N], k[N], dp[N], jogap, n, par[N], idx;
vector <int> cykar;
int main () {
//	freopen("subsequence.in", "r", stdin);
//	freopen("subsequence.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; ++i) {
		cin >> k[i];
	}
	for (int i = 1; i <= n; ++i) {
		dp[i] = 1;
		par[i] = i;
		for (int j = i - 1; j > 0; j--) {
			int x = a[j] & a[i];
			if (__builtin_popcount(x) == k[i]) {
				if (dp[i] < dp[j] + 1) {
					dp[i] = dp[j] + 1;
					par[i] = j;
					break;
				}
			}
		}
		if (jogap < dp[i]) {
			jogap = dp[i];
			idx = i;
		}
	}
	cout << jogap << "\n";
	while (1) {
		cykar.pb (idx);
		if (idx == par[idx]) break;
		idx = par[idx];
	}
	reverse(cykar.begin(), cykar.end());
	for (int i : cykar) {
		cout << i << " ";
	}
}

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