Submission #314830

#	Time	Username	Problem	Language	Result	Execution time	Memory
314830		balbit	Longest beautiful sequence (IZhO17_subsequence)	C++14	100 / 100	2887 ms	92436 KiB

subsequence

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 1e5+5;

int a[maxn], d[maxn], f[maxn];
int F[1<<10][1<<10][11];
int X[1<<10][1<<10][11];
int pop[maxn];

signed main(){
    IOS();
    memset(f, -1, sizeof f);
    int n; cin>>n;
    for (int i = 0; i<n; ++i) {
        cin>>a[i];
    }
    for (int i = 0; i<(1<<10); ++i) pop[i] = __builtin_popcount(i);
    memset(X, -1, sizeof X);
    const int BT = (1<<10) - 1;
    int re = 0;
    int lst = -1;
    for(int i = 0; i<n; ++i) {
        int k; cin>>k;
        d[i] = 1;
        for( int m = 0; m<(1<<10); ++m) {
            int K = k-pop[(a[i]>>10)&m];
            if (K < 0 || K > 10) continue;
            if (d[i] < 1 + F[m][BT & a[i]][K]) {
                d[i] = 1 + F[m][BT & a[i]][K];
                f[i] = X[m][BT & a[i]][K];
            }
        }
        int bg = a[i]>>10;
        for(int m = 0; m<(1<<10); ++m) {
            int K = pop[(a[i] & m)];
            if (F[bg][m][K] < d[i]) {
                F[bg][m][K] = d[i];
                X[bg][m][K] = i;
            }
        }
        re = max(re, d[i]);
        if (re == d[i]) lst = i;
    }
    cout<<re<<endl;
    vector<int> rr;
    for (; lst != -1; lst = f[lst]) rr.pb(lst);
    for (int i = SZ(rr)-1; i>=0; --i) cout<<rr[i]+1<<' ';
}

/*
5
5 3 5 3 5
10 1 20 1 20
*/

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