Submission #169721

#	Time	Username	Problem	Language	Result	Execution time	Memory
169721		stefdasca	Longest beautiful sequence (IZhO17_subsequence)	C++14	7 / 100	36 ms	8928 KiB

subsequence

#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9

using namespace std;

typedef long long ll;


int add(int a, int b)
{
    ll x = a+b;
    if(x >= mod)
        x -= mod;
    if(x < 0)
        x += mod;
    return x;
}
ll mul(ll a, ll b)
{
    return (a*b) % mod;
}

ll pw(ll a, ll b)
{
    ll ans = 1;
    while(b)
    {
        if(b & 1)
            ans = (ans * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ans;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand_seed()
{
    long long a = rng();
    return a;
}
int n;
int v[100002], v2[100002];
int dp[100002];
int fw[100002];
int mx[5002], mxval;
int countbit[2000002];
int lst[1050][1050];
vector<int> grp[1050];
vector<int> suff[1050];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    for(int i = 1; i < (1<<20); ++i)
        countbit[i] = __builtin_popcount(i);
    for(int i = 1; i <= n; ++i)
        cin >> v[i], mxval = max(mxval, v[i]);
    for(int i = 1; i <= n; ++i)
        cin >> v2[i];
    int anss = 0;
    if(mxval <= 5000)
    {
        for(int i = 1; i <= n; ++i)
        {
            for(int j = 0; j <= mxval; ++j)
                if(!mx[j])
                    continue;
                else
                {
                    int xx = countbit[v[i] & j];
                    if(xx == v2[i] && dp[mx[j]] + 1 > dp[i])
                    {
                        dp[i] = dp[mx[j]] + 1;
                        fw[i] = mx[j];
                    }
                }
            dp[i] = max(dp[i], 1);
            if(dp[i] > dp[mx[v[i]]])
                mx[v[i]] = i;
            if(dp[i] > dp[anss])
                anss = i;
        }
    }
    else
    {
        ll timp = 0;
        for(int i = 1; i <= n; ++i)
        {
            dp[i] = 1;
            timp += 10;
            if(countbit[v[i]] >= v2[i])
                for(int x = 0; x <= 1023; ++x)
                {
                    if(mx[x] < dp[i])
                        continue;
                    int rem = countbit[(v[i] & (x << 10))];
                    if(rem > v2[i])
                        continue;
                    ++timp;
                    if(v2[i] - rem <= 10)
                        for(int j = 0; j < grp[x].size(); ++j)
                        {
                            int val2 = grp[x][j];
                            int trueval = (x << 10) + val2;
                            if(suff[x][j] < dp[i])
                                break;
                            if(countbit[v[i] & trueval] == v2[i])
                            {
                                if(dp[lst[x][val2]] + 1 > dp[i])
                                {
                                    dp[i] = dp[lst[x][val2]] + 1;
                                    fw[i] = lst[x][val2];
                                    if(dp[i] > mx[x])
                                        break;
                                }
                            }
                            timp += 3;
                        }
                }
            if(dp[anss] == 1 && timp >= 10500000000LL)
                break;
            else
                if(dp[anss] >= 2 && timp >= 25000000000LL)
                    break;
            int val = (v[i] >> 10);
            int val2 = (v[i] & 1023);
            if(lst[val][val2] == 0)
            {
                grp[val].pb(val2), suff[val].pb(0);
                for(int j = suff[val].size() - 1; j >= 0; --j)
                {
                    if(dp[i] > suff[val][j])
                        suff[val][j] = dp[i];
                    else
                        break;
                }
            }
            lst[val][val2] = i;
            if(dp[i] > dp[anss])
                anss = i;
            mx[val] = max(mx[val], dp[i]);
        }
    }
    cout << dp[anss] << '\n';
    deque<int> ans;
    while(anss)
    {
        ans.push_front(anss);
        anss = fw[anss];
    }
    for(int i = 0; i < ans.size(); ++i)
        cout << ans[i] << " ";
    return 0;
}

Compilation message (stderr)

subsequence.cpp: In function 'int main()':
subsequence.cpp:110:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for(int j = 0; j < grp[x].size(); ++j)
                                        ~~^~~~~~~~~~~~~~~
subsequence.cpp:160:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < ans.size(); ++i)
                    ~~^~~~~~~~~~~~

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