# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89354 | Bodo171 | Longest beautiful sequence (IZhO17_subsequence) | C++14 | 6 ms | 4600 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 <iostream>
#include <fstream>
using namespace std;
const int nmax=(1<<17);
const int valmax=(1<<20)+1;
const int lim=(1<<10);
int dp[valmax][21][11];
int v[nmax],k[nmax],best[nmax];
int pc[(1<<20)];
int n,i,j,ans;
void ins(int x,int val)
{
for(int i=0;i<lim;i++)
dp[(x^i)][pc[x]][pc[i]]=max(dp[(x^i)][pc[x]][pc[i]],val);
}
int gt(int x,int b,int btot)
{
int ret=0;
for(int i=0;i<lim;i++)
for(j=0;j<20;j++)
if(btot+j-pc[i]==b)
ret=max(ret,dp[(x^(i<<10))][j][-b+btot+j-pc[i]]);
return ret;
}
int main()
{
freopen("data.in","r",stdin);
cin>>n;
for(i=1;i<(1<<20);i++)
pc[i]=pc[(i&(i-1))]+1;
for(i=1;i<=n;i++)
{
cin>>v[i];
}
for(i=1;i<=n;i++)
{
cin>>k[i];
}
for(int cnt=1;cnt<=n;cnt++)
{
best[cnt]=gt(v[cnt],k[cnt],pc[v[cnt]])+1;
ins(v[cnt],best[cnt]);
ans=max(ans,best[cnt]);
}
cout<<ans;
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... |