제출 #907195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
907195		daoquanglinh2007	Longest beautiful sequence (IZhO17_subsequence)	C++17	23 / 100	6013 ms	2392 KiB

subsequence

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

const int NM = 1e5;

int n, a[NM+5], k[NM+5], dp[NM+5], trace[NM+5], best = 1;
vector <int> v;

int main(){
	ios_base::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;
		for (int j = 1; j < i; j++)
			if (__builtin_popcount(a[j]&a[i]) == k[i] && dp[j]+1 > dp[i]){
				dp[i] = dp[j]+1;
				trace[i] = j;
			}
		if (dp[i] > dp[best]) best = i;
	}
	cout << dp[best] << '\n';
	while (best > 0){
		v.push_back(best);
		best = trace[best];
	}
	for (int i = (int)v.size()-1; i >= 0; i--) cout << v[i] << ' ';
	return 0;
}

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