제출 #939745

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
939745		ifateen	Longest beautiful sequence (IZhO17_subsequence)	C++14	7 / 100	1 ms	604 KiB

subsequence

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

bool ckmax(int& a, int b) {
    if (a < b) return a = b, true;
    return false;
}
const int MAXN = 2001;
int dp[MAXN], prv[MAXN], a[MAXN], k[MAXN];
int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        dp[i] = 1;
        prv[i] = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> k[i];
    }
    for (int i = 1; i < n; i++)
        for (int j = 0; j < i; j++)
            if (__builtin_popcount(a[i] & a[j]) == k[i] && ckmax(dp[i], 1 + dp[j]))
                prv[i] = j;
    int mx = max_element(dp, dp + n) - dp;
    vector<int> ans;
    ans.push_back(mx);
    while (mx != prv[mx]) {
        mx = prv[mx];
        ans.push_back(mx);
    }
    reverse(ans.begin(), ans.end());
    cout << ans.size() << '\n';
    for (auto& i : ans) cout << i + 1 << ' ';
}

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