제출 #1178351

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1178351		zyadhany	Longest beautiful sequence (IZhO17_subsequence)	C++20	7 / 100	6092 ms	8772 KiB

subsequence

#include <bits/stdc++.h>
#include <chrono>
#include <random>
#include <unordered_map>
#include <unordered_set>
 
#define ll long long
#define vi vector<ll>
#define vii vector<vi>
#define pl pair<ll, ll>
#define all(X) X.begin(),X.end()
#define vp vector<pl>
#define mi map<ll,ll>
 
#define ld long double
#define vc vector<char>
#define vcc vector<vc>
#define mc map<char,int>
#define sortx(X) sort(X.begin(),X.end());
#define allr(X) X.rbegin(),X.rend()
#define ln '\n'
#define YES {cout << "YES\n"; return;}
#define NO {cout << "NO\n"; return;}
#define MUN {cout << "-1\n"; return;}
using namespace std;

const int MODE = 998244353;


void solve(ll tc) {
    ll n; cin >> n;

    vi X(n), Y(n);

    ll b = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> X[i];
        b = max(X[i], b);
    }
    for (int i = 0; i < n; i++)
    {
        cin >> Y[i];
    }
    
    vi mask(b + 1, -1);
    vi dp(n), par(n);
    for (int i = 0; i < n; i++)
    {
        dp[i] = 1;
        par[i] = i;
        for (int j = 0; j <= b; j++)
        {
            if (__builtin_popcount(X[i]&j) == Y[i] && mask[j] != -1)  {
                if (dp[mask[j]] >= dp[i]) dp[i] = dp[mask[j]]+1, par[i]=mask[j];
            }
        }
        
        mask[X[i]] = i;
    }
    
    
    ll mx = 0, at = -1;
    for (int i = 0; i < n; i++)
    {
        if (dp[i] > mx) mx = dp[i], at = i;
    }
    vi sol;
    while (par[at] != at) sol.push_back(at), at = par[at];
    sol.push_back(at);
    reverse(all(sol));

    cout << sol.size() << '\n';
    for (auto a : sol) cout << a + 1 << ' ';
    cout << '\n';
}
 
int32_t main()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int size = 1;   

    // freopen("disrupt.in", "r", stdin   );
    // freopen("disrupt.out", "w", stdout);
    // cin >> size;
    for (int tc = 1; tc <= size; tc++){
        solve(tc);
       // if (tc != size) cout << '\n';
    }
}

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