# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1196791 | sasde | Longest beautiful sequence (IZhO17_subsequence) | C++20 | 5483 ms | 91932 KiB |
#include<bits/stdc++.h>
#define task "strdel"
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
using namespace std;
const int N=1e6+5,lg=10,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int n,a[N],k[N],dp[1024][1024][11],back[1024][1024][11],trace[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];
int ans=0,v=0;
for(int i=1;i<=n;++i){
int phai=a[i]&((1<<lg)-1);
int trai=a[i]>>lg,cur=0,z=0;
for(int mask=0;mask<(1<<lg);++mask){
int u=phai&mask;
int K=k[i]-__builtin_popcount(u);
if(K>=0&&K<=10){
if(z<dp[trai][mask][K]){
z=dp[trai][mask][K];
cur=back[trai][mask][K];
}
}
}
if(z+1>ans){
ans=1+z;v=i;
}
trace[i]=cur;
for(int mask=0;mask<(1<<lg);++mask){
int u=trai&mask;
int K=__builtin_popcount(u);
if(dp[mask][phai][K]<z+1){
dp[mask][phai][K]=z+1;
back[mask][phai][K]=i;
}
}
}
vector<int>res;
cout << ans<<'\n';
while(v){
res.emb(v);
v=trace[v];
}
sort(res.begin(),res.end());
for(int i:res)cout <<i<<" ";
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
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... |