oj.uz

Submission #559062

# Submission time Handle Problem Language Result Execution time Memory
559062 2022-05-09T10:35:32 Z nghiass001 Road Closures (APIO21_roads) C++17
29 / 100
 2000 ms 19240 KB 
#include <bits/stdc++.h>
#define FOR(i,l,r) for(int i=(l); i<=(r); ++i)
#define REP(i,l,r) for(int i=(l); i<(r); ++i)
#define FORD(i,r,l) for(int i=(r); i>=(l); --i)
#define REPD(i,r,l) for(int i=(r)-1; i>=(l); --i)
#define pii pair<int, int>
using namespace std;
const int N = 1e5 + 5, Ns4 = 2005;
int n;
long long ans[N];
long long dpx[N], val[N];
int sz[Ns4];
long long dp[Ns4][Ns4], dd[Ns4][2];
vector<pii> S[N];

void sub1() {
    sort(S[0].begin(), S[0].end());
    REP(i, 0, n - 1) ans[n - i - 2] = ans[n - i - 1] + S[0][i].first;
}

void sub2() {
    REP(i, 0, n - 1) {
        for(auto [c, v] : S[i]) if (i + 1 == v)
            val[i + 1] = c;
    }
    REP(i, 1, n) ans[0] += val[i];
    REP(i, 2, n) {
        dpx[i] = min(dpx[i - 1] + val[i], dpx[i - 2] + val[i - 1]);
    }
    ans[1] = dpx[n - 1];
}

void DFS(int u, int p, int max_sz) {
    int now_sz = min(sz[u], max_sz);
    vector<int> Q;
    long long sum = 0, pre_sum = 0;
    for(auto [c, v] : S[u]) if (v != p) {
        DFS(v, u, max_sz);
        long long xx = dd[v][1] + c;
        long long yy = dd[v][0];
        sum += xx;
        Q.push_back(yy - xx);
    }

    sort(Q.begin(), Q.end());

    pre_sum = 1e15;
    REP(i, 0, now_sz) {
        pre_sum = sum;
        sum += min(0, Q[i]);
    }
    if (now_sz < max_sz) pre_sum = sum;
    dd[u][0] = pre_sum;
    dd[u][1] = sum;
}

void sub34() {
    REP(i, 0, n) {
        sz[i] = S[i].size() - 1;
        if (i == 0) ++sz[i];
    }
    REP(i, 0, n) {
        DFS(0, 0, i);
        ans[i] = dd[0][1];
    }
}

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    REP(i, 0, n - 1) {
        S[U[i]].emplace_back(W[i], V[i]);
        S[V[i]].emplace_back(W[i], U[i]);
    }
    if (S[0].size() == n - 1) sub1();
    else if (true) sub34();
    else if (n > 2000) sub2();
    else if (n <= 2000) sub34();

    vector<long long> ret(n);
    REP(i, 0, n) ret[i] = ans[i];
    return ret;
}

Compilation message

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:74:21: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   74 |     if (S[0].size() == n - 1) sub1();
      |         ~~~~~~~~~~~~^~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 2756 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 34 ms 7336 KB Output is correct
13 Correct 56 ms 10480 KB Output is correct
14 Correct 53 ms 9820 KB Output is correct
15 Correct 59 ms 10608 KB Output is correct
16 Correct 59 ms 10696 KB Output is correct
17 Correct 63 ms 10700 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 49 ms 9688 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 3 ms 2644 KB Output is correct
5 Correct 4 ms 2588 KB Output is correct
6 Correct 2 ms 2660 KB Output is correct
7 Correct 3 ms 2644 KB Output is correct
8 Correct 4 ms 2644 KB Output is correct
9 Correct 4 ms 2664 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 3 ms 2660 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 3 ms 2644 KB Output is correct
18 Correct 3 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2664 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 3 ms 2644 KB Output is correct
5 Correct 4 ms 2588 KB Output is correct
6 Correct 2 ms 2660 KB Output is correct
7 Correct 3 ms 2644 KB Output is correct
8 Correct 4 ms 2644 KB Output is correct
9 Correct 4 ms 2664 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 3 ms 2660 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 3 ms 2644 KB Output is correct
18 Correct 3 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2664 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 88 ms 2792 KB Output is correct
24 Correct 238 ms 2868 KB Output is correct
25 Correct 175 ms 2828 KB Output is correct
26 Correct 165 ms 2860 KB Output is correct
27 Correct 147 ms 2900 KB Output is correct
28 Correct 74 ms 2884 KB Output is correct
29 Correct 190 ms 2960 KB Output is correct
30 Correct 129 ms 2884 KB Output is correct
31 Correct 120 ms 2884 KB Output is correct
32 Correct 72 ms 2888 KB Output is correct
33 Correct 103 ms 3028 KB Output is correct
34 Correct 163 ms 3220 KB Output is correct
35 Correct 110 ms 3056 KB Output is correct
36 Correct 3 ms 2772 KB Output is correct
37 Correct 3 ms 2772 KB Output is correct
38 Correct 3 ms 2772 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2664 KB Output is correct
41 Correct 3 ms 2644 KB Output is correct
42 Correct 4 ms 2644 KB Output is correct
43 Correct 4 ms 2644 KB Output is correct
44 Correct 3 ms 2644 KB Output is correct
45 Correct 4 ms 2668 KB Output is correct
46 Correct 3 ms 2644 KB Output is correct
47 Correct 3 ms 2660 KB Output is correct
48 Correct 3 ms 2664 KB Output is correct
49 Correct 3 ms 2644 KB Output is correct
50 Correct 2 ms 2644 KB Output is correct
51 Correct 3 ms 2644 KB Output is correct
52 Correct 3 ms 2644 KB Output is correct
53 Correct 149 ms 2816 KB Output is correct
54 Correct 235 ms 2860 KB Output is correct
55 Correct 107 ms 2872 KB Output is correct
56 Correct 2 ms 2772 KB Output is correct
57 Correct 3 ms 2772 KB Output is correct
58 Correct 2 ms 2644 KB Output is correct
59 Correct 4 ms 2644 KB Output is correct
60 Correct 4 ms 2644 KB Output is correct
61 Correct 2 ms 2644 KB Output is correct
62 Correct 2 ms 2644 KB Output is correct
63 Correct 2 ms 2644 KB Output is correct
64 Correct 235 ms 2972 KB Output is correct
65 Correct 228 ms 2932 KB Output is correct
66 Correct 85 ms 2900 KB Output is correct
67 Correct 71 ms 2772 KB Output is correct
68 Correct 84 ms 2864 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2075 ms 10444 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 2075 ms 10444 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 2644 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 2756 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 34 ms 7336 KB Output is correct
13 Correct 56 ms 10480 KB Output is correct
14 Correct 53 ms 9820 KB Output is correct
15 Correct 59 ms 10608 KB Output is correct
16 Correct 59 ms 10696 KB Output is correct
17 Correct 63 ms 10700 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 49 ms 9688 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Execution timed out 2074 ms 19240 KB Time limit exceeded
22 Halted 0 ms 0 KB -