oj.uz

Submission #561560

# Submission time Handle Problem Language Result Execution time Memory
561560 2022-05-13T07:13:07 Z piOOE Road Closures (APIO21_roads) C++17
0 / 100
 221 ms 31872 KB 
#include "roads.h"

#include <bits/stdc++.h>

using namespace std;

#define all(x) begin(x), end(x)

typedef long long ll;

const int N = 2001;
int A[N], B[N], W[N], n;
ll dp[N][N];
vector <pair<int, int>> g[N];

void dfs(int v, int p) {
    vector<pair<int, int>> adj;
    for (auto [to, w]: g[v]) {
        if (to != p) {
            dfs(to, v);
            adj.emplace_back(to, w);
        }
    }
    for (int k = 0; k < n; ++k) {
        vector<ll> nw;
        ll ans = 0;
        for (auto [to, w]: adj) {
            ans += dp[to][k] + w;
            if (k) {
                nw.push_back(dp[to][k - 1] - dp[to][k] - w);
            }
        }
        sort(all(nw));
        for (int i = 0; i < min((int)size(nw), k); ++i) {
            if (nw[i] < 0)
                ans += nw[i];
        }
        dp[v][k] = ans;
        if (k) {
            dp[v][k] = min(dp[v][k], dp[v][k - 1]);
        }
    }
}

vector <ll> minimum_closure_costs(int nn, vector<int> uu, vector<int> vv, vector<int> ww) {
    n = nn;
    for (int i = 0; i < n - 1; ++i) {
        A[i] = uu[i], B[i] = vv[i], W[i] = ww[i];
        g[A[i]].emplace_back(B[i], W[i]);
        g[B[i]].emplace_back(A[i], W[i]);
    }
    vector <ll> ans;
    dfs(0, -1);
    for (int i = 0; i < n; ++i) {
        ans.push_back(dp[0][i]);
    }
    return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 205 ms 29988 KB Output is correct
3 Correct 221 ms 31872 KB Output is correct
4 Correct 113 ms 31844 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 2 ms 1492 KB Output is correct
7 Correct 2 ms 1492 KB Output is correct
8 Correct 122 ms 26896 KB Output is correct
9 Correct 153 ms 31868 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Runtime error 19 ms 6740 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 38 ms 5068 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 2 ms 1108 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 2 ms 1108 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 10312 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 10312 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 205 ms 29988 KB Output is correct
3 Correct 221 ms 31872 KB Output is correct
4 Correct 113 ms 31844 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 2 ms 1492 KB Output is correct
7 Correct 2 ms 1492 KB Output is correct
8 Correct 122 ms 26896 KB Output is correct
9 Correct 153 ms 31868 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Runtime error 19 ms 6740 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -