제출 #156207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
156207		andrew	Longest beautiful sequence (IZhO17_subsequence)	C++17	40 / 100	654 ms	3804 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;
const ll buben = 1000;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());

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

ll Dp[MAXN], Wh[MAXN];

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);

    if(n <= 5000){
         for(int i = 1; i <= n; i++){
                dp[i] = 1;
                pr[i] = 0;
                for(int j = 1; j < i; j++)if(__builtin_popcountll(a[i] & a[j]) == k[i]){
                    if(dp[i] < dp[j] + 1){
                        dp[i] = dp[j] + 1;
                        pr[i] = j;
                    }
                }
            }

            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;

            }
    }

    if(*max_element(a.begin() + 1, a.end()) < pw(8)){
        for(int i = 1; i <= n; i++){
            dp[i] = 1;
            pr[i] = 0;

            for(int j = 0; j < pw(8); j++)if(__builtin_popcountll(a[i] & j) == k[i]){
                if(dp[i] < Dp[j] + 1){
                    dp[i] = Dp[j] + 1;
                    pr[i] = Wh[j];
                }
            }

            if(Dp[a[i]] < dp[i]){
                Dp[a[i]] = dp[i];
                Wh[a[i]] = 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;

        }
    }

     for(int i = 1; i <= n; i++){
            dp[i] = 1;
            pr[i] = 0;
            for(int j = i - 1; j > 0; (i - j + 1 > buben ? j -= (rnd() % j + 1) : j--))if(__builtin_popcountll(a[i] & a[j]) == k[i]){
                if(dp[i] < dp[j] + 1){
                    dp[i] = dp[j] + 1;
                    pr[i] = j;
                }
            }
        }

    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