제출 #314290

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
314290		balbit	Longest beautiful sequence (IZhO17_subsequence)	C++14	7 / 100	4 ms	4896 KiB

subsequence

#include <bits/stdc++.h>
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];
int dp[maxn];
int frm[maxn];
int lasta[1<<20];
signed main(){
    IOS();
    memset(frm, -1, sizeof frm);
    int n; cin>>n;
    vector<int> A(n);
    for (int i = 0; i<n; ++i) {
        cin>>A[i];
    }
    int m = 0;
    int re =0;
    int lst = -1;
    for (int i = 0; i<n; ++i) {
        int k; cin>>k;
        int dd = 1;
        for (int j = m-1; j>=0; --j) {
            if (__builtin_popcount(a[j] & A[i]) == k) {
                if (1+dp[j] > dd) {
                    dd = 1+dp[j];
                    frm[i] = lasta[a[j]];
                }
                swap(a[j], a[m-1]);
                swap(dp[j], dp[m-1]);
                --m;
            }
        }
        lasta[A[i]] = i;
        a[m] = A[i];
        dp[m] = dd;
        re = max(re, dd);
        if (dd == re) {
            lst = i;
        }
        ++m;
    }
    cout<<re<<endl;
    vector<int> rr;
    for (; lst != -1; lst = frm[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: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 60