oj.uz

Submission #949066

# Submission time Handle Problem Language Result Execution time Memory
949066 2024-03-18T22:37:25 Z y_combinator Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 750 ms 410964 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, -(1 << 30));
            for (auto j = 0; j <= t; ++j) {
                if (!in_c[j]) {
                    dp[j] = 0;
                }
                for (auto x : adj[j]) {
                    dp[j] = std::max(dp[j], dp[x] + 1);
                }
            }
            if (dp[t] >= 0) {
                mx_canals = dp[t];
            }
        }
        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 1 ms 348 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 30 ms 1620 KB Output is correct
21 Correct 34 ms 1624 KB Output is correct
22 Correct 31 ms 2060 KB Output is correct
23 Correct 31 ms 1864 KB Output is correct
24 Correct 575 ms 252508 KB Output is correct
25 Correct 575 ms 264356 KB Output is correct
26 Correct 586 ms 262928 KB Output is correct
27 Correct 679 ms 410840 KB Output is correct
28 Correct 659 ms 410800 KB Output is correct
29 Correct 664 ms 410964 KB Output is correct
30 Correct 640 ms 410120 KB Output is correct
31 Correct 750 ms 396180 KB Output is correct
32 Correct 641 ms 410480 KB Output is correct
33 Correct 431 ms 252504 KB Output is correct
34 Correct 475 ms 206676 KB Output is correct
35 Correct 421 ms 250968 KB Output is correct
36 Correct 537 ms 331548 KB Output is correct
37 Correct 646 ms 299984 KB Output is correct
38 Correct 537 ms 332628 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 376 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 30 ms 1620 KB Output is correct
21 Correct 34 ms 1624 KB Output is correct
22 Correct 31 ms 2060 KB Output is correct
23 Correct 31 ms 1864 KB Output is correct
24 Correct 575 ms 252508 KB Output is correct
25 Correct 575 ms 264356 KB Output is correct
26 Correct 586 ms 262928 KB Output is correct
27 Correct 679 ms 410840 KB Output is correct
28 Correct 659 ms 410800 KB Output is correct
29 Correct 664 ms 410964 KB Output is correct
30 Correct 640 ms 410120 KB Output is correct
31 Correct 750 ms 396180 KB Output is correct
32 Correct 641 ms 410480 KB Output is correct
33 Correct 431 ms 252504 KB Output is correct
34 Correct 475 ms 206676 KB Output is correct
35 Correct 421 ms 250968 KB Output is correct
36 Correct 537 ms 331548 KB Output is correct
37 Correct 646 ms 299984 KB Output is correct
38 Correct 537 ms 332628 KB Output is correct
39 Incorrect 603 ms 255972 KB Output isn't correct
40 Halted 0 ms 0 KB -