제출 #1159072

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

subsequence

#include <bits/stdc++.h>

using i64 = long long;

#ifdef DEBUG
    #include "debug.h"
#else
    #define debug(...) void(23)
#endif

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int N;
    std::cin >> N;
    std::vector<int> A(N), K(N);
    for (int i = 0; i < N; ++i) {
        std::cin >> A[i];
    }
    for (int i = 0; i < N; ++i) {
        std::cin >> K[i];
    }

    if (N <= 5000) {
        std::vector<std::pair<int, int>> dp(N, {1, 0});
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < i; ++j) {
                if (__builtin_popcount(A[i] & A[j]) == K[i]) {
                    dp[i] = std::max(dp[i], {dp[j].first + 1, j});
                }
            }
        }

        auto it = std::max_element(dp.begin(), dp.end());
        int ans = it->first;
        int now = it - dp.begin();
        std::vector<int> vec;
        for (int i = ans; i > 0; --i) {
            vec.emplace_back(now);
            now = dp[now].second;
        }

        std::reverse(vec.begin(), vec.end());

        std::cout << ans << '\n';
        for (int i = 0; i < ans; ++i) {
            std::cout << vec[i] + 1 << " \n"[i == ans - 1];
        }
    } else {
        std::vector<int> last(1 << 8, -1);
        std::vector<std::pair<int, int>> dp(N, {1, 0});
        for (int i = 0; i < N; ++i) {
            for (int bit = 0; bit < (1 << 8); ++bit) {
                int j = last[bit];
                if (j == -1) {
                    continue;
                }
                if (__builtin_popcount(A[i] & A[j]) == K[i]) {
                    dp[i] = std::max(dp[i], {dp[j].first + 1, j});
                }
            }
            if (last[A[i]] == -1 || dp[last[A[i]]].first < dp[i].first) {
                last[A[i]] = i;
            }
        }

        auto it = std::max_element(dp.begin(), dp.end());
        int ans = it->first;
        int now = it - dp.begin();
        std::vector<int> vec;
        for (int i = ans; i > 0; --i) {
            vec.emplace_back(now);
            now = dp[now].second;
        }

        std::reverse(vec.begin(), vec.end());

        std::cout << ans << '\n';
        for (int i = 0; i < ans; ++i) {
            std::cout << vec[i] + 1 << " \n"[i == ans - 1];
        }
    }

    return 0;
}

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