제출 #964965

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
964965		AlphaMale06	Longest beautiful sequence (IZhO17_subsequence)	C++14	0 / 100	439 ms	262144 KiB

subsequence

#include <bits/stdc++.h>

using namespace std;
const int N = 1e5+3;
const int bits=21;
int dp[1<<bits], prv[1<<bits], from[1<<bits], 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];
    set<int> st;
    vector<int> occ;
    for(int i=1; i<=n; i++){
        int val=1;
        int mxind=0;
        for(int j : occ){
            if(__builtin_popcount(j&a[i])==b[i]){
                if(dp[j]+1>val){
                    val=dp[j]+1;
                    mxind=j;
                }
            }
        }
        if(val>dp[a[i]]){
            from[a[i]]=i;
            dp[a[i]]=val;
            prv[a[i]]=mxind;
        }
        if(st.find(a[i])==st.end()){
            st.insert(a[i]);
            occ.push_back(a[i]);
        }
    }
    int ans=0, cur=0;
    for(int i : occ){
        if(dp[i]>ans){
            ans=dp[i];
            cur=from[i];
        }
    }
    cout << ans << '\n';
    vector<int> cons;
    while(cur!=0){
        cons.push_back(cur);
        cur=from[prv[a[cur]]];
    }
    reverse(cons.begin(), cons.end());
    for(int e : cons)cout << e << " ";
    cout << '\n';
}

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