제출 #987712

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

subsequence

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int n;
    cin >> n;

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

    for(int i=2; i<=n; i++) {
        for(int j=1; j<i; j++) {
            if(__builtin_popcount(a[i] & a[j]) == k[i] && dp[j] + 1 > dp[i]) {
                dp[i] = dp[j] + 1;
                par[i] = j;
            }
        }
    }

    int pos = 0;
    for(int i=1; i<=n; i++) if(dp[i] > dp[pos]) pos = i;

    cout << dp[pos] << '\n';

    vector<int> ans;
    while(pos != -1) {
        ans.push_back(pos);
        pos = par[pos];
    }

    reverse(all(ans));
    for(int &x : ans) cout << x << " ";
    return 0;
}

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