제출 #1290858

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

subsequence

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+1;
int a[N],k[N];
int dp[N],bki[N];
const int M=(1<<10);
int mx[M][M][21],bk[M][M][21];

int main()
{
    ios::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    int n;
    cin>>n;
    int fp=(1<<10)-1;
    int sp=(1<<20)-1-fp;
    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;
        int lp=a[i]>>10; // removing first 10 bits
        for(int j=0;j<M;j++)
        {
            int pc = __builtin_popcount(a[i]&j);
            int rm = k[i]-pc;
            if(rm<0)continue;
            // mx[j][lp][rm]
            if(mx[j][lp][rm] >= dp[i])
            {
                dp[i]=mx[j][lp][rm]+1;
                bki[i]=bk[j][lp][rm];
            }
        }
        int sp=(a[i]&fp);
        for(int j=0;j<M;j++)
        {
            int pc=__builtin_popcount(lp&j);
            if(dp[i]>mx[sp][j][pc])
            {
                mx[sp][j][pc]=dp[i];
                bk[sp][j][pc]=i;
            }
        }
    }
    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=bki[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: 60 / 60