Submission #873881

#	Time	Username	Problem	Language	Result	Execution time	Memory
873881		noiaint	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	0 ms	604 KiB

subsequence

#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e5 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

const int LOG = 10;

int n;
int a[N], cnt[N];
pair<int, int> f[1 << LOG][1 << LOG][LOG + 1];
int pre[N];
int res = 1, id = 1;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

	cin >> n;
	for (int i = 1; i <= n; ++i)
		cin >> a[i];
	for (int i = 1; i <= n; ++i)
		cin >> cnt[i];

	for (int i = 1; i <= n; ++i) {
		int l = a[i] >> LOG;		// 10 left most bits
		int r = a[i] % (1 << LOG);	// 10 right most bits
		int mx = 1;

		for (int mask = 0; mask < bit(LOG); ++mask) {
			int rembit = cnt[i] - popcount(mask & l);
			if (rembit < 0 || rembit > LOG) continue;
			pair<int, int> &cur = f[mask][r][rembit];
			if (cur.fi + 1 > mx) {
				mx = cur.fi + 1;
				pre[i] = cur.se;
			}
		}

		for (int mask = 0; mask < bit(LOG); ++mask) {
			pair<int, int> cur = f[l][mask][popcount(mask & r)];
			if (mx > cur.fi) {
				cur.fi = mx;
				cur.se = i;
			}
		}

		if (mx > res) {
			res = mx;
			id = i;
		}
	}

	vector<int> pos;
	for (int i = id; i != 0; i = pre[i]) {
		pos.push_back(i);
	}

	reverse(all(pos));
	
	cout << res << '\n';
	for (int i : pos) cout << i << ' ';

    return 0;
}

/*

*/

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