Submission #1112953

#	Time	Username	Problem	Language	Result	Execution time	Memory
1112953		adiyer	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	318 ms	262144 KiB

subsequence

#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
 
using namespace std;
 
typedef int ll;
 
const int N = 5e3 + 2;
const int M = (1 << 8);

ll n, pos;
ll a[N], k[N], dp[N];
 
void sol(){
	cin >> n, pos = 1;
	for(ll i = 1; i <= n; i++) cin >> a[i];
	for(ll i = 1; i <= n; i++) cin >> k[i];
	for(ll i = 1; i <= n; i++){
		dp[i] = 1;
		for(ll j = 1; j < i; j++)
			if((__builtin_popcount(a[j] & a[i]) == k[i]))
				dp[i] = max(dp[i], dp[j] + 1);
		if(dp[i] > dp[pos]) pos = i;
		// cout << dp[i] << '\n';
	}
	vector < ll > ans;
	ans.pb(pos);
	while(pos > 1){
		for(ll i = pos - 1; i >= 1; i--){
			if(__builtin_popcount(a[pos] & a[i]) == k[pos] && dp[pos] == dp[i] + 1){
				pos = i;
				break;
			}
		}
		ans.pb(pos);
	}
	reverse(ans.begin(), ans.end());
	cout << ans.size() << '\n';
	for(ll x : ans) cout << x << ' ';
}
 
signed main(){
	ios                     
	sol();
// 	slow();
//  stress();
}

Compilation message (stderr)

subsequence.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize ("g",on)
      |

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