# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673254 | Baytoro | Longest beautiful sequence (IZhO17_subsequence) | C++17 | 3738 ms | 95168 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;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e18,mod=998244353;
int n;
const int N=1e5+5;
int cnt(int x){
return __builtin_popcount(x);
}
int dp[N],ar[1024][1024][11];
int a[N],k[N],p[N];
void solve(){
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]>>10);
int r=(a[i]&((1<<10)-1));
int ans=0;
for(int j=0;j<(1<<10);j++){
int tmp=k[i]-cnt(j&r);
if(tmp<0 || tmp>10) continue;
if(dp[ans]<dp[ar[l][j][tmp]])
ans=ar[l][j][tmp];
}
dp[i]=dp[ans]+1;
p[i]=ans;
for(int j=0;j<1024;j++){
int tmp=cnt(j&l);
if(dp[i]>dp[ar[j][r][tmp]])
ar[j][r][tmp]=i;
}
}
int res=1;
for(int i=1;i<=n;i++){
if(dp[i]>dp[res]) res=i;
}
vector<int> ans;
while(res!=0){
ans.pb(res);
res=p[res];
}
cout<<ans.size()<<endl;
reverse(all(ans));
for(auto it: ans)
cout<<it<<' ';
}
main(){
//fopn("newbarn");
ios;
int T=1;
//cin>>T;
while(T--){
solve();
}
}
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... |