Submission #964793

#	Time	Username	Problem	Language	Result	Execution time	Memory
964793		AlphaMale06	Longest beautiful sequence (IZhO17_subsequence)	C++14	23 / 100	6034 ms	2444 KiB

subsequence

#include <bits/stdc++.h>

using namespace std;
const int N = 1e5+3;
int dp[N], prv[N], a[N], b[N];

int main()
{
    int n;
    cin >> n;
    for(int i=1; i<= n; i++)cin >> a[i];
    for(int i=1; i<= n; i++)cin >> b[i];
    int ans=0, cur=0;
    for(int i=1; i<=n; i++){
        dp[i]=1;
        prv[i]=0;
        for(int j=i-1; j>=1; j--){
            if(__builtin_popcount(a[j]&a[i])==b[i]){
                if(dp[j]+1>dp[i]){
                    dp[i]=dp[j]+1;
                    prv[i]=j;
                }
            }
        }
        ans=max(ans, dp[i]);
        if(dp[i]==ans)cur=i;
    }
    cout << ans << '\n';
    vector<int> cons;
    while(cur!=0){
        cons.push_back(cur);
        cur=prv[cur];
    }
    reverse(cons.begin(), cons.end());
    for(int e : cons)cout << e << " ";
    cout << '\n';
}

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