제출 #757848

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
757848		shadow_sami	Longest beautiful sequence (IZhO17_subsequence)	C++17	23 / 100	45 ms	5204 KiB

subsequence

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll a[mx];
ll b[mx];
vector<pi> dp(((1<<9)+5),{-1,-1});
ll ah[1 << 9][1 << 9];
ll pre[mx];
ll dp2[mx];

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n;
        ans = -1;
        fip(0,n){
        	cin>>a[i];
        	// assert(a[i] <= (1<<9));
        }
        fip(0,n)
        	cin>>b[i];
        fip(0,n+2)
        	dp2[i] = -1e18,pre[i] = i;
        if(n <= 5000+5){
        	tptp = -1;
        	ans = -1;
        	dp2[0] = 0;
	        fip(1,n+1){
	        	dp2[i] = max(dp2[i],1ll);
	        	fjn(i-1,1){        		
	        		if(__builtin_popcount(a[i-1] & a[j-1]) == b[i-1])
	        			if(dp2[i] < dp2[j] + 1){
	        				dp2[i] = dp2[j] + 1;
	        				pre[i] = j;
	        			}      		        		
	        	}
	        	if(ans < dp2[i]){
	        			ans = dp2[i];
	        			tptp = i;
	        		}
	        	// debug(dp2[i]);
	        }
	        vi v;
	        v.push_back(tptp);
	        while(tptp != pre[tptp]){
	        	tptp = pre[tptp];
	        	v.push_back(tptp);
	        }
	        cout<<ans<<nli;
	        reverse(v.begin(),v.end());
	        fx(v)
	        	cout<<x<<" ";
        	return 0;
        }
        fip(0,(1<<8))
        	fjp(0,(1<<8))
        		ah[i][j] = __builtin_popcount(i & j);
        fip(0,n){
        	if(dp[a[i]].ff == -1){
        		dp[a[i]].ff = 1;
        		dp[a[i]].ss = i;
        	}
        	fjp(0,(1<<8)){
        		if(ah[a[i]][j] != b[i]) 
        			continue;
        		if(dp[a[i]].ff < dp[j].ff+1){
        			pre[i] = dp[j].ss;
        			dp[a[i]].ff = dp[j].ff+1;
        			dp[a[i]].ss = i;
        		}
        	}
        	if(dp[a[i]].ff > ans){
        		ans = dp[a[i]].ff;
        		tp = dp[a[i]].ss;
        	}
        }
        cout<<ans<<nli;
        vi v;
        v.push_back(tp);
        while(tp != pre[tp]){
        	tp = pre[tp];
        	v.push_back(tp);
        }
        reverse(v.begin(),v.end());
        fx(v)
        	cout<<x+1<<" ";
        cout<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

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