LeetCode-Solutions/C++/generate-schedule.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
// Time:  O(n^2)
// Space: O(1)

// constructive algorithms
class Solution {
public:
    vector<vector<int>> generateSchedule(int n) {
        vector<vector<int>> result;
        if (n <= 4) {
            return result;
        }
        const auto& l = 1;
        if (n % 2 == 0) {
            for (int i = 0; i < n; i += 2) {
                result.push_back({i, i + l});
            }
            for (int i = 0; i < n; i += 2) {
                result.push_back({i + l, i});
            }
            for (int i = 1; i < n; i += 2) {
                result.push_back({i, (i + l) % n});
            }
            for (int i = 1; i < n; i += 2) {
                result.push_back({(i + l) % n, i});
            }
        } else {
            for (int i = 0; i < 2 * n; i += 2) {
                result.push_back({i % n, (i + l) % n});
            }
            for (int i = 0; i < 2 * n; i += 2) {
                result.push_back({(i + l) % n, i % n});
            }
        }
        for (int l = 2; l < (n + 1) / 2; ++l) {
            int j;
            j = result.back()[0] + 1;
            for (int i = j; i < j + n; ++i) {
                result.push_back({i % n, (i + l) % n});
            }
            j = ((result.back()[1] - 1) % n + n) % n;
            for (int i = j; i < j + n; ++i) {
                result.push_back({(i + l) % n, i % n});
            }
        }
        if (n % 2 == 0) {
            const auto& l = n / 2;
            const auto& j = ((result.back()[0] - 1) % n + n) % n;
            for (int i = j; i < j + n; ++i) {
                result.push_back({i % n, (i + l) % n});
            }
        }
        return result;
    }
};