Submission #1269096

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269096		khoianh	Longest beautiful sequence (IZhO17_subsequence)	C++20	100 / 100	3610 ms	178608 KiB

subsequence

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mn = 1e5 + 5, fr = (1 << 10);
ll n, a[mn], dp[mn], x[mn], y[mn], w[fr + 5][fr + 5][21], trace[mn], k[mn];

void solve(){
	cin >> n;
	for(int i = 1; i <= n; ++i) cin >> a[i], x[i] = a[i] / fr, y[i] = a[i] % fr;
	ll ans = 1;
	for(int i = 1;i  <= n; ++i) cin >> k[i];
	for(int i = 1; i <= n; ++i){
		dp[i] = 1;
		trace[i] = i;
		for(int j = 0; j < fr; ++j){
			if(__builtin_popcount(j & x[i]) <= k[i]){
				ll r = w[j][y[i]][k[i] - __builtin_popcount(j & x[i])];
				if(dp[i] < dp[r] + 1) dp[i] = dp[r] + 1, trace[i] = r;
			} 
		} 
		for(int j = 0; j < fr; ++j){
			ll r = w[x[i]][j][__builtin_popcount(j & y[i])];
			if(dp[i] > dp[r]) w[x[i]][j][__builtin_popcount(j & y[i])] = i;
		}
		if(dp[ans] < dp[i]) ans = i;
	}
	cout << dp[ans] << "\n";
	vector<ll> v;
	while(trace[ans] != ans) v.push_back(ans), ans = trace[ans];
	v.push_back(ans);
	reverse(v.begin(), v.end());
	for(auto i : v) cout << i << " ";
    return;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	if(fopen(".INP", "r")) {
		freopen(".INP", "r", stdin);
		freopen(".OUT", "w", stdout);
	}
	int testCase = 1;
	//cin >> testCase;
	while(testCase--) solve();
}

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:40:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |                 freopen(".INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~
subsequence.cpp:41:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |                 freopen(".OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

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