Submission #1189563

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189563		SalihSahin	Longest beautiful sequence (IZhO17_subsequence)	C++20	23 / 100	6092 ms	3548 KiB

subsequence

#include "bits/stdc++.h"
#define pb push_back
#define int long long
using namespace std;

const int N = 1e2;
const int inf = 1e17;

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n;
    cin>>n;
    vector<int> a(n), k(n);
    for(int i = 0; i < n; i++){
        cin>>a[i];
    }
    for(int i = 0; i < n; i++){
        cin>>k[i];
    }

    vector<int> dp(n, 1), par(n);
    int ans = 0, mxind = -1;
    for(int i = 0; i < n; i++){
        par[i] = i;

        for(int j = i-1; j >= 0; j--){
            if(__builtin_popcount(a[i]&a[j]) == k[i]){
                if(dp[j] + 1 > dp[i]){
                    dp[i] = dp[j] + 1;
                    par[i] = j;
                }
            }
        }
        if(ans < dp[i]){
            ans = dp[i];
            mxind = i;
        }
    }
    cout<<ans<<endl;
    vector<int> ansarr;
    while(par[mxind] != mxind){
        ansarr.pb(mxind);
        mxind = par[mxind];
    }
    ansarr.pb(mxind);
    reverse(ansarr.begin(), ansarr.end());
    for(int i = 0; i < ans; i++){
        cout<<ansarr[i] + 1<<" ";
    }
    cout<<endl;
    return 0;
}

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