# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42610 | almasalmas | Longest beautiful sequence (IZhO17_subsequence) | C++14 | 2 ms | 376 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.
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
int a[100001];
int b[100001];
int d[11][1025][1025];
int pr[11][1025][1025];
int dr[100001];
vector <int> ans;
int main () {
freopen ("subsequence.in", "r", stdin);
freopen ("subsequence.out", "w", stdout);
int n;
scanf ("%d", &n);
int mx = -1, pos;
for (int i = 1;i <= n;i ++)
scanf ("%d", a + i);;
for (int i = 1;i <= n;i ++)
scanf ("%d", b + i);
for (int i = 1;i <= n;i ++) {
int asd = 0;
int mask1 = a[i] >> 10;
for (int j = 0;j < (1 << 10);j ++) {
int kol = b[i] - (__builtin_popcount (j & a[i]));
if (kol < 0 || kol > 10) continue;
if (d[kol][j][mask1] > asd) {
asd = d[kol][j][mask1];
dr[i] = pr[kol][j][mask1];
}
}
asd ++;
for (int j = 0;j < (1 << 10);j ++) {
int mask = (a[i] & ((1 << 10) - 1));
int kol = __builtin_popcount (mask1 & j);
if (asd > d[kol][mask][j]) {
d[kol][mask][j] = asd;
pr[kol][mask][j] = i;
}
}
if (asd > mx) {
mx = asd;
pos = i;
}
}
printf ("%d\n", mx);
while (pos) {
ans.push_back (pos);
pos = dr[pos];
}
reverse (ans.begin (), ans.end ());
for (auto to : ans)
printf ("%d ", to);
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... |