제출 #1006798

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006798		mohyay	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	1 ms	2396 KiB

subsequence

//
//  main1.cpp
//  problem1
//
//  Created by Mohammad Bashkail on 20/10/1445 AH.
//

#include <bits/stdc++.h>

using namespace std;
#define endl '\n'
using ll = long long;
#define pb push_back
#define pF first
#define pS second
#define SP <<" "<<
vector<bitset<21>> a;
ll a1[112345], k[112345], dp[112345], par[112345];
map<ll,pair<ll,ll>> m;
int main() {
    ios::sync_with_stdio(0);cout.tie(0); cin.tie(0);
    ll n;
    cin>>n;
    for (int i=0; i<n; i++) {
        ll x;
        cin>>x;
        bitset<21> b(x);
        a.pb(b);
        a1[i] = x;
    }
    for (int i=0; i<n; i++) cin>>k[i];
    
    fill(dp, dp+n, 1);
    fill(par, par+n, -1);
    
    for (int i=0; i<n; i++) {
        for (int j=0; j<(1<<8); j++) {
            bitset<21> b1(j);
            bitset<21> b(a[i] & b1);
            if (ll(b.count()) == k[i]) {
                if (m.find(j) == m.end()) continue;
                if (m[j].pF+1 > dp[i]) {
                    par[i] = m[j].pS;
                    dp[i] = m[j].pF+1;
                }
            }
        }
        if (m[a1[i]].pF < dp[i]) {
            m[a1[i]] = {dp[i], i};
        }
    }

    pair<ll,ll> mx = {-1, 0};
    for (int i=0; i<n; i++) {
        if (dp[i] > mx.pF) {
            mx = {dp[i], i};
        }
    }
    cout << mx.pF << endl;
    ll i = mx.pS;
    vector<ll> ans;
    while(i != -1) {
        ans.pb(i);
        i = par[i];
    }
    reverse(ans.begin(), ans.end());
    for (ll i : ans) cout << i+1 << " ";
}

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