Submission #541087

#	Time	Username	Problem	Language	Result	Execution time	Memory
541087		Bunny_man	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	0 ms	212 KiB

subsequence

#include <bits/stdc++.h>

#define ll long long int
#define pb push_back
#define ui unsigned int
#define ld long double
#define buster ios_base::sync_with_stdio(NULL);cin.tie(0);cout.tie(0);

using namespace std;

vector<ll> ans;

ll bitcount(ll x, ll y)
{
    ll k = (x & y);
    ll cnt = 0;

    for(ll i = 0; i < 15; i++)
    {
        if(k < (1 << i))
        {
            break;
        }
        if(k & (1 << i))
        {
            cnt++;
        }
    }
    return cnt;
}

int main()
{

    buster;

    ll tt = 1;

    //cin >> tt;

    while(tt--)
    {
        ll n;

        cin >> n;

        vector<ll> v;

        ll a[n + 1];
        ll b[n + 1];

        for(ll i = 1; i <= n; i++)
        {
            cin >> a[ i ];
        }
        for(ll i = 1; i <= n; i++)
        {
            cin >> b[ i ];
        }
        for(ll i = 1; i <= n - 1; i++)
        {
            v.pb( i );
            for(ll j = 1; j <= n; j++)
            {
                if(bitcount(a[ i ], a[ j ]) == b[ j ])
                {
                    v.pb( j );
                }
            }
            if(v.size() > ans.size())
            {
                ans = v;
            }
            v.clear();
        }
        cout << ans.size() << "\n";
        for(auto it : ans)
        {
            cout << it << ' ';
        }
    }   
}

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