#define taskname ""
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int kN = 100005;
const int kB = 10;
struct T {
int i, j, k;
T(int _i = -1, int _j = -1, int _k = -1) : i(_i) , j(_j), k(_k) {}
};
int n, a[kN], k[kN], d[kN], trace[kN];
vector<vector<vector<pair<int, int>>>> dp((1 << kB) + 1, vector<vector<pair<int, int>>>((1 << kB) + 1, vector<pair<int, int>>(kB + 1, make_pair(0, -1))));
int main() {
if (fopen(taskname".inp", "r")) {
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
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++) {
int l = a[i] >> kB, r = a[i] % (1 << kB);
for (int j = 0; j < (1 << kB); j++) {
if (dp[j][r][k[i] - __builtin_popcount(j & l)].first + 1 > d[i]) {
d[i] = dp[j][r][k[i] - __builtin_popcount(j & l)].first + 1;
trace[i] = dp[j][r][k[i] - __builtin_popcount(j & l)].second;
}
}
for (int j = 0; j < (1 << kB); j++) {
if (d[i] > dp[l][j][__builtin_popcount(r & j)].first) {
dp[l][j][__builtin_popcount(r & j)] = make_pair(d[i], i);
}
}
}
int ind = -1, len = 0;
for (int i = 1; i <= n; i++) {
if (d[i] > len) {
len = d[i];
ind = i;
}
}
cout << len << '\n';
vector<int> p;
for (int i = ind; i != -1; i = trace[i]) {
p.push_back(i);
}
reverse(p.begin(), p.end());
for (int x : p) {
cout << x << ' ';
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
subsequence.cpp: In function 'int main()':
subsequence.cpp:20:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
20 | freopen(taskname".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
subsequence.cpp:21:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
21 | freopen(taskname".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# | 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... |