# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
515288 | Mazaalai | Longest beautiful sequence (IZhO17_subsequence) | C++17 | 6088 ms | 2340 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 ALL(x) x.begin(),x.end()
using namespace std;
const int N = 1e5+1;
int n;
int nums[N], bits[N], dp[N], par[N];
int bitCnt(int a) {
return bitset <20>(a).count();
}
signed main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
int ans = 1;
for (int i = 1; i <= n; i++) cin >> nums[i];
for (int i = 1; i <= n; i++) cin >> bits[i];
for (int i = 1; i <= n; i++) {
for (int j = i+1; j <= n; j++) {
if (bits[j] == bitCnt(nums[i]&nums[j]) && dp[j] < dp[i]+1) {
dp[j] = dp[i]+1;
par[j] = i;
}
}
if (dp[ans] < dp[i]) ans = i;
}
vector <int> tmp;
while(ans != 0) {
tmp.pb(ans);
ans = par[ans];
}
cout << tmp.size() << '\n';
reverse(ALL(tmp));
for (auto el : tmp) cout << el << ' '; cout << '\n';
}
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... |