oj.uz

Submission #1032435

# Submission time Handle Problem Language Result Execution time Memory
1032435 2024-07-23T18:28:28 Z Turkhuu Closing Time (IOI23_closing) C++17
51 / 100
 1000 ms 2097152 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    vector<vector<array<int, 2>>> adj(N);
    for (int i = 0; i < N - 1; i++) {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }
    auto bfs = [&](int s) {
        vector<ll> dis(N);
        vector<int> from(N, -1);
        from[s] = s;
        queue<int> q;
        q.push(s);
        while (!q.empty()) {
            int x = q.front();
            q.pop();
            for (auto [y, z] : adj[x]) {
                if (from[y] == -1) {
                    from[y] = x;
                    dis[y] = dis[x] + z;
                    q.push(y);
                }
            }
        }
        return make_pair(dis, from);
    };
    auto [dis_x, from_x] = bfs(X);
    auto [dis_y, from_y] = bfs(Y);
    vector<ll> one(N), two(N);
    for (int i = 0; i < N; i++) {
        tie(one[i], two[i]) = minmax(dis_x[i], dis_y[i]);
    }
    int ans = 0; {
        auto a(one);
        sort(a.begin(), a.end());
        ll sum = 0;
        while (ans < N && sum + a[ans] <= K) sum += a[ans++];
    }
    vector<int> path{X};
    while (path.back() != Y) path.push_back(from_y[path.back()]);
    int M = path.size();
    vector<int> on_path(N);
    for (auto x : path) on_path[x] = 1;
    vector dp(N, vector(3, vector<ll>(2 * N + 1, 1e18)));
    function<void(int, int)> dfs = [&](int x, int p) {
        dp[x][1][1] = one[x];
        dp[x][2][2] = two[x];
        for (auto [y, z] : adj[x]) {
            if (y == p || on_path[y]) continue;
            dfs(y, x);
            for (int i = 2 * N; i >= 0; i--) {
                for (int j = i - 1; j >= 0; j--) {
                    dp[x][1][i] = min(dp[x][1][i], dp[y][1][i - j] + dp[x][1][j]);
                    dp[x][2][i] = min(dp[x][2][i], min(dp[y][1][j], dp[y][2][j]) + dp[x][2][i - j]);
                }
            }
        }
    };
    for (auto x : path) dfs(x, -1);
    // for (int i = 0; i < M; i++) {
    //     int x = path[i];
    //     cout << x + 1 << ":-----------------\n";
    //     for (int j = 1; j <= 2; j++) {
    //         cout << "  " << j << ":\n";
    //         for (int k = 0; k <= 2 * N; k++) {
    //             if (dp[x][j][k] != 1e18) {
    //                 cout << "   " << k << " " << dp[x][j][k] << "\n";
    //             }
    //         }
    //     }
    // }
    vector f(M + 1, vector(3, vector<ll>(2 * N + 1, 1e18)));
    f[0][0][0] = 0;
    for (int i = 1; i <= M; i++) {
        int x = path[i - 1];
        for (int j = 0; j <= 2 * N; j++) {
            for (int k = j; k <= 2 * N; k++) {
                f[i][0][k] = min(f[i][0][k], f[i - 1][0][j] + dp[x][1][k - j]);
                f[i][2][k] = min(f[i][2][k], min(f[i - 1][0][j], f[i - 1][2][j]) + dp[x][2][k - j]);
                f[i][1][k] = min(f[i][1][k], min(f[i - 1][1][j], f[i - 1][2][j]) + dp[x][1][k - j]);
            }
        }
    }
    for (int i = 2 * N; i >= 0; i--) {
        if (f[M][1][i] <= K || f[M][2][i] <= K) {
            ans = max(ans, i);
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 878 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 1 ms 696 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 1 ms 696 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 952 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 3 ms 876 KB Output is correct
16 Correct 5 ms 1628 KB Output is correct
17 Correct 5 ms 1372 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 364 ms 12380 KB Output is correct
20 Correct 300 ms 10392 KB Output is correct
21 Correct 396 ms 18292 KB Output is correct
22 Correct 426 ms 17492 KB Output is correct
23 Correct 539 ms 24156 KB Output is correct
24 Correct 508 ms 24152 KB Output is correct

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 1 ms 696 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 952 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 3 ms 876 KB Output is correct
16 Correct 5 ms 1628 KB Output is correct
17 Correct 5 ms 1372 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 364 ms 12380 KB Output is correct
20 Correct 300 ms 10392 KB Output is correct
21 Correct 396 ms 18292 KB Output is correct
22 Correct 426 ms 17492 KB Output is correct
23 Correct 539 ms 24156 KB Output is correct
24 Correct 508 ms 24152 KB Output is correct
25 Correct 31 ms 752 KB Output is correct
26 Execution timed out 1073 ms 424276 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 432 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 436 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 432 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 1 ms 696 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 4 ms 952 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 5 ms 1628 KB Output is correct
18 Correct 5 ms 1372 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 436 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 4 ms 860 KB Output is correct
40 Correct 3 ms 860 KB Output is correct
41 Correct 4 ms 860 KB Output is correct
42 Correct 4 ms 860 KB Output is correct
43 Correct 5 ms 1116 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 4 ms 936 KB Output is correct
46 Correct 5 ms 864 KB Output is correct
47 Correct 4 ms 864 KB Output is correct
48 Correct 3 ms 832 KB Output is correct
49 Correct 2 ms 600 KB Output is correct
50 Correct 1 ms 344 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 432 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 1 ms 696 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 4 ms 952 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 5 ms 1628 KB Output is correct
18 Correct 5 ms 1372 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 364 ms 12380 KB Output is correct
21 Correct 300 ms 10392 KB Output is correct
22 Correct 396 ms 18292 KB Output is correct
23 Correct 426 ms 17492 KB Output is correct
24 Correct 539 ms 24156 KB Output is correct
25 Correct 508 ms 24152 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 436 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 4 ms 860 KB Output is correct
47 Correct 3 ms 860 KB Output is correct
48 Correct 4 ms 860 KB Output is correct
49 Correct 4 ms 860 KB Output is correct
50 Correct 5 ms 1116 KB Output is correct
51 Correct 4 ms 860 KB Output is correct
52 Correct 4 ms 936 KB Output is correct
53 Correct 5 ms 864 KB Output is correct
54 Correct 4 ms 864 KB Output is correct
55 Correct 3 ms 832 KB Output is correct
56 Correct 2 ms 600 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 2 ms 348 KB Output is correct
59 Correct 13 ms 860 KB Output is correct
60 Correct 19 ms 1272 KB Output is correct
61 Correct 35 ms 1704 KB Output is correct
62 Correct 34 ms 1624 KB Output is correct
63 Correct 344 ms 12340 KB Output is correct
64 Correct 288 ms 10832 KB Output is correct
65 Correct 276 ms 11096 KB Output is correct
66 Correct 292 ms 10844 KB Output is correct
67 Correct 350 ms 12120 KB Output is correct
68 Correct 382 ms 19228 KB Output is correct
69 Correct 470 ms 21280 KB Output is correct
70 Correct 354 ms 13912 KB Output is correct
71 Correct 358 ms 14932 KB Output is correct
72 Correct 309 ms 11856 KB Output is correct
73 Correct 189 ms 7700 KB Output is correct
74 Correct 192 ms 8536 KB Output is correct
75 Correct 11 ms 860 KB Output is correct

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 432 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 1 ms 696 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 4 ms 952 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 5 ms 1628 KB Output is correct
18 Correct 5 ms 1372 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 364 ms 12380 KB Output is correct
21 Correct 300 ms 10392 KB Output is correct
22 Correct 396 ms 18292 KB Output is correct
23 Correct 426 ms 17492 KB Output is correct
24 Correct 539 ms 24156 KB Output is correct
25 Correct 508 ms 24152 KB Output is correct
26 Correct 31 ms 752 KB Output is correct
27 Execution timed out 1073 ms 424276 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 432 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 1 ms 696 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 4 ms 952 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 5 ms 1628 KB Output is correct
18 Correct 5 ms 1372 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 364 ms 12380 KB Output is correct
21 Correct 300 ms 10392 KB Output is correct
22 Correct 396 ms 18292 KB Output is correct
23 Correct 426 ms 17492 KB Output is correct
24 Correct 539 ms 24156 KB Output is correct
25 Correct 508 ms 24152 KB Output is correct
26 Correct 31 ms 752 KB Output is correct
27 Execution timed out 1073 ms 424276 KB Time limit exceeded
28 Halted 0 ms 0 KB -