oj.uz

Submission #501548

# Submission time Handle Problem Language Result Execution time Memory
501548 2022-01-03T23:26:44 Z Victor Road Closures (APIO21_roads) C++17
24 / 100
 367 ms 7856 KB 
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize ("Ofast,inline") // O1 - O2 - O3 - Os - Ofast
// #pragma GCC optimize ("unroll-loops")

#include "roads.h"

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

int n, k;
vii graph[2001];
ll memo[2001][2];

void dp(int u, int p) {
    ll sum = 0;
    vi diff;
    trav(edge, graph[u]) if (edge.first != p) {
        int v, w;
        tie(v, w) = edge;
        dp(v, u);
        sum += memo[v][0];
        diff.emplace_back((memo[v][1] + w) - memo[v][0]);
    }

    sort(all(diff));
    memo[u][0] = memo[u][1] = -1;
    int need_rem = (sz(graph[u])) - k;
    if(sz(diff))assert(diff.back() < INF);
    diff.emplace_back(INF);
    trav(val, diff) {
        if (need_rem <= 1 && val >= 0 && memo[u][1] == -1) memo[u][1] = sum;
        if (need_rem <= 0 && val >= 0 && memo[u][0] == -1) memo[u][0] = sum;
        sum += val;
        --need_rem;
    }

    //cout<<"u = "<<u<<' '<<memo[u][0]<<' '<<memo[u][1]<<endl;
}

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    vll ans(n, 0);
    rep(i, 0, n - 1) {
        ans[0] += W[i];
        graph[U[i]].emplace_back(V[i], W[i]);
        graph[V[i]].emplace_back(U[i], W[i]);
    }

    rep(i, 1, n) {
        k = i;
        dp(0, 0);
        ans[i] = memo[0][0];
    }
    return ans;
}
/*
int main() {
    int N;
    assert(1 == scanf("%d", &N));

    vector<int> U(N - 1), V(N - 1), W(N - 1);
    for (int i = 0; i < N - 1; ++i) {
        assert(3 == scanf("%d %d %d", &U[i], &V[i], &W[i]));
    }

    vector<long long> closure_costs = minimum_closure_costs(N, U, V, W);
    for (int i = 0; i < static_cast<int>(closure_costs.size()); ++i) {
        if (i > 0) {
            printf(" ");
        }
        printf("%lld", closure_costs[i]);
    }
    printf("\n");
    return 0;
}*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 211 ms 524 KB Output is correct
3 Correct 248 ms 536 KB Output is correct
4 Correct 146 ms 536 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 123 ms 492 KB Output is correct
9 Correct 184 ms 460 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Runtime error 15 ms 4940 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 0 ms 332 KB Output is correct
2 Runtime error 26 ms 7700 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 5 ms 360 KB Output is correct
9 Correct 3 ms 368 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 4 ms 332 KB Output is correct
18 Correct 3 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 0 ms 344 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 5 ms 360 KB Output is correct
9 Correct 3 ms 368 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 4 ms 332 KB Output is correct
18 Correct 3 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 129 ms 460 KB Output is correct
24 Correct 367 ms 536 KB Output is correct
25 Correct 253 ms 496 KB Output is correct
26 Correct 264 ms 520 KB Output is correct
27 Correct 216 ms 580 KB Output is correct
28 Correct 148 ms 532 KB Output is correct
29 Correct 277 ms 460 KB Output is correct
30 Correct 212 ms 540 KB Output is correct
31 Correct 202 ms 460 KB Output is correct
32 Correct 157 ms 548 KB Output is correct
33 Correct 203 ms 716 KB Output is correct
34 Correct 279 ms 760 KB Output is correct
35 Correct 220 ms 720 KB Output is correct
36 Correct 219 ms 532 KB Output is correct
37 Correct 245 ms 540 KB Output is correct
38 Correct 145 ms 540 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 332 KB Output is correct
41 Correct 2 ms 332 KB Output is correct
42 Correct 4 ms 332 KB Output is correct
43 Correct 2 ms 344 KB Output is correct
44 Correct 3 ms 332 KB Output is correct
45 Correct 4 ms 332 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 3 ms 332 KB Output is correct
49 Correct 3 ms 332 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 208 ms 460 KB Output is correct
54 Correct 347 ms 520 KB Output is correct
55 Correct 183 ms 544 KB Output is correct
56 Correct 121 ms 496 KB Output is correct
57 Correct 175 ms 460 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 4 ms 332 KB Output is correct
60 Correct 3 ms 332 KB Output is correct
61 Correct 2 ms 332 KB Output is correct
62 Correct 2 ms 332 KB Output is correct
63 Correct 0 ms 332 KB Output is correct
64 Correct 323 ms 516 KB Output is correct
65 Correct 360 ms 520 KB Output is correct
66 Correct 170 ms 520 KB Output is correct
67 Correct 149 ms 460 KB Output is correct
68 Correct 166 ms 528 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 25 ms 7856 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 25 ms 7856 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 211 ms 524 KB Output is correct
3 Correct 248 ms 536 KB Output is correct
4 Correct 146 ms 536 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 123 ms 492 KB Output is correct
9 Correct 184 ms 460 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Runtime error 15 ms 4940 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -