QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#413549#6742. LeavesHHY_zZhu#TL 1ms3968kbC++203.5kb2024-05-17 18:24:422024-05-17 18:24:42

Judging History

你现在查看的是最新测评结果

  • [2024-05-17 18:24:42]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:3968kb
  • [2024-05-17 18:24:42]
  • 提交

answer

#include <bits/stdc++.h>

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, m;
    std::cin >> n >> m;

    std::vector<int> a(n);
    std::vector<std::pair<int, int>> son(n);
    std::vector<uint8_t> has_father(n);
    for (int i = 0; i < n; ++i) {
        int tp;
        std::cin >> tp;
        if (tp == 1) {
            int l, r;
            std::cin >> l >> r;
            --l, --r;
            son[i] = {l, r};
            has_father[l] = has_father[r] = true;
        } else {
            std::cin >> a[i];
        }
    }
    int rt = 0;
    while (has_father[rt]) {
        ++rt;
    }

    auto concatenate = [](std::vector<int> a, std::vector<int> b) {
        a.insert(a.end(), b.begin(), b.end());
        return a;
    };

    struct Node {
        std::vector<int> arr;
        int m;
        bool f;
    };
    std::vector<Node> dp(n);
    std::vector<std::vector<int>> origin(n);
    auto dfs0 = [&](auto self, int node) -> void {
        if (son[node].first == son[node].second) {
            dp[node].arr = std::vector<int>{a[node]};
            dp[node].m = 0;
            dp[node].f = false;

            origin[node] = std::vector<int>{a[node]};
            return;
        }
        auto [l, r] = son[node];
        self(self, l);
        self(self, r);

        origin[node] = concatenate(origin[l], origin[r]);

        std::vector<int> l_first = concatenate(dp[l].arr, dp[r].arr);
        std::vector<int> r_first = concatenate(dp[r].arr, dp[l].arr);

        if (l_first == r_first) {
            dp[node].arr = std::move(l_first);
            dp[node].m = dp[l].m + dp[r].m;
            dp[node].f = true;
        } else if (l_first < r_first) {
            dp[node].arr = std::move(l_first);
            dp[node].m = dp[l].m + dp[r].m;
            dp[node].f = false;
        } else {
            dp[node].arr = std::move(r_first);
            dp[node].m = dp[l].m + dp[r].m + 1;
            dp[node].f = false;
        }
    };
    dfs0(dfs0, rt);
    
    auto solve = [&](auto self, int node, int m, bool f) -> std::vector<int> {
        if (son[node].first == son[node].second) {
            if (m % 2 == 0 || f) {
                return std::vector<int>{a[node]};
            } else {
                return std::vector<int>{-1};
            }
        }
        
        auto [l, r] = son[node];
        std::vector<int> ans;
        
        // Not change
        {
            std::vector<int> res;
            if (m <= dp[l].m) {
                res = concatenate(self(self, l, m, f), origin[r]);
            } else {
                res = concatenate(dp[l].arr, self(self, r, m - dp[l].m, f || dp[l].f));
            }

            if (std::find(res.begin(), res.end(), -1) == res.end() && (ans.empty() || res < ans)) {
                ans = res;
            }
        }

        // Change
        {
            m -= 1;
            std::vector<int> res;
            if (m <= dp[r].m) {
                res = concatenate(self(self, r, m, f), origin[l]);
            } else {
                res = concatenate(dp[r].arr, self(self, l, m - dp[r].m, f || dp[r].f));
            }

            if (std::find(res.begin(), res.end(), -1) == res.end() && (ans.empty() || res < ans)) {
                ans = res;
            }
        }

        assert(!ans.empty());

        return ans;
    };

    auto ans = solve(solve, rt, m, false);
    for (int i : ans) {
        std::cout << i << ' ';
    }
    
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3468kb

input:

3 0
1 2 3
2 1
2 2

output:

1 2 

result:

ok 2 number(s): "1 2"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3800kb

input:

7 1
1 2 3
1 4 5
1 6 7
2 4
2 2
2 3
2 1

output:

2 4 3 1 

result:

ok 4 number(s): "2 4 3 1"

Test #3:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

7 2
1 2 3
1 4 5
1 6 7
2 4
2 2
2 3
2 1

output:

1 3 4 2 

result:

ok 4 number(s): "1 3 4 2"

Test #4:

score: 0
Accepted
time: 0ms
memory: 3796kb

input:

1 0
2 1000000000

output:

1000000000 

result:

ok 1 number(s): "1000000000"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

3 1
1 2 3
2 1
2 2

output:

2 1 

result:

ok 2 number(s): "2 1"

Test #6:

score: 0
Accepted
time: 0ms
memory: 3744kb

input:

7 2
1 2 3
1 4 5
1 6 7
2 1
2 2
2 3
2 4

output:

1 2 3 4 

result:

ok 4 number(s): "1 2 3 4"

Test #7:

score: 0
Accepted
time: 1ms
memory: 3968kb

input:

999 480
1 3 2
1 4 5
1 6 7
1 9 8
1 10 11
1 13 12
1 14 15
1 16 17
1 19 18
1 21 20
1 23 22
1 25 24
1 27 26
1 28 29
1 30 31
1 33 32
1 35 34
1 37 36
1 38 39
1 41 40
1 42 43
1 45 44
1 46 47
1 48 49
1 51 50
1 52 53
1 55 54
1 56 57
1 58 59
1 61 60
1 62 63
1 64 65
1 67 66
1 69 68
1 71 70
1 73 72
1 74 75
1 76...

output:

34826804 763875883 763875883 763875883 763875883 763875883 763875883 763875883 248820103 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 763875883 7...

result:

ok 500 numbers

Test #8:

score: 0
Accepted
time: 1ms
memory: 3756kb

input:

999 480
1 2 3
1 4 5
1 7 6
1 8 9
1 10 11
1 13 12
1 15 14
1 17 16
1 19 18
1 21 20
1 23 22
1 24 25
1 26 27
1 28 29
1 31 30
1 32 33
1 34 35
1 37 36
1 38 39
1 41 40
1 42 43
1 44 45
1 46 47
1 48 49
1 51 50
1 52 53
1 54 55
1 57 56
1 58 59
1 60 61
1 62 63
1 65 64
1 66 67
1 69 68
1 71 70
1 72 73
1 75 74
1 77...

output:

530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 530024839 ...

result:

ok 500 numbers

Test #9:

score: 0
Accepted
time: 0ms
memory: 3912kb

input:

999 480
1 3 2
1 5 4
1 7 6
1 8 9
1 10 11
1 13 12
1 15 14
1 17 16
1 18 19
1 21 20
1 23 22
1 25 24
1 26 27
1 29 28
1 31 30
1 33 32
1 34 35
1 37 36
1 38 39
1 41 40
1 43 42
1 45 44
1 47 46
1 49 48
1 50 51
1 52 53
1 54 55
1 56 57
1 59 58
1 60 61
1 62 63
1 65 64
1 67 66
1 69 68
1 71 70
1 73 72
1 74 75
1 76...

output:

507922 928353918 51892154 809031414 296508656 801553730 385852006 930053625 95913518 431154803 117002192 187199343 405980569 664093190 478863675 930428963 3440725 490128679 92302056 563992614 27927487 246777697 168388113 922508131 52386784 780998040 438167217 876407248 158186938 633166175 788275543 ...

result:

ok 500 numbers

Test #10:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

999 480
1 3 2
1 4 5
1 7 6
1 8 9
1 10 11
1 13 12
1 15 14
1 16 17
1 19 18
1 21 20
1 23 22
1 24 25
1 26 27
1 29 28
1 30 31
1 32 33
1 35 34
1 37 36
1 38 39
1 41 40
1 43 42
1 45 44
1 46 47
1 48 49
1 50 51
1 52 53
1 54 55
1 56 57
1 58 59
1 60 61
1 63 62
1 65 64
1 66 67
1 68 69
1 70 71
1 72 73
1 74 75
1 76...

output:

666292 26210483 65023030 95745223 11431606 30237589 40996997 59830702 14512182 24640163 39361368 85684143 17020177 58437715 74457645 91998540 7557034 46923480 16066480 33921131 14512182 83949838 22501176 83949838 15127734 18414338 52979072 81930757 24640163 70913581 72929459 78973167 3687875 4610266...

result:

ok 500 numbers

Test #11:

score: 0
Accepted
time: 1ms
memory: 3688kb

input:

999 480
1 3 2
1 4 5
1 7 6
1 9 8
1 10 11
1 13 12
1 15 14
1 16 17
1 18 19
1 20 21
1 23 22
1 24 25
1 27 26
1 29 28
1 30 31
1 33 32
1 34 35
1 37 36
1 39 38
1 40 41
1 42 43
1 44 45
1 47 46
1 48 49
1 50 51
1 52 53
1 55 54
1 56 57
1 59 58
1 60 61
1 62 63
1 64 65
1 66 67
1 68 69
1 70 71
1 72 73
1 75 74
1 77...

output:

874376 19021636 10912872 49114704 21454471 94310772 60086613 88323254 20181141 62658098 54568372 64872279 21454471 30659919 73483837 98385133 12300384 74080822 54568372 100102768 29770805 62658098 33159023 62908008 33159023 98943188 52580720 64872279 58787422 98644936 73687255 98385133 10912872 9838...

result:

ok 500 numbers

Test #12:

score: -100
Time Limit Exceeded

input:

905 52
1 3 2
2 25780328
1 4 5
2 84996992
1 6 7
2 43060692
1 8 9
2 58356233
1 11 10
2 48172306
1 12 13
2 94654986
1 14 15
2 66085196
1 17 16
2 43141873
1 18 19
2 58356233
1 21 20
2 58356233
1 22 23
2 64124892
1 24 25
2 55464563
1 27 26
2 46324683
1 29 28
2 78919648
1 30 31
2 13379324
1 32 33
2 960564...

output:


result: