# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1266064 | vahagng | Longest beautiful sequence (IZhO17_subsequence) | C++20 | 4 ms | 840 KiB |
//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 1e18, mod = 1e9 + 7, mod2 = 998244353;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 1e5 + 10;
ll n, a[N], k[N], prv[N];
pair<ll, ll> dp[(1 << 8) + 1];
vector<int>trans[21][(1 << 8) + 1];
void solve(int tc) {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
prv[i] = i;
}
for (int K = 0; K <= 20; K++) {
for (int i = 0; i < 256; i++) {
for (int j = 0; j < 256; j++) {
if (__builtin_popcount(i & j) == K) {
trans[K][i].push_back(j);
}
}
}
}
for (int i = 1; i <= n; i++) cin >> k[i];
for (int j = 0; j < (1 << 8); j++) {
dp[j] = { -1, -1 };
}
ll mx = 0, id = -1;
for (int i = 1; i <= n; i++) {
if (dp[a[i]].first == -1) {
dp[a[i]] = { 1, i };
}
for (auto j : trans[k[i]][a[i]]) {
if (dp[j].first + 1 > dp[a[i]].first) {
dp[a[i]].first = dp[j].first + 1;
dp[a[i]].second = i;
prv[i] = dp[j].second;
}
}
if (dp[a[i]].first > mx) {
mx = dp[a[i]].first;
id = i;
}
}
vector<int>ans;
while (prv[id] != id) {
ans.push_back(id);
id = prv[id];
}
ans.push_back(id);
reverse(all(ans));
cout << mx << endl;
for (auto i : ans) cout << i << ' ';
cout << endl;
}
void precalc() {
}
int main() {
// SetIO("moocast");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--) {
solve(cnt++);
}
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... |