# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1269057 | nathan4690 | Longest beautiful sequence (IZhO17_subsequence) | C++20 | 3472 ms | 174472 KiB |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f1(i,n) for(int i=1;i<=n;i++)
#define __file_name ""
using namespace std;
const ll maxn=1e6+5, inf=1e18;
int n, a[maxn], k[maxn];
pair<int,int> dp[1 << 10][1 << 10][21];
int trace[maxn], rdp[maxn];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if(fopen(__file_name ".inp", "r")){
freopen(__file_name ".inp", "r", stdin);
freopen(__file_name ".out", "w", stdout);
}
// code here
cin >> n;
f1(i,n) cin >> a[i];
f1(i,n) cin >> k[i];
f1(i,n){
rdp[i] = 1;
int m1 = a[i] >> 10, m2 = a[i] & ((1 << 10) - 1);
for(int mask = 0; mask < (1 << 10); mask++){
int cnt = __builtin_popcount(mask & m2);
if(cnt <= k[i]){
if(rdp[i] < dp[m1][mask][k[i] - cnt].first + 1){
rdp[i] = dp[m1][mask][k[i] - cnt].first + 1;
trace[i] = dp[m1][mask][k[i] - cnt].second;
}
}
}
for(int mask = 0; mask < (1 << 10); mask++){
int cnt = __builtin_popcount(mask & m1);
if(dp[mask][m2][cnt].first < rdp[i]){
dp[mask][m2][cnt].first = rdp[i];
dp[mask][m2][cnt].second = i;
}
}
}
int valdp = 0, idx = 0;
f1(i,n){
if(valdp < rdp[i]){
valdp = rdp[i];
idx = i;
}
}
vector<int> ans;
while(idx > 0){
ans.push_back(idx);
idx = trace[idx];
}
reverse(ans.begin(), ans.end());
cout << ans.size() << '\n';
for(int i: ans) cout << i << ' ';
return 0;
}
컴파일 시 표준 에러 (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... |