제출 #1006907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006907		vqpahmad	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	2 ms	16732 KiB

subsequence

#include<bits/stdc++.h>
using namespace std;
#ifdef ONPC
#include"debug.h"
#else
#define debug(...) 42
#endif
#define endl '\n'
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
const int mod = 1e9 + 7;
const int MAXN = 1e6 + 15;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
int a[MAXN], k[MAXN], n;
int dp[MAXN], aux[MAXN], prv[MAXN], pos[MAXN];

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	for (int i = 0; i < n; i++)
		cin >> k[i];

	memset(aux, -1, sizeof(aux));
	memset(prv, -1, sizeof(prv));
	for (int i = 0; i < n; i++){
		for (int j = 0; j < 256; j++){
			if (__popcount(a[i]&j) == k[i] && ckmax(dp[i], aux[j] + 1)){
				prv[i] = pos[j];
			}
		}
		if (ckmax(aux[a[i]], dp[i])){
			pos[a[i]] = i;
		}
	}
	int mx = *max_element(dp, dp + n);
	vector<int> ans;
	for (int i = 0; i < n; i++){
		if (dp[i] == mx){
			int cur = i;
			while (prv[cur] != -1){
				ans.pb(cur);
				cur = prv[cur];
			}
			ans.pb(cur);
			break;
		}
	}
	reverse(all(ans));
	cout << mx + 1 << endl;
	for (auto it : ans)
		cout << it + 1 << ' ';
	cout << endl;
}

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