Submission #1095519

#	Time	Username	Problem	Language	Result	Execution time	Memory
1095519		anhthi	Longest beautiful sequence (IZhO17_subsequence)	C++14	100 / 100	3962 ms	176220 KiB

subsequence

#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)

template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }

template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }

template <class X>
    inline void compress(X &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }

int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}

const ll oo = (ll) 1e17;
const int inf = (ll) 2e9 + 7, mod = (ll) 1e9 + 7;

const int mxn = 1e5 + 15, M = 10;

void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }

int n;
int a[mxn];

int f[mxn], trace[mxn], k[mxn];
pair<int, int> g[MASK(M) + 5][MASK(M) + 5][21];

int main(void) {

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n;
    rep(i, n) cin >> a[i];
    rep(i, n) cin >> k[i];

    int pos = 0;
    rep(i, n) {
        f[i] = 1;
        int pf = 0, sf = 0;

        forn(t, 0, M - 1) {
            if (BIT(a[i], t))
                pf |= MASK(t);
            if (BIT(a[i], t + M))
                sf |= MASK(t);
        }

        forn(mask, 0, MASK(M) - 1) {
            int cnt = k[i] - popcount(mask & pf);
            if (cnt >= 0 && maximize(f[i], g[mask][sf][cnt].first + 1)) {
                trace[i] = g[mask][sf][cnt].second;
            }
        }
        if (f[pos] < f[i]) pos = i;
        forn(mask, 0, MASK(M) - 1) {
            maximize(g[pf][mask][popcount(mask & sf)], mp(f[i], i));
        }
    }

    cout << f[pos] << '\n';

    vector<int> lst;
    while (pos) {
        lst.pb(pos);
        pos = trace[pos];
    }
    reverse(all(lst));
    for (int p : lst) cout << p << ' ';

    cout << '\n';

    return 0;
}

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