제출 #1006734

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006734		emad234	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	249 ms	262144 KiB

subsequence

#include "bits/stdc++.h"
#define F first
#define S second
#define ll long long
#define pii pair<ll,ll>
const ll mxN = 5e5 + 5;
const ll mod = 1e9 + 7;
using namespace std;
int a[mxN],b[mxN];
int dp[mxN];
int prv[mxN];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    for(int i = 1;i <= n;i++){
        cin >>a[i];
    }
    for(int i = 1;i <= n;i++){
        cin >>b[i];
    }
    int ans = 1;
    int mxid = 1;
    dp[1] = 1;
    for(int i = 2;i <= n;i++){
        dp[i] = 1;
        int t = 100;
        while(t--){
            int j = rand() % n;
            j++;
            if(__builtin_popcount(a[i] & a[j]) == b[i]) {
                if(dp[j] + 1 > dp[i]){
                    dp[i] = dp[j] + 1;
                    prv[i] = j;
                }
            }
        }
        if(dp[i] > ans){
            ans = dp[i];
            mxid = i;
        }
    }
    cout<< ans<<'\n';
    vector<int>v;
    while(mxid){
        v.push_back(mxid);
        mxid = prv[mxid];
    }
    reverse(v.begin(),v.end());
    for(auto x : v) cout<<x<<' ';

}

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