Submission #919805

#	Time	Username	Problem	Language	Result	Execution time	Memory
919805		Whisper	Longest beautiful sequence (IZhO17_subsequence)	C++17	100 / 100	4184 ms	177136 KiB

subsequence

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int N;
int a[MAX], k[MAX];
//dãy con có độ dài lớn nhất

const int MASK = MASK(10);
int f[MASK][MASK][21];
int cnt[MAX], dp[MAX];

//dp(i) là dãy con dài nhất khi xét i thằng đầu
//f(i, j, cnt) vị trí tốt nhất của dp(i) sao cho
//i là trạng thái 10 số đầu
//j là số mà khi thằng (a[f(i, j, cnt)] >> 10) & j thì 10 bit sau sẽ có k bit bật

int ret[MAX];

int best = 1;
void Whisper(){
    cin >> N;
    for (int i = 1; i <= N; ++i) cin >> a[i];
    for (int i = 1; i <= N; ++i) cin >> k[i];
    REP(msk, MASK) cnt[msk] = __builtin_popcount(msk);

    memset(f, -1, sizeof f);
    FOR(i, 1, N){
        dp[i] = 1;
        REP(msk, MASK){
            int bit = cnt[msk & a[i]];
            if (k[i] - bit < 0 || k[i] - bit > 10) continue;
            int p = f[msk][(a[i] >> 10)][k[i] - bit];
            if (~p) if (maximize(dp[i], dp[p] + 1)){
                ret[i] = p;
            }
        }
        REP(msk, MASK){
            int &p = f[a[i] & (MASK - 1)][msk][cnt[(a[i] >> 10) & msk]];
            if (p == -1 || dp[p] < dp[i]) p = i;

        }
        if (dp[i] > dp[best]){
            best = i;
        }
    }
    cout << dp[best] << '\n';
    deque <int> v;
    while (best > 0){
        v.push_front(best);
        best = ret[best];
    }
    for (auto&x : v) cout << x << " ";
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

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