Submission #872469

#	Time	Username	Problem	Language	Result	Execution time	Memory
872469		KiaRez	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	22 ms	45916 KiB

subsequence

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 1e5+23, lg = 20;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int n, a[2][N], k[N], pre[1024][1024];
pii ds[1024][1024][11], dp[N], ans=Mp(1,1);
vector<int> vec;
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n;
	for(int i=1; i<=n; i++) {
		cin>>a[0][i];
		a[1][i] = (a[0][i]/1024);
		a[0][i] -= (a[1][i] * 1024);
	}
	for(int i=1; i<=n; i++) cin>>k[i];
	for(int i=0; i<1024; i++) for(int j=0; j<1024; j++) pre[i][j] = __builtin_popcount(i&j);

	for(int i=1; i<=n; i++) {
		dp[i] = {1, 0};
		for(int mask=0; mask<1024; mask++) {
			if(k[i]>=pre[mask][a[0][i]]) dp[i] = max(dp[i], ds[a[1][i]][mask][k[i] - pre[mask][a[0][i]]]);
		}
		ans = max(ans, {dp[i].F, i});
		pii f = dp[i]; f.F++; f.S=i;
		for(int mask=0; mask<1024; mask++) {
			ds[mask][a[0][i]][pre[mask][a[1][i]]] = max(ds[mask][a[0][i]][pre[mask][a[1][i]]], f);
		}
	}

	//vec.pb(ans.S);
	//fuck(dp[3].S);
	while(ans.S != 0) {
		vec.pb(ans.S);
		ans.S = dp[ans.S].S;
	}
	reverse(all(vec));
	cout<<size(vec)<<endl;
	for(auto it : vec) cout<<it<<' ';

	return 0;
}

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