Submission #1142716

#	Time	Username	Problem	Language	Result	Execution time	Memory
1142716		kitlix	Longest beautiful sequence (IZhO17_subsequence)	C++20	23 / 100	6093 ms	3396 KiB

subsequence

#include <bits/stdc++.h>
#define int long long

using namespace std;

const int MAXA = (1 << 20);

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n);
    for (auto& el : a)
        cin >> el;
    vector<int> k(n);
    for (auto& el : k)
        cin >> el;
    vector<int> dp(n);
    vector<int> par(n);
    for (int i = 0; i < n; ++i) {
        dp[i] = 1;
        par[i] = -1;
        for (int j = 0; j < i; ++j) {
            if (__builtin_popcount(a[i] & a[j]) == k[i]) {
                if (dp[j] + 1 > dp[i]) {
                    dp[i] = dp[j] + 1;
                    par[i] = j;
                }
            }
        }
    }
    int mx = 0, mxi = 0;
    for (int i = 0; i < n; ++i) {
        if (dp[i] > mx) {
            mx = dp[i];
            mxi = i;
        }
    }
    cout << mx << '\n';
    int cur = mxi;
    vector<int> ans;
    while (cur != -1) {
        ans.push_back(cur);
        cur = par[cur];
    }
    reverse(ans.begin(), ans.end());
    for (auto el : ans)
        cout << el + 1 << ' ';
}

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