제출 #1006646

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006646		SulA	Longest beautiful sequence (IZhO17_subsequence)	C++17	40 / 100	6072 ms	2136 KiB

subsequence

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

const int MAXN = 1e5;
int n;
int a[MAXN+1], k[MAXN+1];

void subtask1and2() {
    int dp[n+1] = {}, pre[n+1];
    for (int i = 1; i <= n; i++) {
        dp[i] = 1;
        pre[i] = i;
        for (int j = 1; j < i; j++) if (__builtin_popcount(a[i] & a[j]) == k[i]) {
                if (dp[j] + 1 > dp[i]) {
                    dp[i] = dp[j] + 1;
                    pre[i] = j;
                }
            }
    }
    int final = max_element(dp, dp+n+1) - dp;
    vector<int> ans;
    while (pre[final] != final) {
        ans.push_back(final);
        final = pre[final];
    }
    ans.push_back(final);
    reverse(ans.begin(), ans.end());
    cout << ans.size() << '\n';
    for (int i : ans) cout << i << " ";
}

void subtask3() {
    int dp[n+1] = {}, pre[n+1];
    int best[256] = {}, bestindex[256] = {};
    for (int i = 1; i <= n; i++) {
        dp[i] = 1;
        pre[i] = i;
        for (int val = 0; val < 256; val++) {
            if (__builtin_popcount(a[i] & val) != k[i]) continue;
            if (best[val] + 1 > dp[i]) {
                dp[i] = best[val] + 1;
                pre[i] = bestindex[val];
            }
        }
        if (dp[i] > best[a[i]]) {
            best[a[i]] = dp[i];
            bestindex[a[i]] = i;
        }
    }
    int final = max_element(dp, dp+n+1) - dp;
    vector<int> ans;
    while (pre[final] != final) {
        ans.push_back(final);
        final = pre[final];
    }
    ans.push_back(final);
    reverse(ans.begin(), ans.end());
    cout << ans.size() << '\n';
    for (int i : ans) cout << i << " ";
}

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

    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> k[i];

    if (*max_element(a, a+n+1) < 256) {
        subtask3();
    } else {
        subtask1and2();
    }
}

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