oj.uz

Submission #559063

# Submission time Handle Problem Language Result Execution time Memory
559063 2022-05-09T10:36:25 Z nghiass001 Road Closures (APIO21_roads) C++17
36 / 100
 2000 ms 23384 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];
        if (ans[i] == 0) break;
    }
}

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:75: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]
   75 |     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 3 ms 2808 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 2 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 3 ms 2692 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 43 ms 7340 KB Output is correct
13 Correct 58 ms 10408 KB Output is correct
14 Correct 56 ms 9820 KB Output is correct
15 Correct 60 ms 10588 KB Output is correct
16 Correct 61 ms 10704 KB Output is correct
17 Correct 59 ms 10780 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 51 ms 9740 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 66 ms 19788 KB Output is correct
3 Correct 73 ms 22060 KB Output is correct
4 Correct 79 ms 23372 KB Output is correct
5 Correct 75 ms 23288 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 3 ms 3028 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 39 ms 15020 KB Output is correct
13 Correct 70 ms 23384 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 60 ms 21292 KB Output is correct
16 Correct 75 ms 23300 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 3 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 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 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2648 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 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 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 3 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 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 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2648 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 3 ms 2772 KB Output is correct
24 Correct 3 ms 2864 KB Output is correct
25 Correct 3 ms 2772 KB Output is correct
26 Correct 7 ms 2772 KB Output is correct
27 Correct 28 ms 2836 KB Output is correct
28 Correct 14 ms 2772 KB Output is correct
29 Correct 3 ms 2772 KB Output is correct
30 Correct 5 ms 2772 KB Output is correct
31 Correct 9 ms 2772 KB Output is correct
32 Correct 40 ms 2848 KB Output is correct
33 Correct 4 ms 3016 KB Output is correct
34 Correct 3 ms 3028 KB Output is correct
35 Correct 3 ms 3028 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 2644 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 1 ms 2644 KB Output is correct
48 Correct 2 ms 2644 KB Output is correct
49 Correct 1 ms 2644 KB Output is correct
50 Correct 2 ms 2644 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 2 ms 2644 KB Output is correct
53 Correct 3 ms 2772 KB Output is correct
54 Correct 3 ms 2772 KB Output is correct
55 Correct 21 ms 2860 KB Output is correct
56 Correct 3 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 3 ms 2644 KB Output is correct
60 Correct 2 ms 2644 KB Output is correct
61 Correct 1 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 3 ms 2772 KB Output is correct
65 Correct 3 ms 2772 KB Output is correct
66 Correct 7 ms 2772 KB Output is correct
67 Correct 38 ms 2856 KB Output is correct
68 Correct 5 ms 2772 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 11148 KB Output is correct
2 Correct 213 ms 12364 KB Output is correct
3 Execution timed out 2081 ms 12648 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 11148 KB Output is correct
2 Correct 213 ms 12364 KB Output is correct
3 Execution timed out 2081 ms 12648 KB Time limit exceeded
4 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 3 ms 2808 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 2 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 3 ms 2692 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 43 ms 7340 KB Output is correct
13 Correct 58 ms 10408 KB Output is correct
14 Correct 56 ms 9820 KB Output is correct
15 Correct 60 ms 10588 KB Output is correct
16 Correct 61 ms 10704 KB Output is correct
17 Correct 59 ms 10780 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 51 ms 9740 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 66 ms 19788 KB Output is correct
22 Correct 73 ms 22060 KB Output is correct
23 Correct 79 ms 23372 KB Output is correct
24 Correct 75 ms 23288 KB Output is correct
25 Correct 2 ms 3028 KB Output is correct
26 Correct 3 ms 3028 KB Output is correct
27 Correct 3 ms 3028 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 39 ms 15020 KB Output is correct
32 Correct 70 ms 23384 KB Output is correct
33 Correct 1 ms 2644 KB Output is correct
34 Correct 60 ms 21292 KB Output is correct
35 Correct 75 ms 23300 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 3 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 2 ms 2644 KB Output is correct
48 Correct 2 ms 2644 KB Output is correct
49 Correct 2 ms 2644 KB Output is correct
50 Correct 2 ms 2644 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 2 ms 2644 KB Output is correct
53 Correct 2 ms 2644 KB Output is correct
54 Correct 2 ms 2648 KB Output is correct
55 Correct 2 ms 2644 KB Output is correct
56 Correct 2 ms 2644 KB Output is correct
57 Correct 1 ms 2644 KB Output is correct
58 Correct 3 ms 2772 KB Output is correct
59 Correct 3 ms 2864 KB Output is correct
60 Correct 3 ms 2772 KB Output is correct
61 Correct 7 ms 2772 KB Output is correct
62 Correct 28 ms 2836 KB Output is correct
63 Correct 14 ms 2772 KB Output is correct
64 Correct 3 ms 2772 KB Output is correct
65 Correct 5 ms 2772 KB Output is correct
66 Correct 9 ms 2772 KB Output is correct
67 Correct 40 ms 2848 KB Output is correct
68 Correct 4 ms 3016 KB Output is correct
69 Correct 3 ms 3028 KB Output is correct
70 Correct 3 ms 3028 KB Output is correct
71 Correct 3 ms 2772 KB Output is correct
72 Correct 3 ms 2772 KB Output is correct
73 Correct 3 ms 2772 KB Output is correct
74 Correct 2 ms 2644 KB Output is correct
75 Correct 2 ms 2644 KB Output is correct
76 Correct 2 ms 2644 KB Output is correct
77 Correct 2 ms 2644 KB Output is correct
78 Correct 2 ms 2644 KB Output is correct
79 Correct 2 ms 2644 KB Output is correct
80 Correct 2 ms 2644 KB Output is correct
81 Correct 2 ms 2644 KB Output is correct
82 Correct 1 ms 2644 KB Output is correct
83 Correct 2 ms 2644 KB Output is correct
84 Correct 1 ms 2644 KB Output is correct
85 Correct 2 ms 2644 KB Output is correct
86 Correct 2 ms 2644 KB Output is correct
87 Correct 2 ms 2644 KB Output is correct
88 Correct 3 ms 2772 KB Output is correct
89 Correct 3 ms 2772 KB Output is correct
90 Correct 21 ms 2860 KB Output is correct
91 Correct 3 ms 2772 KB Output is correct
92 Correct 3 ms 2772 KB Output is correct
93 Correct 2 ms 2644 KB Output is correct
94 Correct 3 ms 2644 KB Output is correct
95 Correct 2 ms 2644 KB Output is correct
96 Correct 1 ms 2644 KB Output is correct
97 Correct 2 ms 2644 KB Output is correct
98 Correct 2 ms 2644 KB Output is correct
99 Correct 3 ms 2772 KB Output is correct
100 Correct 3 ms 2772 KB Output is correct
101 Correct 7 ms 2772 KB Output is correct
102 Correct 38 ms 2856 KB Output is correct
103 Correct 5 ms 2772 KB Output is correct
104 Correct 204 ms 11148 KB Output is correct
105 Correct 213 ms 12364 KB Output is correct
106 Execution timed out 2081 ms 12648 KB Time limit exceeded
107 Halted 0 ms 0 KB -