Submission #1275340

#	Time	Username	Problem	Language	Result	Execution time	Memory
1275340		hihihihaw	Longest beautiful sequence (IZhO17_subsequence)	C++20	23 / 100	6091 ms	1588 KiB

subsequence

#pragma GCC optimize("O3,unroll-loops")    
#include <bits/stdc++.h>
using namespace std;
 
//#define int long long
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define sz(v) (int)v.size()
#define fi first
#define se second
#define INF 1223372036854775807
#define INF2 122337203
#define MOD 1000000007
#define cint(x) int x;cin>>x;
#define cinarr(a,n) int a[n];for (int i=0;i<n;i++) cin>>a[i];
#define coutarr(a) for (auto d:a)cout<<d<<" "; cout<<endl;
#define coutarrD(a) for (auto d:a) cout<<d.fi<<","<<d.se<<" "; cout<<endl;
#define BERKAY_TUP ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
#define ld long double
#define mid (start+end)/2
#define vvi vector<vector<int>>
int t=1;
int interactive=0;
int usaco=0;
int testCase=0;

void solve(){
    int n;
    cin>>n;
    cinarr(a,n);
    cinarr(b,n);
    int dp[n];
    int ans=0;
    int c=-1;
    for (int i=0;i<n;i++){
        int mx=0;
        for (int j=0;j<i;j++){
            //cout<<__builtin_popcount(a[j]&a[i])<<endl;
            if (__builtin_popcount(a[j]&a[i])==b[i]) mx=max(mx,dp[j]);
        }
        dp[i]=mx+1;
        if (mx+1>ans){
            ans=max(ans,mx+1);
            c=i;
        }
    }
    cout<<ans<<endl;
    int z=ans;
    vector<int> an;
    an.pb(c+1);
    int prev=c;
    for (int j=c;j>=0;j--){
        if (dp[j]==z-1 && __builtin_popcount(a[j]&a[prev])==b[prev]){
            an.pb(j+1);
            z--;
            prev=j;
        }
    }
    reverse(an.begin(),an.end());
    coutarr(an);
    


    
}

 
 
 
 
 
 

 
int32_t main(){
    
    BERKAY_TUP;
    if (usaco){
        freopen("team.in", "r", stdin);
        freopen("team.out", "w", stdout);
    }
    if (!interactive){
    #ifdef Local
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        //freopen("wormsort.out", "w", stdout);
    #endif
    }
    if (t==1) solve();
    else{
        cin>>t;
        while (t--){testCase++;solve();}
    }
    
        
    return 0;
}

Compilation message (stderr)

subsequence.cpp: In function 'int32_t main()':
subsequence.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen("team.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
subsequence.cpp:82:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         freopen("team.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 16 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 60