Submission #160902

#	Time	Username	Problem	Language	Result	Execution time	Memory
160902		MohamedAhmed04	Longest beautiful sequence (IZhO17_subsequence)	C++14	100 / 100	3726 ms	93716 KiB

subsequence

#include <bits/stdc++.h>
 
using namespace std ;
 
const int MAX = 1e5 + 1 ;
const int Middle = 1 << 10 ;
int arr[MAX] , arr2[MAX] , f[Middle][Middle][21] , prv[MAX] , dp[MAX] , ones[(1 << 20)];
void print(int now)
{
	if(now == 0)
		return ;
	print(prv[now]) ;
	cout<<now<<" " ;
}

void preprocess(int now , int cnt , int bit)
{
	if(bit == 20)
	{
		ones[now] = cnt ;
		return ;
	}
	preprocess(now , cnt , bit+1) ;
	preprocess(now + (1 << bit) , cnt+1 , bit+1) ;
	return ;
}

int main()
{
	preprocess(0 , 0 , 0) ;
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	int n ;
	cin>>n ;
	for(int i = 1 ; i <= n ; ++i)
		cin>>arr[i] ;
	for(int i = 1 ; i <= n ; ++i)
		cin>>arr2[i] ;
	int Max = 0 , en , vall , valr , x;
	for(int i = 1 ; i <= n ; ++i)
	{
		dp[i] = 1 ;
		vall = arr[i] & (Middle - 1);
        valr = arr[i] >> 10;
		for(int j = 0 ; j < Middle ; ++j)
		{
			x = arr2[i] - ones[vall & j] ;
			if(x < 0)
				continue ;
			if(dp[f[j][valr][x]] + 1 > dp[i])
			{
				dp[i] = dp[f[j][valr][x]] + 1 ;
				prv[i] = f[j][valr][x] ;
			}
		}
		for(int j = 0 ; j < Middle ; ++j)
		{
			x = ones[valr & j] ;
			if(dp[i] > dp[f[vall][j][x]])
				f[vall][j][x] = i ;
		}
		if(dp[i] > Max)
			Max = dp[i] , en = i ;
	}
	cout<<Max<<"\n" ;
	print(en) ;
	return 0 ;
}

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:39:16: warning: 'en' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int Max = 0 , en , vall , valr , x;
                ^~

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