Submission #1269776

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269776		tminh	Longest beautiful sequence (IZhO17_subsequence)	C++20	100 / 100	4562 ms	206880 KiB

subsequence

#include "bits/stdc++.h"
using namespace std;

#define task ""
#define ll long long
#define endl '\n'
#define fi first
#define se second
#define vall(a) (a).begin(), (a).end()
#define sze(a) (int)a.size()
#define pii pair<int, int>
#define pll pair<ll, ll>


#define ep emplace_back
#define pb push_back
#define pf push_front


const ll mod = 1e9 + 7;
const int N = 1e6 + 5;
const ll oo = 1e18;

bool START;
// so lan doc sol roi moi biet lam :

int n, a[N], tr[N], k[N];
pii dp[1 << 10][1 << 10][25];

void trace(int id) {
	vector<int> ans;
	while(id != 0) {
		ans.pb(id);
		id = tr[id];
	}
	reverse(vall(ans));
	cout << sze(ans) << endl;
	for (int i : ans) cout << i << " ";
}

const int base = ((1 << 10) - 1);
inline void solve() {
	int ans = 0, id = 0;
	for (int i = 1; i <= n; ++i) {
		int hcur = (a[i] >> 10), lcur = (a[i] & base);
		
		int res = 0;
		//k_ : con l prev dong gop vao l
		for (int mask = 0; mask < (1 << 10); ++mask) {
			int k_ = (k[i] - __builtin_popcount(mask & hcur));
			if (k_ >= 0 && k_ <= 10) {
				if (res < dp[mask][lcur][k_].fi) {
					res = dp[mask][lcur][k_].fi;
					tr[i] = dp[mask][lcur][k_].se; 
				}
			}
		}
		++res;
		if (ans < res) {
			ans = res;
			id = i;
		}
		
		for (int mask = 0; mask < (1 << 10); ++mask) {
			int k_ = __builtin_popcount(mask & lcur);
			dp[hcur][mask][k_] = max(dp[hcur][mask][k_], make_pair(res, i));
		}
	}
	trace(id);
}


inline void input() {
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    for (int i = 1; i <= n; ++i) cin >> k[i];
    return solve();
}
bool END;

int main() {
    if(fopen(task ".inp", "r")) {
        freopen(task ".inp", "r", stdin);
        freopen(task ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    input();
    
    
    cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << 's' << endl;
    cerr << "Memory: " << fabs ((&END - &START)) / 1048576.0 << "MB\n";
    return 0;
}

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:83:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         freopen(task ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
subsequence.cpp:84:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |         freopen(task ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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