oj.uz

Submission #429060

# Submission time Handle Problem Language Result Execution time Memory
429060 2021-06-15T17:02:43 Z Sorting Road Closures (APIO21_roads) C++17
31 / 100
 2000 ms 27588 KB 
#include "roads.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = 1e5 + 3;
const ll INF = 1e18;

int n;
vector<pair<int, int>> adj[N];
vector<ll> ans;
ll dp[N][2];//0 for removed edge

void solve(int u, int k, int par = -1){
    ll sum = 0;
    vector<ll> diff;
    for(auto [to, w]: adj[u]){
        if(to == par) continue;
        solve(to, k, u);
        if(dp[to][1] == INF){
            sum += dp[to][0] + w;
            continue;
        }
        sum += dp[to][1];
        diff.push_back(dp[to][0] + w - dp[to][1]);
    }

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

    int cnt = 0, i;
    for(i = 0; i < diff.size() && (diff[i] < 0 || diff.size() - i > k); ++i){
        sum += diff[i];
        if(sum > INF) sum = INF;
    }
    dp[u][0] = sum;
    if(!u) return;
    if(diff.size() + 1 - i > k){
        if(i == diff.size()) dp[u][1] = INF;
        else{
            dp[u][1] = sum + diff[i];
            if(dp[u][1] > INF) dp[u][1] = INF;
        }
    }
    else dp[u][1] = sum;
}

vector<long long> minimum_closure_costs(int _n, vector<int> _u, vector<int> _v, vector<int> _w) {
    n = _n;
    for(int i = 0; i < n - 1; ++i){
        adj[_u[i]].push_back({_v[i], _w[i]});
        adj[_v[i]].push_back({_u[i], _w[i]});
    }

    ans.resize(n, 0);

    int mx = 0;
    for(int i = 0; i < n; ++i)
        mx = max(mx, (int)adj[i].size());

    for(int k = 0; k <= mx; ++k){
        solve(0, k);
        ans[k] = dp[0][0];
    }

    return ans;
}

Compilation message

roads.cpp: In function 'void solve(int, int, int)':
roads.cpp:32:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(i = 0; i < diff.size() && (diff[i] < 0 || diff.size() - i > k); ++i){
      |                ~~^~~~~~~~~~~~~
roads.cpp:32:67: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   32 |     for(i = 0; i < diff.size() && (diff[i] < 0 || diff.size() - i > k); ++i){
      |                                                   ~~~~~~~~~~~~~~~~^~~
roads.cpp:38:28: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |     if(diff.size() + 1 - i > k){
      |        ~~~~~~~~~~~~~~~~~~~~^~~
roads.cpp:39:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         if(i == diff.size()) dp[u][1] = INF;
      |            ~~^~~~~~~~~~~~~~
roads.cpp:31:9: warning: unused variable 'cnt' [-Wunused-variable]
   31 |     int cnt = 0, i;
      |         ^~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 200 ms 2820 KB Output is correct
3 Correct 228 ms 2840 KB Output is correct
4 Correct 106 ms 2764 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct
6 Correct 4 ms 2636 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 94 ms 2816 KB Output is correct
9 Correct 144 ms 2844 KB Output is correct
10 Correct 3 ms 2636 KB Output is correct
11 Correct 3 ms 2636 KB Output is correct
12 Execution timed out 2037 ms 9096 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 77 ms 21452 KB Output is correct
3 Correct 88 ms 25888 KB Output is correct
4 Correct 95 ms 27368 KB Output is correct
5 Correct 90 ms 27588 KB Output is correct
6 Correct 3 ms 3020 KB Output is correct
7 Correct 4 ms 3136 KB Output is correct
8 Correct 3 ms 3020 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 54 ms 16996 KB Output is correct
13 Correct 84 ms 26672 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 75 ms 24256 KB Output is correct
16 Correct 87 ms 26604 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 3 ms 2644 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 3 ms 2636 KB Output is correct
14 Correct 3 ms 2636 KB Output is correct
15 Correct 3 ms 2652 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 3 ms 2636 KB Output is correct
20 Correct 3 ms 2636 KB Output is correct
21 Correct 2 ms 2636 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 5 ms 2764 KB Output is correct
25 Correct 4 ms 2764 KB Output is correct
26 Correct 8 ms 2860 KB Output is correct
27 Correct 33 ms 2872 KB Output is correct
28 Correct 23 ms 2864 KB Output is correct
29 Correct 5 ms 2792 KB Output is correct
30 Correct 8 ms 2764 KB Output is correct
31 Correct 9 ms 2792 KB Output is correct
32 Correct 54 ms 2856 KB Output is correct
33 Correct 3 ms 3020 KB Output is correct
34 Correct 4 ms 3020 KB Output is correct
35 Correct 4 ms 3020 KB Output is correct
36 Correct 200 ms 2840 KB Output is correct
37 Correct 226 ms 2864 KB Output is correct
38 Correct 107 ms 2860 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 2 ms 2648 KB Output is correct
41 Correct 2 ms 2636 KB Output is correct
42 Correct 2 ms 2636 KB Output is correct
43 Correct 2 ms 2636 KB Output is correct
44 Correct 2 ms 2636 KB Output is correct
45 Correct 2 ms 2636 KB Output is correct
46 Correct 3 ms 2636 KB Output is correct
47 Correct 2 ms 2636 KB Output is correct
48 Correct 2 ms 2648 KB Output is correct
49 Correct 2 ms 2636 KB Output is correct
50 Correct 4 ms 2636 KB Output is correct
51 Correct 3 ms 2636 KB Output is correct
52 Correct 3 ms 2636 KB Output is correct
53 Correct 4 ms 2764 KB Output is correct
54 Correct 5 ms 2764 KB Output is correct
55 Correct 26 ms 2764 KB Output is correct
56 Correct 103 ms 2832 KB Output is correct
57 Correct 146 ms 2844 KB Output is correct
58 Correct 2 ms 2652 KB Output is correct
59 Correct 2 ms 2636 KB Output is correct
60 Correct 2 ms 2636 KB Output is correct
61 Correct 3 ms 2636 KB Output is correct
62 Correct 4 ms 2636 KB Output is correct
63 Correct 2 ms 2656 KB Output is correct
64 Correct 4 ms 2796 KB Output is correct
65 Correct 4 ms 2792 KB Output is correct
66 Correct 7 ms 2764 KB Output is correct
67 Correct 53 ms 2844 KB Output is correct
68 Correct 6 ms 2764 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 11488 KB Output is correct
2 Correct 249 ms 12608 KB Output is correct
3 Execution timed out 2088 ms 13124 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 11488 KB Output is correct
2 Correct 249 ms 12608 KB Output is correct
3 Execution timed out 2088 ms 13124 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 200 ms 2820 KB Output is correct
3 Correct 228 ms 2840 KB Output is correct
4 Correct 106 ms 2764 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct
6 Correct 4 ms 2636 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 94 ms 2816 KB Output is correct
9 Correct 144 ms 2844 KB Output is correct
10 Correct 3 ms 2636 KB Output is correct
11 Correct 3 ms 2636 KB Output is correct
12 Execution timed out 2037 ms 9096 KB Time limit exceeded
13 Halted 0 ms 0 KB -