oj.uz

Submission #1085318

# Submission time Handle Problem Language Result Execution time Memory
1085318 2024-09-08T00:00:22 Z eysbutno Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 84656 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = array<int, 2>;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
 
constexpr int B = 60;
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int n, m, q;
    cin >> n >> m >> q;
    vector<vector<int>> adj(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        adj[u].push_back(v);
    }
    vector<vector<pii>> best(n);
    const auto merge = [&](int from, int to) -> void {
        map<int, int> mp;
        for (auto [node, dist] : best[from]) {
            mp[node] = max(mp[node], dist + 1);
        }
        for (auto [node, dist] : best[to]) {
            mp[node] = max(mp[node], dist);
        }
        best[to].clear();
        for (auto [node, dist] : mp) {
            best[to].push_back({node, dist});
        }
        sort(all(best[to]), [&](auto &x, auto &y) -> bool {
            return x[1] > y[1];
        });
        if (sz(best[to]) > B) { best[to].resize(B); }
    };
    for (int u = 0; u < n; u++) {
        if (sz(best[u]) < B) {
            best[u].push_back({u, 0});
        }
        for (int v : adj[u]) {
            merge(u, v);
        }
    }
    const auto check = [&](int t, const set<int> &bad) -> int {
        for (auto [node, dist] : best[t]) {
            if (!bad.count(node)) {
                return dist;
            }
        }
        return -1;
    };
    const auto brute_force = [&](int t, const set<int> &bad) -> int {
        vector<int> opt(n, -1);
        for (int u = 0; u <= t; u++) {
            if (!bad.count(u)) { opt[u] = max(0, opt[u]); }
            for (int v : adj[u]) {
                if (opt[u] != -1) { opt[v] = max(opt[v], opt[u] + 1); }
            }
        }
        return opt[t];
    };
    while (q--) {
        int t, y;
        cin >> t >> y;
        --t;
        set<int> bad;
        for (int i = 0; i < y; i++) {
            int x; cin >> x;
            bad.insert(--x);
        }
        if (y >= B) {
            cout << brute_force(t, bad) << "\n";
        } else {
            cout << check(t, bad) << "\n";
        }
    }
    /*
    for (int i = 0; i < n; i++) {
        cout << "node " << i + 1 << "\n";
        for (auto [node, dist] : best[i]) {
            cout << node + 1 << " " << dist << "\n";
        }
    }
    */
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 856 KB Output is correct
6 Correct 7 ms 860 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 8 ms 888 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 7 ms 1072 KB Output is correct
11 Correct 7 ms 856 KB Output is correct
12 Correct 9 ms 1116 KB Output is correct
13 Correct 8 ms 976 KB Output is correct
14 Correct 7 ms 856 KB Output is correct
15 Correct 10 ms 856 KB Output is correct
16 Correct 8 ms 872 KB Output is correct
17 Correct 8 ms 868 KB Output is correct
18 Correct 9 ms 972 KB Output is correct
19 Correct 9 ms 860 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 856 KB Output is correct
6 Correct 7 ms 860 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 8 ms 888 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 7 ms 1072 KB Output is correct
11 Correct 7 ms 856 KB Output is correct
12 Correct 9 ms 1116 KB Output is correct
13 Correct 8 ms 976 KB Output is correct
14 Correct 7 ms 856 KB Output is correct
15 Correct 10 ms 856 KB Output is correct
16 Correct 8 ms 872 KB Output is correct
17 Correct 8 ms 868 KB Output is correct
18 Correct 9 ms 972 KB Output is correct
19 Correct 9 ms 860 KB Output is correct
20 Correct 669 ms 3676 KB Output is correct
21 Correct 645 ms 3684 KB Output is correct
22 Correct 642 ms 3712 KB Output is correct
23 Correct 727 ms 3576 KB Output is correct
24 Correct 1312 ms 76380 KB Output is correct
25 Correct 1309 ms 76356 KB Output is correct
26 Correct 1265 ms 76128 KB Output is correct
27 Correct 784 ms 65376 KB Output is correct
28 Correct 747 ms 65232 KB Output is correct
29 Correct 784 ms 65108 KB Output is correct
30 Correct 828 ms 64768 KB Output is correct
31 Correct 1249 ms 84656 KB Output is correct
32 Correct 799 ms 64596 KB Output is correct
33 Correct 754 ms 53208 KB Output is correct
34 Correct 1286 ms 61012 KB Output is correct
35 Correct 715 ms 53328 KB Output is correct
36 Correct 744 ms 56912 KB Output is correct
37 Correct 1353 ms 76168 KB Output is correct
38 Correct 791 ms 56892 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 856 KB Output is correct
6 Correct 7 ms 860 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 8 ms 888 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 7 ms 1072 KB Output is correct
11 Correct 7 ms 856 KB Output is correct
12 Correct 9 ms 1116 KB Output is correct
13 Correct 8 ms 976 KB Output is correct
14 Correct 7 ms 856 KB Output is correct
15 Correct 10 ms 856 KB Output is correct
16 Correct 8 ms 872 KB Output is correct
17 Correct 8 ms 868 KB Output is correct
18 Correct 9 ms 972 KB Output is correct
19 Correct 9 ms 860 KB Output is correct
20 Correct 669 ms 3676 KB Output is correct
21 Correct 645 ms 3684 KB Output is correct
22 Correct 642 ms 3712 KB Output is correct
23 Correct 727 ms 3576 KB Output is correct
24 Correct 1312 ms 76380 KB Output is correct
25 Correct 1309 ms 76356 KB Output is correct
26 Correct 1265 ms 76128 KB Output is correct
27 Correct 784 ms 65376 KB Output is correct
28 Correct 747 ms 65232 KB Output is correct
29 Correct 784 ms 65108 KB Output is correct
30 Correct 828 ms 64768 KB Output is correct
31 Correct 1249 ms 84656 KB Output is correct
32 Correct 799 ms 64596 KB Output is correct
33 Correct 754 ms 53208 KB Output is correct
34 Correct 1286 ms 61012 KB Output is correct
35 Correct 715 ms 53328 KB Output is correct
36 Correct 744 ms 56912 KB Output is correct
37 Correct 1353 ms 76168 KB Output is correct
38 Correct 791 ms 56892 KB Output is correct
39 Correct 1316 ms 75348 KB Output is correct
40 Correct 1175 ms 73900 KB Output is correct
41 Execution timed out 2021 ms 73932 KB Time limit exceeded
42 Halted 0 ms 0 KB -