제출 #1006642

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

subsequence

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

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

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

    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 << " ";
}

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