Submission #826780

#	Time	Username	Problem	Language	Result	Execution time	Memory
826780		bachhoangxuan	Longest beautiful sequence (IZhO17_subsequence)	C++17	100 / 100	2898 ms	64960 KiB

subsequence

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
//const int inf=1e18;
const int mod=998244353;
const int maxn=100005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;

int Max[(1<<10)+5][(1<<10)+5][15];
int a[maxn],k[maxn],dp[maxn],trace[maxn];
int cnt[(1<<10)+5];

int query(int x,int c){
    int d=(x>>10),r=x&((1<<10)-1),res=0;
    for(int i=0;i<(1<<10);i++){
        int num=cnt[i&d];
        if(num>c || c-num>10) continue;
        int pos=Max[i][r][c-num];
        if(dp[pos]>dp[res]) res=pos;
    }
    return res;
}
void update(int x,int p){
    int d=(x>>10),r=x&((1<<10)-1);
    for(int i=0;i<(1<<10);i++){
        int pos=Max[d][i][cnt[r&i]];
        if(dp[pos]<dp[p]) pos=p;
        Max[d][i][cnt[r&i]]=pos;
    }

}
void solve(){
    for(int i=0;i<(1<<10);i++) cnt[i]=__builtin_popcount(i);
    int n,res=0,p=0;cin >> n;
    for(int i=1;i<=n;i++) cin >> a[i];
    for(int i=1;i<=n;i++) cin >> k[i];
    for(int i=1;i<=n;i++){
        int pos=query(a[i],k[i]);trace[i]=pos;
        dp[i]=dp[pos]+1;update(a[i],i);
        if(dp[i]>res) res=dp[i],p=i;
    }
    vector<int> ans;
    while(p) ans.push_back(p),p=trace[p];
    reverse(ans.begin(),ans.end());
    cout << (int)ans.size() << '\n';
    for(int x:ans) cout << x << ' ';
    cout << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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