Submission #87231

#	Time	Username	Problem	Language	Result	Execution time	Memory
87231		dimash241	Longest beautiful sequence (IZhO17_subsequence)	C++17	100 / 100	5273 ms	109716 KiB

subsequence

# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (int i = x; i <= y; ++i) 
#define FOr(i,x,y)  for (int i = x; i >= y; --i)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;                                                                                 
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 1e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n;
int a[N];
int b[N];
int v[N];
int p[N];
pair < int, int > dp[12][(1 << 10) + 12][(1 << 10) + 12];

int main () {               
	SpeedForce;
    cin >> n;
    For (i, 1, n) cin >> a[i];
    For (i, 1, n) cin >> b[i];

    For (i, 1, n) {
    	v[i] = 1;
    	int j = 0, x = (a[i] >> 10);
    	for (int mask = 0; mask < (1 << 10); ++mask) {
    		int B = b[i] - __builtin_popcount(x & mask);
    		if (B >= 0 && B <= 10) {
    			int y = (a[i] & ((1 << 10) - 1));
    			if (dp[B][mask][y].F + 1 > v[i]) {
    				v[i] = dp[B][mask][y].F + 1;
    				j = dp[B][mask][y].S;
    			}
    		}
    	}
    	p[i] = j;
    	for (int mask = 0; mask < (1 << 10); ++mask) {
    		int nmask = __builtin_popcount(mask & a[i]);
    		if (v[i] > dp[nmask][x][mask].F) {
    			dp[nmask][x][mask] = mp(v[i], i); 
    		}
    	}
    }

    int res = max_element(v + 1, v + n + 1) - v;
    vector < int > ans;
    while (res != 0) {
    	ans.pb(res);
    	res = p[res];
    }

    reverse(every(ans));
    cout << ans.size() << '\n';
    for (auto it : ans)
    	cout << it << ' ';

    return Accepted;
}

// Coded By OB

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