# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747864 | tcmmichaelb139 | Longest beautiful sequence (IZhO17_subsequence) | C++17 | 6071 ms | 2388 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 100'001;
int n;
int dp[MAXN];
int pre[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
vector<int> a(n), k(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> k[i];
}
for (int i = 0; i <= n; i++)
pre[i] = -1, dp[i] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (__builtin_popcount(a[j] & a[i]) == k[i]) {
if (dp[i] < dp[j] + 1) {
dp[i] = dp[j] + 1;
pre[i] = j;
}
}
}
}
int ans = 0, ind = -1;
for (int i = 0; i < n; i++) {
if (ans < dp[i]) {
ans = dp[i];
ind = i;
}
}
vector<int> sol;
for (int i = ind; i != -1; i = pre[i]) {
sol.push_back(i);
}
reverse(begin(sol), end(sol));
cout << size(sol) << '\n';
for (int i = 0; i < size(sol); i++)
cout << sol[i] + 1 << " \n"[i + 1 == size(sol)];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |