제출 #156277

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
156277		andrew	Longest beautiful sequence (IZhO17_subsequence)	C++17	40 / 100	6062 ms	176916 KiB

subsequence

#include <bits/stdc++.h>

//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

#define fi first
#define se second
#define p_b push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sset ordered_set
#define sqr(x) (x)*(x)
#define pw(x) (1ll << x)

using namespace std;
typedef long long ll;
typedef long double ld;
const ll MAXN = 1123456;
const ll N = 1e6 + 2;
const ll inf = 3e18;
ll buben = 2000;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());

template <typename T> void vout(T s){cout << s << endl;exit(0);}

int f[1025][1025][21], f1[1025][1025][21];

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

    ll n;
    cin >> n;

    vector <ll> a(n + 1), k(n + 1);

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

    vector <ll> dp(n + 1), pr(n + 1);

    for(int i = 1; i <= n; i++){
        dp[i] = 1;
        ll F = (pw(10) - 1) & a[i], S = a[i] >> 10;
        for(int j = 0; j < pw(10); j++){
            ll K = k[i] - __builtin_popcount(j & S);
            if(K >= 0){
                if(dp[i] < f[F][j][K] + 1){
                    dp[i] = f[F][j][K] + 1;
                    pr[i] = f1[F][j][K];
                }
            }
        }

        for(int j = 0; j < pw(10); j++){
            if(dp[i] > f[j][S][__builtin_popcount(F & j)]){
                f[j][S][__builtin_popcount(F & j)] = dp[i];
                f1[j][S][__builtin_popcount(F & j)] = i;
            }
        }
    }

    ll Mx = *max_element(dp.begin() + 1, dp.end());

    cout << Mx << "\n";

    for(int i = 1; i <= n; i++)if(dp[i] == Mx){
        ll x = i;
        vector <ll> ans;
        while(x){
            ans.p_b(x);
            x = pr[x];
        }

        reverse(all(ans));
        for(auto i : ans)cout << i << " ";
        cout << "\n";
        return 0;

    }

    return 0;
}

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