oj.uz

Submission #999134

# Submission time Handle Problem Language Result Execution time Memory
999134 2024-06-15T07:12:38 Z mdn2002 Closing Time (IOI23_closing) C++17
51 / 100
 1000 ms 1676236 KB 
/*
Mayoeba Yabureru
*/
//#include "closing.h"
#include<bits/stdc++.h>
using namespace std;


int max_score(int n, int x, int y, long long k, vector<int> U, vector<int> V, vector<int> W) {
    x ++, y ++;
    vector dis(n + 1, vector<long long>(2));
    vector<vector<pair<int, long long>>> gr(n + 1);

    for (int i = 0; i < n - 1; i ++) {
        int u = U[i] + 1, v = V[i] + 1, w = W[i];
        gr[u].push_back({v, w});
        gr[v].push_back({u, w});
    }

    function<void(int, int, int)> dfs = [&] (int v, int p, int wt) {
        for (auto [u, w] : gr[v]) {
            if (u == p) continue;
            dis[u][wt] = dis[v][wt] + w;
            dfs(u, v, wt);
        }
    };
    dfs(x, 0, 0), dfs(y, 0, 1);

    vector<int> vc, path, onpath(n + 1);
    function<void(int, int)> go = [&] (int v, int p) {
        vc.push_back(v);
        if (v == y) path = vc;
        for (auto [u, w] : gr[v]) {
            if (u == p) continue;
            go(u, v);
        }
        vc.pop_back();
    };
    go(x, 0);

    long long minstart = 0, mn = 1e15;
    for (int i = 1; i <= n; i ++) {
        if (max(dis[i][0], dis[i][1]) < mn) {
            minstart = i;
            mn = max(dis[i][0], dis[i][1]);
        }
    }

    for (auto x : path) {
        onpath[x] += 1;
        if (x == minstart) break;
    }
    for (int i = path.size() - 1; i >= 0; i --) {
        int x = path[i];
        onpath[x] += 2;
        if (x == minstart) break;
    }

    int ans = 0;
    function f = [&] {
        vector<int> did(n + 1);
        multiset<pair<long long, int>> s;
        for (int i = 1; i <= n; i ++) {
            s.insert({dis[i][0], i});
            s.insert({dis[i][1], i});
        }
        int cnt = 0;
        vector<int> v;

        while (s.size()) {
            auto [x, y] = *s.begin();
            s.erase(s.begin());
            if (did[y]) continue;
            if (x > k) break;
            k -= x;
            did[y] = 1;
            cnt ++;
        }
        if (k >= 0) return cnt;
        return -100000000;
    };

    long long kk = k;
    ans = f();
    k = kk;

    vector dp(n + 1, vector (2 * (n + 1), vector (2, vector<long long> (2, 1e18))));
    vector dpp(2 * (n + 1), vector (2, vector<long long>(2, 1e16)));

    vector<int> siz(n + 1);
    function<void(int, int)> calcsiz = [&] (int x, int p) {
        siz[x] = 1;
        for (auto [u, w] : gr[x]) {
            if (u == p) continue;
            calcsiz(u, x);
            siz[x] += siz[u];
        }
    };
    calcsiz(minstart, 0);
    map<vector<int>, int> did;
    function<void(int, int, int, int)> calc = [&] (int x, int p, int rx, int ry) {
        if (did[{x, rx, ry}]) return;
        did[{x, rx, ry}] = 1;
        if (rx == 0 && ry == 0) dp[x][0][rx][ry] = 0;
        if (rx && ry == 0) dp[x][1][rx][ry] = min(dp[x][1][rx][ry], dis[x][0]);
        if (ry && rx == 0) dp[x][1][rx][ry] = min(dp[x][1][rx][ry], dis[x][1]);
        if (rx && ry) dp[x][2][rx][ry] = min(dp[x][2][rx][ry], max(dis[x][0], dis[x][1]));

        int sumsiz = 1;
        for (auto [u, w] : gr[x]) {
            if (u == p) continue;
            calc(u, x, rx, ry);
            if (rx && ry) {
                if (onpath[u] == 0) calc(u, x, 0, 0);
                if (onpath[u] != 1) calc(u, x, 0, 1);
                if (onpath[u] != 2) calc(u, x, 1, 0);
            }
            else if (rx && onpath[u] != 1) calc(u, x, 0, ry);
            else if (ry && onpath[u] != 2) calc(u, x, rx, 0);

            for (int i = 0; i <= rx; i ++) {
                for (int j = 0; j <= ry; j ++) {
                    for (int z = 2 * siz[u]; z >= 0; z --) {
                        for (int k = 2 * sumsiz; k >= 0; k --) {
                            dpp[k + z][rx][ry] = min(dpp[k + z][rx][ry], dp[x][k][rx][ry] + dp[u][z][i][j]);
                        }
                    }
                }
            }
            sumsiz += siz[u];
            for (int z = 0; z <= 2 * sumsiz; z ++) {
                dp[x][z][rx][ry] = dpp[z][rx][ry];
                dpp[z][rx][ry] = 1e16;
            }
        }
    };
    calc(minstart, 0, 1, 1);

    for (int i = 0; i <= 2 * n; i ++) {
        if (k >= dp[minstart][i][1][1]) ans = max(ans, i);
    }
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1112 ms 1247568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 5 ms 3420 KB Output is correct
13 Correct 4 ms 3420 KB Output is correct
14 Correct 3 ms 3032 KB Output is correct
15 Correct 4 ms 2908 KB Output is correct
16 Correct 4 ms 3420 KB Output is correct
17 Correct 4 ms 3420 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 102 ms 75408 KB Output is correct
20 Correct 92 ms 63344 KB Output is correct
21 Correct 90 ms 69412 KB Output is correct
22 Correct 102 ms 75004 KB Output is correct
23 Correct 94 ms 75348 KB Output is correct
24 Correct 102 ms 75344 KB Output is correct

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 5 ms 3420 KB Output is correct
13 Correct 4 ms 3420 KB Output is correct
14 Correct 3 ms 3032 KB Output is correct
15 Correct 4 ms 2908 KB Output is correct
16 Correct 4 ms 3420 KB Output is correct
17 Correct 4 ms 3420 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 102 ms 75408 KB Output is correct
20 Correct 92 ms 63344 KB Output is correct
21 Correct 90 ms 69412 KB Output is correct
22 Correct 102 ms 75004 KB Output is correct
23 Correct 94 ms 75348 KB Output is correct
24 Correct 102 ms 75344 KB Output is correct
25 Correct 44 ms 1116 KB Output is correct
26 Execution timed out 1166 ms 1676236 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 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 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 436 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 5 ms 3420 KB Output is correct
14 Correct 4 ms 3420 KB Output is correct
15 Correct 3 ms 3032 KB Output is correct
16 Correct 4 ms 2908 KB Output is correct
17 Correct 4 ms 3420 KB Output is correct
18 Correct 4 ms 3420 KB Output is correct
19 Correct 0 ms 344 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 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 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 1 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 1 ms 348 KB Output is correct
36 Correct 0 ms 436 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 2 ms 1076 KB Output is correct
39 Correct 4 ms 3420 KB Output is correct
40 Correct 4 ms 3160 KB Output is correct
41 Correct 4 ms 3404 KB Output is correct
42 Correct 4 ms 3164 KB Output is correct
43 Correct 3 ms 2908 KB Output is correct
44 Correct 5 ms 3164 KB Output is correct
45 Correct 4 ms 3420 KB Output is correct
46 Correct 4 ms 3424 KB Output is correct
47 Correct 4 ms 3420 KB Output is correct
48 Correct 3 ms 2652 KB Output is correct
49 Correct 2 ms 1372 KB Output is correct
50 Correct 1 ms 604 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 5 ms 3420 KB Output is correct
14 Correct 4 ms 3420 KB Output is correct
15 Correct 3 ms 3032 KB Output is correct
16 Correct 4 ms 2908 KB Output is correct
17 Correct 4 ms 3420 KB Output is correct
18 Correct 4 ms 3420 KB Output is correct
19 Correct 4 ms 600 KB Output is correct
20 Correct 102 ms 75408 KB Output is correct
21 Correct 92 ms 63344 KB Output is correct
22 Correct 90 ms 69412 KB Output is correct
23 Correct 102 ms 75004 KB Output is correct
24 Correct 94 ms 75348 KB Output is correct
25 Correct 102 ms 75344 KB Output is correct
26 Correct 0 ms 344 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 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 436 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 2 ms 1076 KB Output is correct
46 Correct 4 ms 3420 KB Output is correct
47 Correct 4 ms 3160 KB Output is correct
48 Correct 4 ms 3404 KB Output is correct
49 Correct 4 ms 3164 KB Output is correct
50 Correct 3 ms 2908 KB Output is correct
51 Correct 5 ms 3164 KB Output is correct
52 Correct 4 ms 3420 KB Output is correct
53 Correct 4 ms 3424 KB Output is correct
54 Correct 4 ms 3420 KB Output is correct
55 Correct 3 ms 2652 KB Output is correct
56 Correct 2 ms 1372 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 5 ms 856 KB Output is correct
59 Correct 12 ms 3164 KB Output is correct
60 Correct 15 ms 3584 KB Output is correct
61 Correct 22 ms 7260 KB Output is correct
62 Correct 20 ms 7260 KB Output is correct
63 Correct 98 ms 75432 KB Output is correct
64 Correct 84 ms 65624 KB Output is correct
65 Correct 78 ms 62040 KB Output is correct
66 Correct 81 ms 66388 KB Output is correct
67 Correct 95 ms 74224 KB Output is correct
68 Correct 81 ms 62292 KB Output is correct
69 Correct 94 ms 74320 KB Output is correct
70 Correct 85 ms 69200 KB Output is correct
71 Correct 85 ms 67928 KB Output is correct
72 Correct 89 ms 70740 KB Output is correct
73 Correct 57 ms 46164 KB Output is correct
74 Correct 62 ms 51548 KB Output is correct
75 Correct 17 ms 3420 KB Output is correct

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 5 ms 3420 KB Output is correct
14 Correct 4 ms 3420 KB Output is correct
15 Correct 3 ms 3032 KB Output is correct
16 Correct 4 ms 2908 KB Output is correct
17 Correct 4 ms 3420 KB Output is correct
18 Correct 4 ms 3420 KB Output is correct
19 Correct 4 ms 600 KB Output is correct
20 Correct 102 ms 75408 KB Output is correct
21 Correct 92 ms 63344 KB Output is correct
22 Correct 90 ms 69412 KB Output is correct
23 Correct 102 ms 75004 KB Output is correct
24 Correct 94 ms 75348 KB Output is correct
25 Correct 102 ms 75344 KB Output is correct
26 Correct 44 ms 1116 KB Output is correct
27 Execution timed out 1166 ms 1676236 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 5 ms 3420 KB Output is correct
14 Correct 4 ms 3420 KB Output is correct
15 Correct 3 ms 3032 KB Output is correct
16 Correct 4 ms 2908 KB Output is correct
17 Correct 4 ms 3420 KB Output is correct
18 Correct 4 ms 3420 KB Output is correct
19 Correct 4 ms 600 KB Output is correct
20 Correct 102 ms 75408 KB Output is correct
21 Correct 92 ms 63344 KB Output is correct
22 Correct 90 ms 69412 KB Output is correct
23 Correct 102 ms 75004 KB Output is correct
24 Correct 94 ms 75348 KB Output is correct
25 Correct 102 ms 75344 KB Output is correct
26 Correct 44 ms 1116 KB Output is correct
27 Execution timed out 1166 ms 1676236 KB Time limit exceeded
28 Halted 0 ms 0 KB -