제출 #1070144

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1070144		VMaksimoski008	Longest beautiful sequence (IZhO17_subsequence)	C++17	7 / 100	2 ms	604 KiB

subsequence

#include <bits/stdc++.h>
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const int M = 8;

signed main() {
    int n, id = 1;
    cin >> n;

    vector<int> a(n+1), k(n+1), prv(n+1);
    for(int i=1; i<=n; i++) cin >> a[i];
    for(int i=1; i<=n; i++) cin >> k[i];

    if(n <= 2000) {
        vector<int> dp(n+1);
        for(int i=1; i<=n; i++) {
            dp[i] = 1;
            for(int j=1; j<i; j++) {
                if(__builtin_popcount(a[i] & a[j]) == k[i] && dp[i] < dp[j] + 1) {
                    dp[i] = dp[j] + 1;
                    prv[i] = j;
                    if(dp[i] > dp[id]) id = i;
                }
            }
        }

        cout << dp[id] << '\n';
        vector<int> ans;
        while(id) {
            ans.push_back(id);
            id = prv[id];
        }
        reverse(ans.begin(), ans.end());
        for(int &x : ans) cout << x << " ";
        return 0;
    }

    vector<pair<int, int> > dp(1 << M);
    for(int i=1; i<=n; i++) {
        dp[a[i]] = max(dp[a[i]], { 1, i });
        for(int j=0; j<(1<<M); j++) {
            if(__builtin_popcount(a[i] & j) == k[i]) {
                if(dp[a[i]].first < dp[j].first + 1) {
                    dp[a[i]].first = dp[j].first + 1;
                    dp[a[i]].second = i;
                    prv[i] = dp[j].second;
                    if(dp[a[i]].first > dp[a[id]].first) id = i;
                }
            }
        }
    }

    cout << dp[a[id]].first << '\n';
    vector<int> ans;
    while(id) {
        ans.push_back(id);
        id = prv[id];
    }
    reverse(ans.begin(), ans.end());
    for(int &x : ans) cout << x << " ";
    return 0;
}

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