oj.uz

Submission #1101022

# Submission time Handle Problem Language Result Execution time Memory
1101022 2024-10-15T09:59:24 Z Kirill22 Binary Subsequences (info1cup17_binary) C++17
100 / 100
 852 ms 98156 KB 
#include "bits/stdc++.h"

using namespace std;

const int mod = (int) 1e9 + 7;
const int N = (int) 5e3;
int mem[N][N];

int get(int a, int b) {
    if (a > b) {
        swap(a, b);
    }
    if (a < 0 || b < 0) {
        return -1;
    }
    if (a == 0 && b == 0) {
        return 0;
    }
    if (a == b) {
        return -1;
    }
    if (a < N && b < N && mem[a][b]) {
        return mem[a][b];
    }
    int add = b / (a + 1);
    b %= (a + 1);
    int res = get(a, b);
    if (res == -1) {
        if (a < N && b < N) {
            mem[a][b] = -1;
        }
        return -1;
    }
    if (a < N && b < N) {
        mem[a][b] = res + add;
    }
    return res + add;
}

int phi(int x) {
    int res = x;
    for (int i = 2; i <= x; i++) {
        if (x % i == 0) {
            res -= res / i;
            while (x % i == 0) {
                x /= i;
            }
        }
    }
    return res;
}

void solve() {
    int k;
    cin >> k;
    cout << phi(k + 2) << '\n';
    k++;
    int optj = -1, prev = -1;
    for (int j = 0; j < min(k, 500000); j++) {
        int res = get(j, k - j - 1);
        if (res != -1) {
            if (optj == -1 || res < prev) {
                optj = j;
                prev = res;
            }
        }
    }
//    cout << optj << endl;
//    return;
//    cout << ans << '\n';
//    exit(0);
    {
        int a = optj, b = k - optj - 1, x = 0;
        while (a + b) {
            if (a > b) {
                x ^= 1;
                swap(a, b);
            }
            while (b >= a + 1) {
                cout << x << " ";
                b -= a + 1;
            }
        }
    }
    cout << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}

Subtask #1
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 5704 KB Output is correct

Subtask #2
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 97728 KB Output is correct
2 Correct 143 ms 98032 KB Output is correct
3 Correct 149 ms 98120 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 801 ms 98044 KB Output is correct
2 Correct 852 ms 98148 KB Output is correct
3 Correct 804 ms 98156 KB Output is correct