제출 #1288585

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1288585		Faisal_Saqib	Longest beautiful sequence (IZhO17_subsequence)	C++20	40 / 100	6064 ms	3632 KiB

subsequence

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=1e5+100,M=(1<<20)+20;
ll dp[N],a[N],k[N],bk[N],dm[M],ind[M];;
int main()
{
    ios::sync_with_stdio(0);
    cout.tie(0);cin.tie(0);
    ll n;
    cin>>n;
    bool pos=1;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        pos&=(a[i]<(1<<8));
    }
    for(int i=1;i<=n;i++)cin>>k[i];
    for(int i=1;i<=n;i++)
    {
        dp[i]=1;
        bk[i]=-1;
        if(pos)
        {
            for(int j=0;j<(1<<8);j++)
            {
                if(__builtin_popcountll(a[i]&j)==k[i] and dm[j]+1>dp[i])
                {
                    dp[i]=dm[j]+1;
                    bk[i]=ind[j];
                }
            }
            if(dp[i]>dm[a[i]])
            {
                dm[a[i]]=dp[i];
                ind[a[i]]=i;
            }
            continue;
        }
        for(int j=1;j<i;j++)
        {
            if(dp[j]+1>dp[i] and __builtin_popcountll(a[i]&a[j])==k[i])
            {
                dp[i]=dp[j]+1;
                bk[i]=j;
            }
        }
    }
    int k=max_element(dp+1,dp+n+1)-dp;
    cout<<dp[k]<<endl;
    vector<int> cur;
    while(k>0)
    {
        cur.push_back(k);
        k=bk[k];
    }
    while(cur.size()){cout<<cur.back()<<' ';cur.pop_back();}
    cout<<endl;
    return 0;
}

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