Submission #916754

#	Time	Username	Problem	Language	Result	Execution time	Memory
916754		andrei_iorgulescu	Binary Subsequences (info1cup17_binary)	C++14	30.10 / 100	120 ms	2684 KiB

binary

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 20;
const int K = 2000;

int cnt[10 * K + 5];
bool found[10 * K + 5];
int a[N + 5];
vector<int>sol[10 * K + 5];
int dp[N + 5];

void afis(int M)
{
    int sumdp = 1,d0 = 0,d1 = 0;
    int p;
    for (p = 2; p <= M; p++)
    {
        if (a[p] != a[p - 1])
            break;
    }
    if (p == M + 1)
    {
        if (sol[p - 1].size() == 0 or M < sol[p - 1].size())
        {
            sol[p - 1].clear();
            for (int i = 1; i <= M; i++)
                sol[p - 1].push_back(a[i]);
        }
        return;
    }
    for (int i = 1; i < p; i++)
        dp[i] = 1;
    dp[p] = p;
    if (a[1] == 1)
        d1 = 1,d0 = p,sumdp = 2 * p - 1;
    else
        d1 = p,d0 = 1,sumdp = 2 * p - 1;
    for (int i = p + 1; i <= M; i++)
    {
        if (a[i] == 1)
        {
            int j = i - 1;
            while (j > 0 and a[j] == 0)
                d1 += dp[j],j--;
            dp[i] = d1;
        }
        else
        {
            int j = i - 1;
            while (j > 0 and a[j] == 1)
                d0 += dp[j],j--;
            dp[i] = d0;
        }
        if (a[i] == 0)
            sumdp += d0;
        else
            sumdp += d1;
        if (sumdp > K)
            return;
        found[sumdp] = true;
    }
    found[sumdp] = true;
    if (sol[sumdp].size() == 0 or M < sol[sumdp].size())
    {
        sol[sumdp].clear();
        for (int i = 1; i <= M; i++)
            sol[sumdp].push_back(a[i]);
    }
}

void bkt(int pos)
{
    if (pos != 1)
        afis(pos - 1);
    if (pos == N + 1)
        return;
    else
    {
        a[pos] = 0;
        bkt(pos + 1);
        a[pos] = 1;
        bkt(pos + 1);
    }
}

int sdp,dp0,dp1;

void bktsus(int pos)
{
    if (sdp > K)
        return;
    cnt[sdp]++;
    if (pos == 1)
    {
        for (int len = 1; len <= K; len++)
        {
            sdp = len;
            dp0 = 1;
            dp1 = 0;
            bktsus(pos + 1);
        }
    }
    else
    {
        if (pos % 2 == 1)
        {
            for (int len = 1; sdp <= K; len++)
            {
                dp0 += dp1;
                sdp += dp0;
                bktsus(pos + 1);
            }
        }
        else
        {
            for (int len = 1; sdp <= K; len++)
            {
                if (dp1 == 0)
                {
                    dp1 = sdp + 1;
                    sdp += sdp + 1;
                    bktsus(pos + 1);
                }
                else
                {
                    dp1 += dp0;
                    sdp += dp1;
                    bktsus(pos + 1);
                }
            }
        }
    }
}

signed main()
{
    for (int i = 1; i <= N; i++)
        found[i] = true;
    bkt(1);
    //bktsus(1);
    for (int i = 1; i <= K; i++)
        cnt[i] = 2 * cnt[i];
    /*for (int i = 1; i <= K; i++)
        if (!found[i])
            cout << i << endl;*/
    int tc;
    cin >> tc;
    while (tc--)
    {
        int kk;
        cin >> kk;
        cout << -1 << '\n';
        for (auto it : sol[kk])
            cout << it << ' ';
        cout << '\n';
    }
    return 0;
}

Compilation message (stderr)

binary.cpp: In function 'void afis(long long int)':
binary.cpp:27:41: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         if (sol[p - 1].size() == 0 or M < sol[p - 1].size())
      |                                       ~~^~~~~~~~~~~~~~~~~~~
binary.cpp:67:37: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     if (sol[sumdp].size() == 0 or M < sol[sumdp].size())
      |                                   ~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 30.1 / 43
• Subtask 2: 0 / 39
• Subtask 3: 0 / 18