# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883509 | skywwla | Longest beautiful sequence (IZhO17_subsequence) | C++17 | 6043 ms | 1884 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 ;
using ll = long long ;
int32_t main() {
ios::sync_with_stdio(false) ;
cin.tie(nullptr) ;
int n ; scanf("%d", &n) ;
vector<int> a(n), k(n), dp(n, 1), pr(n, -1) ;
for (int &i : a) scanf("%d", &i) ;
for (int &i : k) scanf("%d", &i) ;
for (int i = 0 ; i < n ; i++) {
for (int j = 0 ; j < i ; j++) {
if (__builtin_popcount(a[i] & a[j]) == k[i] && dp[j] + 1 > dp[i]) {
dp[i] = dp[j] + 1 ;
pr[i] = j ;
}
}
}
int pos = max_element(dp.begin(), dp.end()) - dp.begin() ;
cout << dp[pos] << "\n" ;
vector<int> res ;
while (pos != -1) {
res.push_back(pos) ;
pos = pr[pos] ;
}
reverse(res.begin(), res.end()) ;
for (int i : res) printf("%d ", i + 1) ;
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... |