Submission #344151

#	Time	Username	Problem	Language	Result	Execution time	Memory
344151		IZhO_2021_I_want_Silver	Longest beautiful sequence (IZhO17_subsequence)	C++14	0 / 100	1 ms	492 KiB

subsequence

#include <iostream>
#include <algorithm>
#include <vector>
#include <cassert>

using namespace std;

typedef pair <int, int> pii;

#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define F first
#define S second

const int N = 1e5 + 5;
const int MX = (1 << 8) + 5;

int n, a[N], k[N], pre[N], dp[N], pos[N];
vector <int> vec;

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; ++i) {
        cin >> k[i];
    }
    for (int i = 1; i <= n; ++i) {
        pre[i] = -1;
    }
    for (int i = 0; i < MX; ++i) {
        pos[i] = -1;
    }
    for (int i = 1; i <= n; ++i) {
        dp[i] = 1;
        for (int m = 0; m < MX-5; ++m) {
            if (__builtin_popcount((a[i] & m)) != k[i]) { continue; }
            if (pos[m] == -1) { continue; }
            if (dp[i] < dp[pos[m]] + 1) {
                dp[i] = dp[pos[m]] + 1;
                pre[i] = pos[m];
            }
        }
        if (pos[a[i]] == -1) { pos[a[i]] = i; continue; }
        if (dp[i] >  dp[pos[a[i]]]) {
            pos[a[i]] = i;
        }
    }
    int ans = 0, ps = 0;
    for (int i = 1; i <= n; ++i) {
        if (ans < dp[i]) {
            ans = dp[i];
            ps = i;
        }
    }
    while (ps != -1) {
        vec.pb(ps);
        ps = pre[ps];
    }
    reverse(all(vec));
    cout << ans <<"\n";
    for (int i = 0; i < sz(vec); ++i) {
        cout << vec[i] <<" ";
    }
}

int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
4
1 2 3 4
10 0 1 0

2
8 9
20 0

5
5 3 5 3 5
10 1 20 1 20
*/

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