# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
486676 | my04 | Longest beautiful sequence (IZhO17_subsequence) | C++17 | 6061 ms | 2380 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>
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x).size()
#define S second
#define F first
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
void setIO(string name = "") {
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
if (sz(name)) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
const int inf = 1e9;
const ll INF = 1e18;
const int mod = 1e9 + 7;
const int MAXN = 1e6 + 5;
int n;
int a[MAXN];
int k[MAXN];
int dp[MAXN];
int par[MAXN];
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++) {
par[i] = -1;
dp[i] = 1;
}
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
int x = (a[i] & a[j]);
if (__builtin_popcount(x) == k[j]) {
if (dp[j] < dp[i] + 1) {
dp[j] = dp[i] + 1;
par[j] = i;
}
}
}
}
int x = 1;
for (int i = 2; i <= n; i++) {
if (dp[x] < dp[i]) {
x = i;
}
}
cout << dp[x] << '\n';
vector<int> path;
while (x != -1) {
path.pb(x);
x = par[x];
}
reverse(all(path));
for (int i : path) {
cout << i << ' ';
}
}
main() {
setIO();
int tt = 1;
// cin >> tt;
while (tt--) {
solve();
}
return 0;
}
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... |