oj.uz

Submission #981808

# Submission time Handle Problem Language Result Execution time Memory
981808 2024-05-13T15:15:10 Z Unforgettablepl Road Closures (APIO21_roads) C++17
24 / 100
 2000 ms 24108 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

vector<pair<int,int>> adj[100001];
int DP[100001][2];
int k;

void dfs(int x,int p,int w){
    DP[x][1] = w;
    DP[x][0] = 0;
    int sub = 0;
    vector<int> options;
    for(auto&i:adj[x])if(i.first!=p){
            dfs(i.first,x,i.second);
            sub++;
            DP[x][0]+=DP[i.first][0];
            options.emplace_back(DP[i.first][1]-DP[i.first][0]);
        }
    sort(options.begin(),options.end());
    DP[x][1]+=DP[x][0];
    for(int i=0;i<max(0ll,sub-k+1);i++)DP[x][0]+=options[i];
    for(int i=0;i<max(0ll,sub-k);i++)DP[x][1]+=options[i];
    for(int i=max(0ll,sub-k+1);i<options.size();i++)if(options[i]<0ll)DP[x][0]+=options[i];
    for(int i=max(0ll,sub-k);i<options.size();i++)if(options[i]<0ll)DP[x][1]+=options[i];
}

std::vector<int> minimum_closure_costs(int32_t N, std::vector<int32_t > U,
                                             std::vector<int32_t > V,
                                             std::vector<int32_t > W) {
    int base = 0;
    for(int i=0;i<N-1;i++){
        adj[U[i]].emplace_back(V[i],W[i]);
        adj[V[i]].emplace_back(U[i],W[i]);
        base+=W[i];
    }
    vector<int> ans(N);
    ans[0] = base;
    for(int i=1;i<N;i++){
        k = i;
        dfs(0,-1,0);
        ans[i] = DP[0][1];
    }
    return ans;
}

Compilation message

roads.cpp: In function 'void dfs(long long int, long long int, long long int)':
roads.cpp:25:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(int i=max(0ll,sub-k+1);i<options.size();i++)if(options[i]<0ll)DP[x][0]+=options[i];
      |                                ~^~~~~~~~~~~~~~~
roads.cpp:26:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i=max(0ll,sub-k);i<options.size();i++)if(options[i]<0ll)DP[x][1]+=options[i];
      |                              ~^~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3928 KB Output is correct
2 Correct 159 ms 4416 KB Output is correct
3 Correct 166 ms 4424 KB Output is correct
4 Correct 65 ms 4404 KB Output is correct
5 Correct 2 ms 4188 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 4188 KB Output is correct
8 Correct 53 ms 4360 KB Output is correct
9 Correct 88 ms 4388 KB Output is correct
10 Correct 2 ms 4188 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Execution timed out 2087 ms 10816 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 1 ms 3932 KB Output is correct
4 Correct 2 ms 4188 KB Output is correct
5 Correct 4 ms 4188 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 4188 KB Output is correct
8 Correct 3 ms 4184 KB Output is correct
9 Correct 3 ms 4188 KB Output is correct
10 Correct 2 ms 4188 KB Output is correct
11 Correct 2 ms 4188 KB Output is correct
12 Correct 2 ms 4188 KB Output is correct
13 Correct 2 ms 4188 KB Output is correct
14 Correct 2 ms 4188 KB Output is correct
15 Correct 2 ms 4188 KB Output is correct
16 Correct 2 ms 4440 KB Output is correct
17 Correct 3 ms 4188 KB Output is correct
18 Correct 2 ms 4188 KB Output is correct
19 Correct 2 ms 4176 KB Output is correct
20 Correct 2 ms 4188 KB Output is correct
21 Correct 1 ms 3932 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 1 ms 3932 KB Output is correct
4 Correct 2 ms 4188 KB Output is correct
5 Correct 4 ms 4188 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 4188 KB Output is correct
8 Correct 3 ms 4184 KB Output is correct
9 Correct 3 ms 4188 KB Output is correct
10 Correct 2 ms 4188 KB Output is correct
11 Correct 2 ms 4188 KB Output is correct
12 Correct 2 ms 4188 KB Output is correct
13 Correct 2 ms 4188 KB Output is correct
14 Correct 2 ms 4188 KB Output is correct
15 Correct 2 ms 4188 KB Output is correct
16 Correct 2 ms 4440 KB Output is correct
17 Correct 3 ms 4188 KB Output is correct
18 Correct 2 ms 4188 KB Output is correct
19 Correct 2 ms 4176 KB Output is correct
20 Correct 2 ms 4188 KB Output is correct
21 Correct 1 ms 3932 KB Output is correct
22 Correct 1 ms 3932 KB Output is correct
23 Correct 64 ms 4188 KB Output is correct
24 Correct 184 ms 4428 KB Output is correct
25 Correct 124 ms 4356 KB Output is correct
26 Correct 135 ms 4380 KB Output is correct
27 Correct 119 ms 4440 KB Output is correct
28 Correct 65 ms 4184 KB Output is correct
29 Correct 143 ms 4188 KB Output is correct
30 Correct 114 ms 4404 KB Output is correct
31 Correct 92 ms 4184 KB Output is correct
32 Correct 64 ms 4188 KB Output is correct
33 Correct 90 ms 4444 KB Output is correct
34 Correct 121 ms 4660 KB Output is correct
35 Correct 97 ms 4440 KB Output is correct
36 Correct 139 ms 4184 KB Output is correct
37 Correct 168 ms 4188 KB Output is correct
38 Correct 64 ms 4432 KB Output is correct
39 Correct 2 ms 3932 KB Output is correct
40 Correct 1 ms 3932 KB Output is correct
41 Correct 2 ms 4188 KB Output is correct
42 Correct 3 ms 4188 KB Output is correct
43 Correct 2 ms 4188 KB Output is correct
44 Correct 2 ms 4188 KB Output is correct
45 Correct 3 ms 4188 KB Output is correct
46 Correct 2 ms 4188 KB Output is correct
47 Correct 3 ms 4188 KB Output is correct
48 Correct 2 ms 4188 KB Output is correct
49 Correct 2 ms 4188 KB Output is correct
50 Correct 2 ms 4180 KB Output is correct
51 Correct 2 ms 4188 KB Output is correct
52 Correct 2 ms 4188 KB Output is correct
53 Correct 106 ms 4192 KB Output is correct
54 Correct 180 ms 4404 KB Output is correct
55 Correct 92 ms 4188 KB Output is correct
56 Correct 54 ms 4188 KB Output is correct
57 Correct 83 ms 4392 KB Output is correct
58 Correct 2 ms 4188 KB Output is correct
59 Correct 3 ms 4184 KB Output is correct
60 Correct 3 ms 4188 KB Output is correct
61 Correct 3 ms 4188 KB Output is correct
62 Correct 2 ms 4188 KB Output is correct
63 Correct 1 ms 3932 KB Output is correct
64 Correct 168 ms 4188 KB Output is correct
65 Correct 175 ms 4388 KB Output is correct
66 Correct 74 ms 4388 KB Output is correct
67 Correct 66 ms 4188 KB Output is correct
68 Correct 72 ms 4188 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2065 ms 15432 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 2065 ms 15432 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3928 KB Output is correct
2 Correct 159 ms 4416 KB Output is correct
3 Correct 166 ms 4424 KB Output is correct
4 Correct 65 ms 4404 KB Output is correct
5 Correct 2 ms 4188 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 4188 KB Output is correct
8 Correct 53 ms 4360 KB Output is correct
9 Correct 88 ms 4388 KB Output is correct
10 Correct 2 ms 4188 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Execution timed out 2087 ms 10816 KB Time limit exceeded
13 Halted 0 ms 0 KB -