Submission #333983

#TimeUsernameProblemLanguageResultExecution timeMemory
333983KerimLongest beautiful sequence (IZhO17_subsequence)C++17
0 / 100
1 ms492 KiB
#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 N=256; PII dp[N]; int a[MAXN],k[MAXN],bit[N],par[MAXN]; int main(){ for(int i=0;i<N;i++) bit[i]=__builtin_popcount(i); //freopen("file.in", "r", stdin); int n; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",a+i); for(int i=1;i<=n;i++) scanf("%d",k+i); int ans=0,who,change; vector<int>res; for(int i=1;i<=n;i++){change=0; for(int j=0;j<N;j++){ if(bit[j&a[i]]==k[i]) if(umax(dp[a[i]].ff,dp[j].ff+1)){ change=1; par[i]=dp[j].ss; } } if(!dp[a[i]].ff) dp[a[i]]=mp(1,i); else if(change) dp[a[i]].ss=i; if(umax(ans,dp[a[i]].ff)) who=i; } while(who){ res.pb(who); who=par[who]; }reverse(all(res)); printf("%d\n",ans); tr(it,res) printf("%d ",*it); puts(""); return 0; }

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
subsequence.cpp:30:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |      scanf("%d",a+i);
      |      ~~~~~^~~~~~~~~~
subsequence.cpp:32:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   32 |      scanf("%d",k+i);
      |      ~~~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...