Submission #516661

#	Time	Username	Problem	Language	Result	Execution time	Memory
516661		Dasha_Gnedko	Longest beautiful sequence (IZhO17_subsequence)	C++17	100 / 100	2582 ms	47312 KiB

subsequence

#include <bits/stdc++.h>

//#include <ext/pb_ds/detail/standard_policies.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

using namespace std;

//using namespace __gnu_pbds;
//template <typename T> using ordered_set = tree <T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update>;

mt19937 gen(time(0));

#define ll long long
#define ld long double
#define pb push_back
#define F first
#define S second
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define sz(a) int32_t(a.size())
#define endl '\n'
//#define int long long

const int N = 1e5 + 100;
const int M = 31;
const int mod = 998244353;
const int inf = 1e9 + 7;

int a[N], b[N], dp[N], pr[N], bit[1030];
int c[1025][11][1025];

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
//    freopen("subsequence.in", "r", stdin);
//    freopen("subsequence.out", "w", stdout);
#endif // LOCAL

    for(int i = 0; i < 1024; i++)
        bit[i] = __builtin_popcount(i);
    for(int i = 0; i < 1024; i++)
        for(int cnt = 0; cnt < 11; cnt++)
            for(int j = 0; j < 1024; j++)
                c[i][cnt][j] = -1;
    int n;
    cin >> n;
    for(int i = 0; i < n; i++)
        cin >> a[i];
    for(int i = 0; i < n; i++)
        cin >> b[i];
    for(int i = 0; i < n; i++)
    {
        dp[i] = 1;
        pr[i] = -1;
        int x = 0, y = 0;
        for(int j = 10; j < 20; j++)
            if (a[i] & (1 << j)) x += (1 << (j - 10));
        for(int j = 0; j < 10; j++)
            if (a[i] & (1 << j)) y += (1 << j);
        for(int mask = 0; mask < 1024; mask++)
        {
            int cnt = bit[(mask & y)];
            int need = b[i] - cnt;
            if (need < 0 || need > 10) continue;
            int j = c[x][need][mask];
            if (j != -1 && dp[j] + 1 > dp[i])
            {
                dp[i] = dp[j] + 1;
                pr[i] = j;
            }
        }
        for(int mask = 0; mask < 1024; mask++)
        {
            int cnt = bit[(mask & x)];
            int j = c[mask][cnt][y];
            if (j == -1 || dp[i] > dp[j]) c[mask][cnt][y] = i;
        }
    }
    int i = 0;
    for(int j = 1; j < n; j++)
        if (dp[j] > dp[i]) i = j;
    vector < int > ans;
    while (i >= 0)
    {
        ans.pb(i);
        i = pr[i];
    }
    reverse(ans.begin(), ans.end());
    cout << sz(ans) << endl;
    for(auto to: ans)
        cout << to + 1 << " ";
}

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