Submission #844725

#	Time	Username	Problem	Language	Result	Execution time	Memory
844725		Pa_sha	Longest beautiful sequence (IZhO17_subsequence)	C++17	23 / 100	6020 ms	3420 KiB

subsequence

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
constexpr int mod=1e9+7;
void solve()
{
    int n;
    cin>>n;
    int a[n],k[n];
    int to[n]={0},ans=0;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    for(int i=0;i<n;i++)
    {
        to[i]=-1;
        cin>>k[i];
    }
    int dp[n]={0};
    vector<int>res;
    for(int i=0;i<n;i++)
    {
        dp[i]=1;
        for(int j=i-1;j+1>=dp[i];j--)
        {
            if(__builtin_popcount((a[i]&a[j]))==k[i])
            {
                if(dp[j]+1>dp[i])
                {
                    to[i]=j;
                    dp[i]=dp[j]+1;
                }
            }
        }
        if(dp[i]>dp[ans])
        {
            ans=i;
        }
    }
    while(ans>-1)
    {
        res.push_back(ans+1);
        ans=to[ans];
    }
    reverse(res.begin(),res.end());
    cout<<res.size()<<endl;
    for(int&i:res)
    {
        cout<<i<<" ";
    }
    cout<<endl;
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t=1;
//    cin>>t;
    while(t--)
    {
        solve();
    }
}

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