oj.uz

Submission #982035

# Submission time Handle Problem Language Result Execution time Memory
982035 2024-05-13T18:15:12 Z steveonalex Road Closures (APIO21_roads) C++17
36 / 100
 2000 ms 26704 KB 
#include <bits/stdc++.h>
#include "roads.h"

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)

// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1e5 + 69;
const ll INF = 1e18 + 69;
int n, k;
vector<pair<int, int>> graph[N];

namespace Sub1{
    bool check(){
        return graph[0].size() == n-1;
    }

    vector<ll> solve(){
        vector<ll> ans;
        for(pair<int, int> j: graph[0]) ans.push_back(j.second);
        ans.push_back(0);
        sort(ALL(ans));
        for(int i = 1; i < ans.size(); ++i) ans[i] += ans[i-1];
        reverse(ALL(ans));
        return ans;
    }
}

namespace Sub3{
    ll dp[N][2];

    void go(int u, int p){
        dp[u][0] = dp[u][1] = 0;
        vector<ll> diff;
        for(pair<int, int> v: graph[u]) if (v.first != p){
            go(v.first, u);
            dp[u][0] += dp[v.first][0];
            dp[u][1] += dp[v.first][0];
            diff.push_back(dp[v.first][1] + v.second - dp[v.first][0]);
        }
        sort(ALL(diff));
        for(int i = 0; i< diff.size(); ++i){
            if (diff[i] >= 0 && diff.size() - i <= k) break;
            dp[u][1] += diff[i];
        }
        for(int i = 0; i< diff.size(); ++i){
            if (diff[i] >= 0 && diff.size() - i < k) break;
            dp[u][0] += diff[i];
        }
    }

    vector<ll> solve(){
        vector<ll> ans(n);
        for(int i = 0; i < n; ++i) for(pair<int, int> j: graph[i]) if (j.first > i) ans[0] += j.second;
        for(int i = 1; i<n; ++i){   
            k = i;
            go(0, 0);
            ans[i] = dp[0][1];
            if (ans[i] == 0) break;
        }
        return ans;
    }
}

vector<ll> minimum_closure_costs(int _n, vector<int> U, vector<int> V, vector<int> W) {
    n = _n;

    for(int i= 0; i<U.size(); ++i){
        int u = U[i], v = V[i], w = W[i];
        graph[u].push_back({v, w});
        graph[v].push_back({u, w});
    }

    if (Sub1::check()) return Sub1::solve();
    return Sub3::solve();

}


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int n; cin >> n;
//     vector<int> U, V, W;
//     for(int i = 1; i<n; ++i){
//         int u, v, w; cin >> u >> v >> w;
//         U.push_back(u); V.push_back(v); W.push_back(w);
//     }

//     vector<ll> ans = minimum_closure_costs(n, U, V, W);
//     printArr(ans);

//     return 0;
// }

Compilation message

roads.cpp: In function 'bool Sub1::check()':
roads.cpp:54:32: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |         return graph[0].size() == n-1;
      |                ~~~~~~~~~~~~~~~~^~~~~~
roads.cpp: In function 'std::vector<long long int> Sub1::solve()':
roads.cpp:62:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         for(int i = 1; i < ans.size(); ++i) ans[i] += ans[i-1];
      |                        ~~^~~~~~~~~~~~
roads.cpp: In function 'void Sub3::go(int, int)':
roads.cpp:81:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for(int i = 0; i< diff.size(); ++i){
      |                        ~^~~~~~~~~~~~~
roads.cpp:82:49: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   82 |             if (diff[i] >= 0 && diff.size() - i <= k) break;
      |                                 ~~~~~~~~~~~~~~~~^~~~
roads.cpp:85:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |         for(int i = 0; i< diff.size(); ++i){
      |                        ~^~~~~~~~~~~~~
roads.cpp:86:49: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   86 |             if (diff[i] >= 0 && diff.size() - i < k) break;
      |                                 ~~~~~~~~~~~~~~~~^~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:107:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |     for(int i= 0; i<U.size(); ++i){
      |                   ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4188 KB Output is correct
2 Correct 2 ms 4188 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 2 ms 4188 KB Output is correct
5 Correct 1 ms 4188 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 4200 KB Output is correct
8 Correct 2 ms 4188 KB Output is correct
9 Correct 2 ms 4188 KB Output is correct
10 Correct 1 ms 4188 KB Output is correct
11 Correct 2 ms 4044 KB Output is correct
12 Correct 26 ms 9168 KB Output is correct
13 Correct 39 ms 12776 KB Output is correct
14 Correct 45 ms 12784 KB Output is correct
15 Correct 48 ms 13504 KB Output is correct
16 Correct 56 ms 13520 KB Output is correct
17 Correct 42 ms 13764 KB Output is correct
18 Correct 1 ms 4184 KB Output is correct
19 Correct 35 ms 12120 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4188 KB Output is correct
2 Correct 47 ms 22952 KB Output is correct
3 Correct 56 ms 25172 KB Output is correct
4 Correct 63 ms 26588 KB Output is correct
5 Correct 55 ms 26704 KB Output is correct
6 Correct 2 ms 4440 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4440 KB Output is correct
9 Correct 2 ms 4188 KB Output is correct
10 Correct 2 ms 4188 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 33 ms 17248 KB Output is correct
13 Correct 60 ms 25936 KB Output is correct
14 Correct 1 ms 3932 KB Output is correct
15 Correct 48 ms 23660 KB Output is correct
16 Correct 54 ms 26048 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 2 ms 4188 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 2 ms 4040 KB Output is correct
5 Correct 2 ms 4188 KB Output is correct
6 Correct 1 ms 4188 KB Output is correct
7 Correct 1 ms 4184 KB Output is correct
8 Correct 2 ms 4188 KB Output is correct
9 Correct 2 ms 4188 KB Output is correct
10 Correct 2 ms 4440 KB Output is correct
11 Correct 2 ms 4188 KB Output is correct
12 Correct 1 ms 4188 KB Output is correct
13 Correct 1 ms 4020 KB Output is correct
14 Correct 1 ms 4184 KB Output is correct
15 Correct 2 ms 4188 KB Output is correct
16 Correct 2 ms 4188 KB Output is correct
17 Correct 2 ms 4188 KB Output is correct
18 Correct 2 ms 4188 KB Output is correct
19 Correct 1 ms 4184 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 2 ms 3932 KB Output is correct
2 Correct 2 ms 4188 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 2 ms 4040 KB Output is correct
5 Correct 2 ms 4188 KB Output is correct
6 Correct 1 ms 4188 KB Output is correct
7 Correct 1 ms 4184 KB Output is correct
8 Correct 2 ms 4188 KB Output is correct
9 Correct 2 ms 4188 KB Output is correct
10 Correct 2 ms 4440 KB Output is correct
11 Correct 2 ms 4188 KB Output is correct
12 Correct 1 ms 4188 KB Output is correct
13 Correct 1 ms 4020 KB Output is correct
14 Correct 1 ms 4184 KB Output is correct
15 Correct 2 ms 4188 KB Output is correct
16 Correct 2 ms 4188 KB Output is correct
17 Correct 2 ms 4188 KB Output is correct
18 Correct 2 ms 4188 KB Output is correct
19 Correct 1 ms 4184 KB Output is correct
20 Correct 2 ms 4188 KB Output is correct
21 Correct 1 ms 3932 KB Output is correct
22 Correct 2 ms 4184 KB Output is correct
23 Correct 2 ms 4188 KB Output is correct
24 Correct 3 ms 4444 KB Output is correct
25 Correct 3 ms 4220 KB Output is correct
26 Correct 5 ms 4184 KB Output is correct
27 Correct 23 ms 4188 KB Output is correct
28 Correct 13 ms 4188 KB Output is correct
29 Correct 3 ms 4236 KB Output is correct
30 Correct 5 ms 4196 KB Output is correct
31 Correct 5 ms 4188 KB Output is correct
32 Correct 35 ms 4388 KB Output is correct
33 Correct 2 ms 4448 KB Output is correct
34 Correct 3 ms 4656 KB Output is correct
35 Correct 2 ms 4444 KB Output is correct
36 Correct 2 ms 4188 KB Output is correct
37 Correct 2 ms 4188 KB Output is correct
38 Correct 3 ms 4396 KB Output is correct
39 Correct 1 ms 4188 KB Output is correct
40 Correct 1 ms 4188 KB Output is correct
41 Correct 2 ms 4108 KB Output is correct
42 Correct 2 ms 4188 KB Output is correct
43 Correct 2 ms 4108 KB Output is correct
44 Correct 1 ms 4188 KB Output is correct
45 Correct 2 ms 4188 KB Output is correct
46 Correct 2 ms 4188 KB Output is correct
47 Correct 2 ms 4184 KB Output is correct
48 Correct 1 ms 4188 KB Output is correct
49 Correct 2 ms 4188 KB Output is correct
50 Correct 2 ms 4188 KB Output is correct
51 Correct 2 ms 4184 KB Output is correct
52 Correct 1 ms 4188 KB Output is correct
53 Correct 3 ms 4188 KB Output is correct
54 Correct 3 ms 4160 KB Output is correct
55 Correct 18 ms 4440 KB Output is correct
56 Correct 2 ms 4196 KB Output is correct
57 Correct 2 ms 4188 KB Output is correct
58 Correct 1 ms 4188 KB Output is correct
59 Correct 2 ms 4184 KB Output is correct
60 Correct 2 ms 4180 KB Output is correct
61 Correct 2 ms 4188 KB Output is correct
62 Correct 2 ms 4188 KB Output is correct
63 Correct 2 ms 4188 KB Output is correct
64 Correct 3 ms 4188 KB Output is correct
65 Correct 3 ms 4384 KB Output is correct
66 Correct 4 ms 4188 KB Output is correct
67 Correct 32 ms 4188 KB Output is correct
68 Correct 4 ms 4184 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 12124 KB Output is correct
2 Correct 130 ms 11956 KB Output is correct
3 Correct 913 ms 13288 KB Output is correct
4 Correct 178 ms 12564 KB Output is correct
5 Correct 1165 ms 13276 KB Output is correct
6 Execution timed out 2064 ms 12788 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 12124 KB Output is correct
2 Correct 130 ms 11956 KB Output is correct
3 Correct 913 ms 13288 KB Output is correct
4 Correct 178 ms 12564 KB Output is correct
5 Correct 1165 ms 13276 KB Output is correct
6 Execution timed out 2064 ms 12788 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4188 KB Output is correct
2 Correct 2 ms 4188 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 2 ms 4188 KB Output is correct
5 Correct 1 ms 4188 KB Output is correct
6 Correct 2 ms 4188 KB Output is correct
7 Correct 2 ms 4200 KB Output is correct
8 Correct 2 ms 4188 KB Output is correct
9 Correct 2 ms 4188 KB Output is correct
10 Correct 1 ms 4188 KB Output is correct
11 Correct 2 ms 4044 KB Output is correct
12 Correct 26 ms 9168 KB Output is correct
13 Correct 39 ms 12776 KB Output is correct
14 Correct 45 ms 12784 KB Output is correct
15 Correct 48 ms 13504 KB Output is correct
16 Correct 56 ms 13520 KB Output is correct
17 Correct 42 ms 13764 KB Output is correct
18 Correct 1 ms 4184 KB Output is correct
19 Correct 35 ms 12120 KB Output is correct
20 Correct 1 ms 4188 KB Output is correct
21 Correct 47 ms 22952 KB Output is correct
22 Correct 56 ms 25172 KB Output is correct
23 Correct 63 ms 26588 KB Output is correct
24 Correct 55 ms 26704 KB Output is correct
25 Correct 2 ms 4440 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct
27 Correct 2 ms 4440 KB Output is correct
28 Correct 2 ms 4188 KB Output is correct
29 Correct 2 ms 4188 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 33 ms 17248 KB Output is correct
32 Correct 60 ms 25936 KB Output is correct
33 Correct 1 ms 3932 KB Output is correct
34 Correct 48 ms 23660 KB Output is correct
35 Correct 54 ms 26048 KB Output is correct
36 Correct 2 ms 3932 KB Output is correct
37 Correct 2 ms 4188 KB Output is correct
38 Correct 2 ms 3932 KB Output is correct
39 Correct 2 ms 4040 KB Output is correct
40 Correct 2 ms 4188 KB Output is correct
41 Correct 1 ms 4188 KB Output is correct
42 Correct 1 ms 4184 KB Output is correct
43 Correct 2 ms 4188 KB Output is correct
44 Correct 2 ms 4188 KB Output is correct
45 Correct 2 ms 4440 KB Output is correct
46 Correct 2 ms 4188 KB Output is correct
47 Correct 1 ms 4188 KB Output is correct
48 Correct 1 ms 4020 KB Output is correct
49 Correct 1 ms 4184 KB Output is correct
50 Correct 2 ms 4188 KB Output is correct
51 Correct 2 ms 4188 KB Output is correct
52 Correct 2 ms 4188 KB Output is correct
53 Correct 2 ms 4188 KB Output is correct
54 Correct 1 ms 4184 KB Output is correct
55 Correct 2 ms 4188 KB Output is correct
56 Correct 1 ms 3932 KB Output is correct
57 Correct 2 ms 4184 KB Output is correct
58 Correct 2 ms 4188 KB Output is correct
59 Correct 3 ms 4444 KB Output is correct
60 Correct 3 ms 4220 KB Output is correct
61 Correct 5 ms 4184 KB Output is correct
62 Correct 23 ms 4188 KB Output is correct
63 Correct 13 ms 4188 KB Output is correct
64 Correct 3 ms 4236 KB Output is correct
65 Correct 5 ms 4196 KB Output is correct
66 Correct 5 ms 4188 KB Output is correct
67 Correct 35 ms 4388 KB Output is correct
68 Correct 2 ms 4448 KB Output is correct
69 Correct 3 ms 4656 KB Output is correct
70 Correct 2 ms 4444 KB Output is correct
71 Correct 2 ms 4188 KB Output is correct
72 Correct 2 ms 4188 KB Output is correct
73 Correct 3 ms 4396 KB Output is correct
74 Correct 1 ms 4188 KB Output is correct
75 Correct 1 ms 4188 KB Output is correct
76 Correct 2 ms 4108 KB Output is correct
77 Correct 2 ms 4188 KB Output is correct
78 Correct 2 ms 4108 KB Output is correct
79 Correct 1 ms 4188 KB Output is correct
80 Correct 2 ms 4188 KB Output is correct
81 Correct 2 ms 4188 KB Output is correct
82 Correct 2 ms 4184 KB Output is correct
83 Correct 1 ms 4188 KB Output is correct
84 Correct 2 ms 4188 KB Output is correct
85 Correct 2 ms 4188 KB Output is correct
86 Correct 2 ms 4184 KB Output is correct
87 Correct 1 ms 4188 KB Output is correct
88 Correct 3 ms 4188 KB Output is correct
89 Correct 3 ms 4160 KB Output is correct
90 Correct 18 ms 4440 KB Output is correct
91 Correct 2 ms 4196 KB Output is correct
92 Correct 2 ms 4188 KB Output is correct
93 Correct 1 ms 4188 KB Output is correct
94 Correct 2 ms 4184 KB Output is correct
95 Correct 2 ms 4180 KB Output is correct
96 Correct 2 ms 4188 KB Output is correct
97 Correct 2 ms 4188 KB Output is correct
98 Correct 2 ms 4188 KB Output is correct
99 Correct 3 ms 4188 KB Output is correct
100 Correct 3 ms 4384 KB Output is correct
101 Correct 4 ms 4188 KB Output is correct
102 Correct 32 ms 4188 KB Output is correct
103 Correct 4 ms 4184 KB Output is correct
104 Correct 107 ms 12124 KB Output is correct
105 Correct 130 ms 11956 KB Output is correct
106 Correct 913 ms 13288 KB Output is correct
107 Correct 178 ms 12564 KB Output is correct
108 Correct 1165 ms 13276 KB Output is correct
109 Execution timed out 2064 ms 12788 KB Time limit exceeded
110 Halted 0 ms 0 KB -