oj.uz

답안 #917238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
917238 2024-01-27T14:00:25 Z Vladth11 Binary Subsequences (info1cup17_binary) C++14
82 / 100
 152 ms 10064 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 25;
const int K = 100000;
 
int a;
int sol[K + 5];
int solLength[K + 5];
int dp0,dp1,sumdp;
 
 
void afis(int M)
{
    if (solLength[sumdp] == 0 or M < solLength[sumdp])
    {
        solLength[sumdp] = M;
        sol[sumdp] = a;
    }
}
 
void bkt(int pos,int pz,int sumant)
{
    if (sumdp > K)
        return;
    if (pos != 1){
        if(solLength[sumdp] != 0 && solLength[sumdp] + 3 < pz){
            return;
        }
        afis(pz - 1);
    }
    if (pz == N + 1)
        return;
    else
    {
        if (pos & 1)
        {
            if (pos == 1)
            {
                dp0 = 1;
                dp1 = 1;
                for (int lung = 1; lung <= N; lung++)
                {
                    a &= ~(1 << (pz + lung - 1));
                    sumdp = lung;
                    bkt(pos + 1,lung + 1,lung);
                }
            }
            else
            {
                dp0 += sumant;
                for (int lung = 1; lung <= N - pz + 1; lung++)
                {
                    a &= ~(1 << (pz + lung - 1));
                    sumdp += dp0 * lung;
                    bkt(pos + 1,pz + lung,dp0 * lung);
                    sumdp -= dp0 * lung;
                }
                dp0 -= sumant;
            }
        }
        else
        {
            dp1 += sumant;
            for (int lung = 1; lung <= N - pz + 1; lung++)
            {
                a |= 1 << (pz + lung - 1);
                sumdp += dp1 * lung;
                bkt(pos + 1,pz + lung,dp1 * lung);
                sumdp -= dp1 * lung;
            }
            dp1 -= sumant;
        }
    }
}
 
int phi[1000005];
const int NMAX = 1e6 + 2;
 
void prec_phi()
{
    for (int i = 1; i <= NMAX; i++)
        phi[i] = i;
    for (int i = 2; i <= NMAX; i++)
        if (phi[i] == i)
            for (int j = i; j <= NMAX; j += i)
                phi[j] = (phi[j] / i) * (i - 1);
}
 
 
signed main()
{
    //for (int i = 1; i <= N; i++)
      //  found[i] = true;
    bkt(1,1,0);
    //for (int i = 1; i <= 50; i++)
      //  cout << sol[i].size() << endl;
    //bktsus(1,1,0);
    prec_phi();
    /*for (int i = 1; i <= K; i++)
        if (!found[i])
            cout << i << endl;*/
    //for (int i = 1; i <= N; i++)
      //  cout << i << ' ' << cnt[i] << ' ' << cnt2[i] << endl;
    int tc;
    cin >> tc;
    while (tc--)
    {
        int kk;
        cin >> kk;
        cout << phi[kk + 2] << '\n';
        for (int i = 1; i <= solLength[kk]; i++)
        {
            if (sol[kk] & (1 << i))
                cout << 1 << ' ';
            else
                cout << 0 << ' ';
        }
        cout << '\n';
    }
    return 0;
}

Subtask #1
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 5036 KB Output is correct

Subtask #2
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 5200 KB Output is correct
2 Correct 151 ms 5200 KB Output is correct
3 Correct 135 ms 4948 KB Output is correct

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 145 ms 10064 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -