# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37622 | Kerim | Longest beautiful sequence (IZhO17_subsequence) | C++14 | 5466 ms | 48780 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.
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("avx")
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int B=1024;
int dp[B][B][11];
int arr[MAXN],k[MAXN],bit[B],par[MAXN],res[MAXN];
int main(){
//~ freopen("file.in", "r", stdin);
for(int i=1;i<B;i++)
bit[i]=__builtin_popcount(i);
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",arr+i);
for(int i=1;i<=n;i++)
scanf("%d",k+i);
int ans=0,who;
for(int i=1;i<=n;i++){
int a=arr[i]>>10;
int b=arr[i]-a*B;
res[i]=1;
for(int j=0;j<B;j++){
int need=k[i]-bit[a&j];
if(need<0 or need>10)
continue;
if(umax(res[i],res[dp[j][b][need]]+1))
par[i]=dp[j][b][need];
}
for(int j=0;j<B;j++)
if(res[dp[a][j][bit[j&b]]]<res[i])
dp[a][j][bit[j&b]]=i;
if(umax(ans,res[i]))
who=i;
}
printf("%d\n",ans);
vector<int>vec;
while(who){
vec.pb(who);
who=par[who];
}reverse(all(vec));
tr(it,vec)
printf("%d ",*it);
puts("");
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... |