제출 #849161

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
849161		wakandaaa	Longest beautiful sequence (IZhO17_subsequence)	C++17	23 / 100	308 ms	262144 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;
}

int n;
int a[N], cnt[N];
int f[N], pre[N];

namespace sub12 
{

void solve() {
	for (int i = 2; i <= n; ++i) {
		for (int j = 1; j < i; ++j) {
			int x = a[i] & a[j];
			if (popcount(x) == cnt[i]) {
				if (maxi(f[i], f[j] + 1)) pre[i] = j;
			}
		}
	}

	int mx = 0;
	int pos = 1;
	for (int i = 1; i <= n; ++i) {
		if (maxi(mx, f[i])) pos = i;
	}

	vector<int> res{pos};
	while (pre[pos]) {
		pos = pre[pos];
		res.push_back(pos);
	}

	reverse(all(res));
	cout << (int) res.size() << '\n';
	for (int i : res) cout << i << ' ';
}

}

namespace sub3
{

pair<int, int> best[1 << 8]; // {len, pos}
int mx = 0, pos = 0;

void solve() {
	for (int i = 1; i <= n; ++i) {
		if (best[a[i]].fi == 0) {
			best[a[i]] = mp(1, i);
		}

		for (int mask = 0; mask < bit(8); ++mask) {
			if (popcount(a[i] & mask) == cnt[i]) {
				if (best[mask].fi + 1 > best[a[i]].fi) {
					best[a[i]].fi = best[mask].fi + 1;
					best[a[i]].se = i;
					pre[i] = best[mask].se;
				}
			}
		}

		if (best[a[i]].fi > mx) {
			mx = best[a[i]].fi;
			pos = i;
		}
	}

	vector<int> res{pos};
	while (pre[pos]) {
		pos = pre[pos];
		res.push_back(pos);
	}

	reverse(all(res));
	cout << (int) res.size() << '\n';
	for (int i : res) cout << i << ' ';
}

}

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];


    if (n <= 5000)
    	sub12::solve();
    else {
    	sub3::solve();
    }

    return 0;
}

/*

*/

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