Submission #340041

#	Time	Username	Problem	Language	Result	Execution time	Memory
340041		Sprdalo	Longest beautiful sequence (IZhO17_subsequence)	C++17	23 / 100	6071 ms	4096 KiB

subsequence

#include <bits/stdc++.h>

using namespace std;

#define int ll
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pi> vp;
typedef vector<pl> vpl;

signed main()
{
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr); 
    cout.tie(nullptr); 
    cerr.tie(nullptr);    

    int n;
    cin >> n;

    vi a(n);
    for (auto& i : a)
        cin >> i;

    vi k(n);
    for (auto& i : k)
        cin >> i;

    vi d(n), last(n, -1);
    for (int i = 0; i < n; ++i){
        d[i] = 1;

        for (int j = 0; j < i; ++j){
            if (d[j]+1 > d[i] && __builtin_popcount(a[i]&a[j]) == k[i]){
                d[i] = d[j]+1;
                last[i] = j;
            }   
        }
    }

    int ind = max_element(d.begin(), d.end()) - d.begin();
    cout << d[ind] << '\n';

    vi sol;
    while(ind != -1){
        sol.push_back(ind+1);
        ind = last[ind];
    }

    reverse(sol.begin(), sol.end());

    for (auto& i : sol)
        cout << i << ' ';
    cout << '\n';
}

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