LeetCode-Solutions/C++/balanced-k-factor-decomposition.cpp at master · kamyu104/LeetCode-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
// Time:  precompute: O(rlogr)
//        runtime:    O(k * (logn)^(k - 1))
// Space: O(rlogr)

// backtracking, number theory
const auto& factors = [](int n) {
    vector<vector<int>> result(n + 1);
    for (int i = 1; i <= n; ++i) {
        for (int j = i; j <= n; j += i) {
            result[j].emplace_back(i);
        }
    }
    return result;
};

const int MAX_N = 1e5;
const auto& FACTORS = factors(MAX_N);
class Solution {
public:
    vector<int> minDifference(int n, int k) {
        vector<int> result, curr;
        function<void (int)> backtracking = [&](int remain) {
            const int start = !empty(curr) ? curr.back() : 1;
            if (size(curr) == k - 1) {
                if (remain >= start) {
                    curr.emplace_back(remain);
                    if (empty(result) || result.back() - result[0] > curr.back() - curr[0]) {
                        result = curr;
                    }
                    curr.pop_back();
                }
                return;
            }
            const auto& factors = FACTORS[remain];
            for (auto it = lower_bound(cbegin(factors), cend(factors), start); it != cend(factors); ++it) {
                curr.emplace_back(*it);
                backtracking(remain / *it);
                curr.pop_back();
            }
        };

        backtracking(n);
        return result;
    }
};

// Time:  O(k * (n^(1/2) * n^(1/4) * n^(1/8) * n^(1/6) + n^(1/2) * n^(1/4) * n^(1/8) + n^(1/2) * n^(1/4) + n^(1/2))) <= O(k^2 * n)
// Space: O(k)
// backtracking, number theory
class Solution2 {
public:
    vector<int> minDifference(int n, int k) {
        vector<int> result, curr;
        function<void (int)> backtracking = [&](int remain) {
            const int start = !empty(curr) ? curr.back() : 1;
            if (size(curr) == k - 1) {
                if (remain >= start) {
                    curr.emplace_back(remain);
                    if (empty(result) || result.back() - result[0] > curr.back() - curr[0]) {
                        result = curr;
                    }
                    curr.pop_back();
                }
                return;
            }
            for (int i = 1; i * i <= remain; ++i) {
                if (remain % i) {
                    continue;
                }
                const int j = remain / i;
                if (i >= start) {
                    curr.emplace_back(i);
                    backtracking(j);
                    curr.pop_back();
                }
                if (j == i) {
                    continue;
                }
                if (j >= start) {
                    curr.emplace_back(j);
                    backtracking(i);
                    curr.pop_back();
                }
            }
        };

        backtracking(n);
        return result;
    }
};

// Time:  O(2^(k-1) * k * n)
// Space: O(k)
// backtracking, number theory
class Solution3 {
public:
    vector<int> minDifference(int n, int k) {
        vector<int> result, curr;
        function<void (int)> backtracking = [&](int remain) {
            if (size(curr) == k - 1) {
                curr.emplace_back(remain);
                if (empty(result) || ranges::max(result) - ranges::min(result) > ranges::max(curr) - ranges::min(curr)) {
                    result = curr;
                }
                curr.pop_back();
                return;
            }
            for (int i = 1; i * i <= remain; ++i) {
                if (remain % i) {
                    continue;
                }
                const int j = remain / i;
                curr.emplace_back(i);
                backtracking(j);
                curr.pop_back();
                if (j == i) {
                    continue;
                }
                curr.emplace_back(j);
                backtracking(i);
                curr.pop_back();
            }
        };

        backtracking(n);
        return result;
    }
};