oj.uz

Submission #925243

# Submission time Handle Problem Language Result Execution time Memory
925243 2024-02-11T07:47:26 Z TAhmed33 Road Closures (APIO21_roads) C++17
29 / 100
 2000 ms 20604 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e14;
const int MAXN = 1e5 + 25;
vector <pair <int, int>> adj[MAXN];
ll dp[MAXN][2], cur; int n;
void dfs (int pos, int par) {
    ll sum = 0;
    for (auto j : adj[pos]) {
        if (j.first != par) {
            dfs(j.first, pos);
            sum += dp[j.first][0];
        }
    }
    dp[pos][0] = dp[pos][1] = sum;
    vector <ll> k;
    for (auto j : adj[pos]) {
        if (j.first != par) {
            k.push_back(j.second + dp[j.first][1] - dp[j.first][0]);
        }
    }
    sort(k.begin(), k.end());
    int z = (int)adj[pos].size() - (par != -1);
    ll mx1 = inf, mx2 = inf;
    sum = 0;
    k.insert(k.begin(), 0);
    for (int j = 0; j < (int)k.size(); j++) {
        sum += k[j];
        if (j >= z - cur + (par != -1)) mx1 = min(mx1, sum);
        if (j >= z - cur) mx2 = min(mx2, sum);
    }
    dp[pos][0] += mx1; dp[pos][1] += mx2;
}
vector <ll> minimum_closure_costs (int N, vector <int> u, vector <int> v, vector <int> w) {
    n = N; ll sum = 0;
    bool flag = 1;
    for (int i = 0; i + 1 < n; i++) {
        adj[u[i] + 1].push_back({v[i] + 1, w[i]});
        adj[v[i] + 1].push_back({u[i] + 1, w[i]}); sum += w[i];
        flag &= u[i] == 0;
    }
    if (flag) {
        vector <ll> ans;
        sort(w.begin(), w.end());
        ll pref[(int)w.size() + 1] = {};
        for (int i = 0; i < (int)w.size(); i++) {
            pref[i + 1] = w[i] + pref[i];
        }
        for (int i = 0; i < n; i++) {
            ans.push_back(pref[n - 1 - i]);
        }
        return ans;
    }
    vector <ll> ans = {sum};
    for (int i = 1; i < n; i++) {
        cur = i; for (int j = 1; j <= n; j++) dp[j][0] = dp[j][1] = 0;
        dfs(1, -1);
        ans.push_back(dp[1][0]);
    }
    return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Correct 2 ms 4188 KB Output is correct
3 Correct 2 ms 4184 KB Output is correct
4 Correct 2 ms 4188 KB Output is correct
5 Correct 1 ms 4188 KB Output is correct
6 Correct 1 ms 4188 KB Output is correct
7 Correct 1 ms 4188 KB Output is correct
8 Correct 2 ms 4184 KB Output is correct
9 Correct 2 ms 4188 KB Output is correct
10 Correct 2 ms 4188 KB Output is correct
11 Correct 1 ms 4188 KB Output is correct
12 Correct 24 ms 9112 KB Output is correct
13 Correct 42 ms 12748 KB Output is correct
14 Correct 44 ms 11720 KB Output is correct
15 Correct 51 ms 12484 KB Output is correct
16 Correct 47 ms 12752 KB Output is correct
17 Correct 42 ms 12744 KB Output is correct
18 Correct 1 ms 3932 KB Output is correct
19 Correct 41 ms 12076 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Execution timed out 2074 ms 20604 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 1 ms 3928 KB Output is correct
4 Correct 3 ms 4184 KB Output is correct
5 Correct 4 ms 4188 KB Output is correct
6 Correct 3 ms 4188 KB Output is correct
7 Correct 4 ms 4188 KB Output is correct
8 Correct 4 ms 4188 KB Output is correct
9 Correct 4 ms 4188 KB Output is correct
10 Correct 3 ms 4188 KB Output is correct
11 Correct 3 ms 4204 KB Output is correct
12 Correct 4 ms 4188 KB Output is correct
13 Correct 1 ms 4188 KB Output is correct
14 Correct 1 ms 4080 KB Output is correct
15 Correct 1 ms 4188 KB Output is correct
16 Correct 2 ms 4188 KB Output is correct
17 Correct 4 ms 4188 KB Output is correct
18 Correct 3 ms 4188 KB Output is correct
19 Correct 1 ms 4188 KB Output is correct
20 Correct 2 ms 4188 KB Output is correct
21 Correct 1 ms 3932 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 1 ms 3928 KB Output is correct
4 Correct 3 ms 4184 KB Output is correct
5 Correct 4 ms 4188 KB Output is correct
6 Correct 3 ms 4188 KB Output is correct
7 Correct 4 ms 4188 KB Output is correct
8 Correct 4 ms 4188 KB Output is correct
9 Correct 4 ms 4188 KB Output is correct
10 Correct 3 ms 4188 KB Output is correct
11 Correct 3 ms 4204 KB Output is correct
12 Correct 4 ms 4188 KB Output is correct
13 Correct 1 ms 4188 KB Output is correct
14 Correct 1 ms 4080 KB Output is correct
15 Correct 1 ms 4188 KB Output is correct
16 Correct 2 ms 4188 KB Output is correct
17 Correct 4 ms 4188 KB Output is correct
18 Correct 3 ms 4188 KB Output is correct
19 Correct 1 ms 4188 KB Output is correct
20 Correct 2 ms 4188 KB Output is correct
21 Correct 1 ms 3932 KB Output is correct
22 Correct 1 ms 3932 KB Output is correct
23 Correct 102 ms 4272 KB Output is correct
24 Correct 281 ms 4600 KB Output is correct
25 Correct 197 ms 4188 KB Output is correct
26 Correct 215 ms 4188 KB Output is correct
27 Correct 189 ms 4612 KB Output is correct
28 Correct 141 ms 4188 KB Output is correct
29 Correct 224 ms 4188 KB Output is correct
30 Correct 166 ms 4692 KB Output is correct
31 Correct 159 ms 4352 KB Output is correct
32 Correct 133 ms 4344 KB Output is correct
33 Correct 175 ms 4532 KB Output is correct
34 Correct 220 ms 4584 KB Output is correct
35 Correct 177 ms 4440 KB Output is correct
36 Correct 2 ms 4188 KB Output is correct
37 Correct 2 ms 4188 KB Output is correct
38 Correct 2 ms 4188 KB Output is correct
39 Correct 1 ms 4016 KB Output is correct
40 Correct 1 ms 3932 KB Output is correct
41 Correct 3 ms 4188 KB Output is correct
42 Correct 4 ms 4188 KB Output is correct
43 Correct 3 ms 4188 KB Output is correct
44 Correct 3 ms 4184 KB Output is correct
45 Correct 3 ms 4188 KB Output is correct
46 Correct 3 ms 4188 KB Output is correct
47 Correct 3 ms 4188 KB Output is correct
48 Correct 4 ms 4188 KB Output is correct
49 Correct 3 ms 4188 KB Output is correct
50 Correct 1 ms 4188 KB Output is correct
51 Correct 1 ms 4188 KB Output is correct
52 Correct 1 ms 4184 KB Output is correct
53 Correct 169 ms 4188 KB Output is correct
54 Correct 271 ms 4332 KB Output is correct
55 Correct 150 ms 4356 KB Output is correct
56 Correct 2 ms 4440 KB Output is correct
57 Correct 2 ms 4188 KB Output is correct
58 Correct 2 ms 4188 KB Output is correct
59 Correct 3 ms 4188 KB Output is correct
60 Correct 3 ms 4184 KB Output is correct
61 Correct 1 ms 4188 KB Output is correct
62 Correct 1 ms 4188 KB Output is correct
63 Correct 1 ms 3932 KB Output is correct
64 Correct 261 ms 4340 KB Output is correct
65 Correct 273 ms 4344 KB Output is correct
66 Correct 144 ms 4592 KB Output is correct
67 Correct 134 ms 4188 KB Output is correct
68 Correct 140 ms 4336 KB Output is correct

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

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

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Correct 2 ms 4188 KB Output is correct
3 Correct 2 ms 4184 KB Output is correct
4 Correct 2 ms 4188 KB Output is correct
5 Correct 1 ms 4188 KB Output is correct
6 Correct 1 ms 4188 KB Output is correct
7 Correct 1 ms 4188 KB Output is correct
8 Correct 2 ms 4184 KB Output is correct
9 Correct 2 ms 4188 KB Output is correct
10 Correct 2 ms 4188 KB Output is correct
11 Correct 1 ms 4188 KB Output is correct
12 Correct 24 ms 9112 KB Output is correct
13 Correct 42 ms 12748 KB Output is correct
14 Correct 44 ms 11720 KB Output is correct
15 Correct 51 ms 12484 KB Output is correct
16 Correct 47 ms 12752 KB Output is correct
17 Correct 42 ms 12744 KB Output is correct
18 Correct 1 ms 3932 KB Output is correct
19 Correct 41 ms 12076 KB Output is correct
20 Correct 1 ms 3932 KB Output is correct
21 Execution timed out 2074 ms 20604 KB Time limit exceeded
22 Halted 0 ms 0 KB -