Submission #333572

#	Time	Username	Problem	Language	Result	Execution time	Memory
333572		talant117408	Longest beautiful sequence (IZhO17_subsequence)	C++17	23 / 100	6087 ms	2540 KiB

subsequence

/*
    Code written by Talant I.D.
*/
  
#include <bits/stdc++.h>
  
using namespace std;
  
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int main(){
    do_not_disturb
    
    //freopen("subsequence.in", "r", stdin);
    //freopen("subsequence.out", "w", stdout);
    
    int n;
    cin >> n;
    vector <int> v(n), k(n);
    for(auto &to : v) cin >> to;
    for(auto &to : k) cin >> to;
    
    int i, j;
    vector <int> dp(n, 1), par(n, -1);
    
    for(i = 1; i < n; i++){
        for(j = i-1; j >= 0; j--){
            if(__builtin_popcount(v[i]&v[j]) == k[i]){
                if(dp[j]+1 > dp[i]){
                    dp[i] = dp[j]+1;
                    par[i] = j;
                }
            }
        }
    }
    
    int mx = 0, ind = n-1;
    for(i = 0; i < n; i++){
        if(mx < dp[i]){
            mx = dp[i];
            ind = i;
        }
    }
    
    vector <int> ans;
    int p = ind;
    while(p != -1){
        ans.pb(p);
        p = par[p];
    }
    sort(all(ans));
    cout << sz(ans) << endl;
    for(auto to : ans) cout << to+1 << ' ';
    
    return 0;
}

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