Submission #1269150

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269150		thdh__	Longest beautiful sequence (IZhO17_subsequence)	C++20	100 / 100	4393 ms	130256 KiB

subsequence

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fu(x,a,b) for (auto x=a;x<=b;x++)
#define fd(x,a,b) for (auto x=a;x>=b;x--)

using namespace std;
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

/*
Competitive Programming notes that I need to study & fix my dumbass self:

1. Coding:
- Always be sure to check the memory of arrays (maybe use vectors), for loops
- Always try to maximize the memory if possible, even if you are going for subtasks
- Do not exploit #define int long long, it will kill you

2. Stress: 
- Always try generating big testcases and try if they run

3. Time management:
- Don't overcommit or undercommit, always spend a certain amount of time to think a problem, don't just look at it and say I'm fucked
- Do not spend too much time coding brute-force solutions, they should be easily-codable solutions that don't take up too much time

Time management schedule:
Offline / LAH days (4 problems - 3h):
15' thinking of solution / idea
1. no idea: skip
2. yes idea: continue thinking for <= 15'

+ implementing: <= 20'
+ brute-force: <= 5'
+ test generator: <= 5'

I hate offline because I am dumb
*/

typedef pair<int, int> ii;
const int N = 3e5+5;
const int M = 10;
const int B = 750;
const int mod = 1e9+7;
const int inf = 2e9;
using cd = complex<double>;
const long double PI = acos(-1);
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;} 

int n;
int a[N], k[N];
int dp[N], x[N], y[N], f[2000][2000][30];
int prv[N];

void solve()
{
	cin>>n;
	for (int i = 1; i <= n; i++) cin>>a[i];
	for (int i = 1; i <= n; i++) cin>>k[i];
	int ans = 0, mxpos = 0;
	for (int i = 1; i <= n; i++) 
	{
		dp[i] = 1;
		x[i] = (a[i] & ((1<<M) - 1)), y[i] = (a[i] - x[i]) >> M;
		// cout<<x[i]<<" "<<y[i]<<endl;
		for (int mask1 = 0; mask1 < (1<<M); mask1++) 
		{
			int sim = k[i] - __builtin_popcount(x[i] & mask1);
			if (f[mask1][y[i]][sim] == -1) continue;
			if (dp[f[mask1][y[i]][sim]] + 1 > dp[i]) 
			{
				dp[i] = dp[f[mask1][y[i]][sim]] + 1;
				prv[i] = f[mask1][y[i]][sim];
			}
		}
		for (int mask2 = 0; mask2 < (1<<M); mask2++) 
		{
			int pos = f[x[i]][mask2][__builtin_popcount(mask2 & y[i])];
			if (pos == -1 || dp[i] > dp[pos]) f[x[i]][mask2][__builtin_popcount(mask2 & y[i])] = i;
		}
		if (ans < dp[i]) 
		{
			ans = dp[i], mxpos = i;
		}
	}
	cout<<ans<<endl;
	vector<int> res;
	while (dp[mxpos] > 1) 
	{
		res.pb(mxpos);
		mxpos = prv[mxpos];
	}
	res.pb(mxpos);
	reverse(all(res));
	for (auto i : res) cout<<i<<" ";
	
}

/*
Go through the mistakes you usually make and revise your code, for god's sake...
*/

signed main()
{
	bruh
	//freopen("input.inp","r",stdin);
	//freopen("output.inp","w",stdout);
	int t = 1;
	// cin>>t;
	while (t--)
	{
		solve();
		cout<<"\n";
	}
}

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