제출 #93563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93563		Turysbek	Longest beautiful sequence (IZhO17_subsequence)	C++14	0 / 100	2 ms	380 KiB

subsequence

// In the Name of God

#include <bits/stdc++.h>

using namespace std;

#define	ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(a) int(a.size())
#define all(v) v.begin(), v.end()
#define bpc(v) __builtin_popcountll(v)
#define itr iterator
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, a, b) for (int i = b; i >= a; --i)
#define ub upper_bound
#define lb lower_bound

const int N = 1e5 + 5;
const int mod = 1e8 + 7;
const int inf = 1e9 + 1;
const double eps = 1e-15;
const int pw = 257;

int n, a[N], k[N], id, p[N];
pair<int, int> dp[N];
vector<int> ans;

int main() {
	#ifdef Madi
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
	#endif

	ios_base :: sync_with_stdio(false); cin.tie(NULL);

	cin >> n;
	rep(i, 1, n)
        cin >> a[i];
    rep(i, 1, n)
        cin >> k[i];

    rep(i, 1, n) {
        dp[a[i]] = max(dp[a[i]], mp(1, i));
        rep(last, 0, 255)
            if (bpc(a[i] & last) == k[i] && dp[last].fi >= dp[a[i]].fi)
                    p[i] = dp[last].se, dp[a[i]] = mp(dp[last].fi + 1, i);
        if (dp[a[i]] > dp[a[id]])
            id = i;
    }

    while (id >= 1) {
        ans.pb(id);
        id = p[id];
    }

    cout << sz(ans) << "\n";
    per(i, 0, sz(ans) - 1)
        cout << ans[i] << ' ';

	#ifdef Madi
    cerr << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
	return 0;
}

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