Submission #1116517

#	Time	Username	Problem	Language	Result	Execution time	Memory
1116517		Tymond	Longest beautiful sequence (IZhO17_subsequence)	C++17	100 / 100	4203 ms	226908 KiB

subsequence

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 1e5 + 7;
const int S = 10;
const int lower_bits = (1 << S) - 1;
const int higher_bits = (1 << (2 * S)) - 1 - lower_bits;
int a[MAXN];
int k[MAXN];
int dp[MAXN];
int anc[MAXN];
pii dp2[(1 << S) + 7][(1 << S) + 7][2 * S + 7];
int n;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }

    for(int i = 1; i <= n; i++){
        cin >> k[i];
    }

    pii best = mp(0, -1);
    int cnt;
    for(int i = 1; i <= n; i++){
        dp[i] = 1;
        anc[i] = -1;

        for(int msk = 0; msk < (1 << S); msk++){
            cnt = __builtin_popcount(msk & a[i]);
            if(k[i] >= cnt && k[i] <= cnt + S && dp2[msk][(a[i] >> 10)][k[i] - cnt].fi + 1 > dp[i]){
                dp[i] = dp2[msk][(a[i] >> 10)][k[i] - cnt].fi + 1;
                anc[i] = dp2[msk][(a[i] >> 10)][k[i] - cnt].se;
            }
        }

        for(int msk = 0; msk < (1 << S); msk++){
            cnt = __builtin_popcount((msk << S) & a[i]);
            if(dp[i] > dp2[a[i] & lower_bits][msk][cnt].fi){
                dp2[a[i] & lower_bits][msk][cnt].fi = dp[i];
                dp2[a[i] & lower_bits][msk][cnt].se = i;
            }
        }

        if(best.fi < dp[i]){
            best.fi = dp[i];
            best.se = i;
        }
    }

    cout << best.fi << '\n';
    vi vec;
    vec.pb(best.se);
    while(anc[best.se] != -1){
        vec.pb(anc[best.se]);
        best.se = anc[best.se];
    }

    reverse(all(vec));
    for(auto ele : vec){
        cout << ele << ' ';
    }
    cout<< '\n';

    return 0;
}

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