oj.uz

Submission #949062

# Submission time Handle Problem Language Result Execution time Memory
949062 2024-03-18T22:09:35 Z y_combinator Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 778 ms 413520 KB 
#include <algorithm>
#include <array>
#include <cmath>
#include <ios>
#include <iostream>
#include <vector>

using Town = std::array<int, 2>;

auto solve() {

    auto m = 0;
    auto n = 0;
    auto q = 0;

    std::cin >> n >> m >> q;

    auto adj = std::vector<std::vector<int>>(n);

    for (auto i = 0; i < m; ++i) {
        auto e = 0;
        auto s = 0;
        std::cin >> s >> e;
        --s;
        --e;
        adj[e].push_back(s);
    }

    auto in_c = std::vector<bool>(n);
    auto mx_lens = std::vector<int>(n);
    auto lens = std::vector<std::vector<Town>>(n);
    auto root = static_cast<int>(std::sqrt(n)) + 1;

    while (root * root > n) {
        --root;
    }

    for (auto i = 0; i < n; ++i) {
        auto towns = std::vector<int>();
        for (auto x : adj[i]) {
            for (const auto& [town, len] : lens[x]) {
                if (mx_lens[town] == 0) {
                    towns.push_back(town);
                }
                mx_lens[town] = std::max(mx_lens[town], len + 1);
            }
        }
        if (static_cast<int>(std::size(towns)) >= root) {
            std::nth_element(
                std::begin(towns), std::begin(towns) + root - 1, std::end(towns),
                [&](int town_1, int town_2) {
                    return mx_lens[town_1] > mx_lens[town_2];
                }
            );
            for (auto j = 0; j < root; ++j) {
                lens[i].push_back(Town({towns[j], mx_lens[towns[j]]}));
            }
        } else {
            for (auto x : towns) {
                lens[i].push_back(Town({x, mx_lens[x]}));
            }
            lens[i].push_back(Town({i, 0}));
        }
        for (auto x : towns) {
            mx_lens[x] = 0;
        }
    }

    for (auto i = 0; i < q; ++i) {
        auto t = 0;
        auto y = 0;
        std::cin >> t >> y;
        --t;
        auto c = std::vector<int>(y);
        for (auto& x : c) {
            std::cin >> x;
            --x;
            in_c[x] = true;
        }
        auto mx_canals = -1;
        if (y < root) {
            for (const auto& [town, len] : lens[t]) {
                if (!in_c[town]) {
                    mx_canals = len;
                    break;
                }
            }
        } else {
            auto dp = std::vector<int>(t + 1, -(n + 1));
            dp[t] = 0;
            for (auto j = t; j >= 0; --j) {
                for (auto x : adj[j]) {
                    dp[x] = std::max(dp[x], dp[j] + 1);
                }
                if (!in_c[j]) {
                    mx_canals = std::max(mx_canals, dp[j]);
                }
            }
        }
        std::cout << mx_canals << '\n';
        for (auto x : c) {
            in_c[x] = false;
        }
    }

}

auto main() -> int {

    std::cin.tie(nullptr);

    std::ios_base::sync_with_stdio(false);

    solve();

    return 0;

}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 736 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 2 ms 720 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 736 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 2 ms 720 KB Output is correct
20 Correct 32 ms 3156 KB Output is correct
21 Correct 31 ms 3152 KB Output is correct
22 Correct 33 ms 3164 KB Output is correct
23 Correct 29 ms 3420 KB Output is correct
24 Correct 753 ms 255300 KB Output is correct
25 Correct 690 ms 266652 KB Output is correct
26 Correct 586 ms 265552 KB Output is correct
27 Correct 670 ms 413360 KB Output is correct
28 Correct 683 ms 413520 KB Output is correct
29 Correct 723 ms 413480 KB Output is correct
30 Correct 666 ms 412756 KB Output is correct
31 Correct 778 ms 398416 KB Output is correct
32 Correct 655 ms 412892 KB Output is correct
33 Correct 439 ms 255124 KB Output is correct
34 Correct 485 ms 209232 KB Output is correct
35 Correct 442 ms 253632 KB Output is correct
36 Correct 556 ms 334224 KB Output is correct
37 Correct 627 ms 302124 KB Output is correct
38 Correct 567 ms 335060 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 736 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 2 ms 720 KB Output is correct
20 Correct 32 ms 3156 KB Output is correct
21 Correct 31 ms 3152 KB Output is correct
22 Correct 33 ms 3164 KB Output is correct
23 Correct 29 ms 3420 KB Output is correct
24 Correct 753 ms 255300 KB Output is correct
25 Correct 690 ms 266652 KB Output is correct
26 Correct 586 ms 265552 KB Output is correct
27 Correct 670 ms 413360 KB Output is correct
28 Correct 683 ms 413520 KB Output is correct
29 Correct 723 ms 413480 KB Output is correct
30 Correct 666 ms 412756 KB Output is correct
31 Correct 778 ms 398416 KB Output is correct
32 Correct 655 ms 412892 KB Output is correct
33 Correct 439 ms 255124 KB Output is correct
34 Correct 485 ms 209232 KB Output is correct
35 Correct 442 ms 253632 KB Output is correct
36 Correct 556 ms 334224 KB Output is correct
37 Correct 627 ms 302124 KB Output is correct
38 Correct 567 ms 335060 KB Output is correct
39 Incorrect 606 ms 259448 KB Output isn't correct
40 Halted 0 ms 0 KB -