oj.uz

Submission #501925

# Submission time Handle Problem Language Result Execution time Memory
501925 2022-01-04T19:33:40 Z Victor Road Closures (APIO21_roads) C++17
12 / 100
 248 ms 73492 KB 
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize ("Ofast,inline") // O1 - O2 - O3 - Os - Ofast
// #pragma GCC optimize ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

ll n, k, vis[250001], deg[250001];
set<pll> graph[250001];
ll memo[250001][2], sums[250001];
vpll degree;
multiset<ll> pqs[250001];

void dp(ll u, ll p) {
    vis[u] = k;
    ll ans = sums[u];
    vll diff;

    trav(edge, graph[u]) if (edge.first != p) {
        ll v, w;
        tie(v, w) = edge;
        dp(v, u);
        ans += memo[v][0];
        diff.emplace_back((memo[v][1] + w) - memo[v][0]);
    }

    sort(all(diff));
    diff.emplace_back(1e17);
    memo[u][0] = memo[u][1] = 1e14;
    ll need_rem = max(0LL, deg[u] - k - (ll)sz(pqs[u]));
    vll removed, added;

    rep(i, 0, min(ll(sz(diff) - 1), need_rem)) {
        ll val = diff[i];
        added.pb(val);
        pqs[u].insert(val);
        ans += val;
    }

    if (sz(added) < need_rem)
        memo[u][1] = ans;
    else {
        // debug(u);
        rep(i, need_rem, sz(diff)) {
            memo[u][0] = min(memo[u][0], ans);
            memo[u][1] = min(memo[u][1], ans - max(0LL, *(--pqs[u].end())));

            ll val = diff[i];
            if (val < *(--pqs[u].end())) {
                added.pb(val);
                ans += val;
                auto it = (--pqs[u].end());
                removed.pb(*it);
                ans -= *it;
                pqs[u].erase(it);
                pqs[u].insert(val);

            } else if (val < 0)
                ans += val;
            else
                break;
        }
    }

    trav(val, added) pqs[u].erase(val);
    trav(val, removed) pqs[u].insert(val);

    // cout<<"u = "<<u+1<<" need_rem = "<<need_rem<<' '<<memo[u][0]<<' '<<memo[u][1]<<endl;
}

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    memset(vis, -1, sizeof(vis));
    memset(deg, 0, sizeof(deg));
    memset(sums, 0, sizeof(sums));
    degree.assign(n, {0, 0});
    vll ans(n, 0);

    rep(i, 0, n - 1) {
        graph[U[i]].emplace(V[i], W[i]);
        graph[V[i]].emplace(U[i], W[i]);

        ++degree[U[i]].first;
        degree[U[i]].second = U[i];
        ++degree[V[i]].first;
        degree[V[i]].second = V[i];

        ++deg[U[i]];
        ++deg[V[i]];
    }

    sort(all(degree));
    ll removed = 0;
    rep(i, 0, n) {
        k = i;
        while (removed < n && degree[removed].first <= k) {
            int u = degree[removed].second;
            trav(edge, graph[u]) {
                ll v, w;
                tie(v, w) = edge;
                graph[v].erase({u, w});
                sums[v] += w;
                pqs[v].insert(w);
            }
            // debug(u+1);
            ++removed;
        }

        rep(j, removed, n) {
            ll u = degree[j].second;
            while (sz(pqs[u]) > deg[u] - k) {
                auto it = (--pqs[u].end());
                sums[u] -= *it;
                pqs[u].erase(it);
            }
        }

        rep(j, removed, n) if (vis[degree[j].second] != k) {
            ll u = degree[j].second;
            dp(u, u);
            ans[k] += memo[u][0];
        }
    }
    return ans;
}

/*
int main() {
    int N;
    assert(1 == scanf("%d", &N));

    vector<int> U(N - 1), V(N - 1), W(N - 1);
    for (int i = 0; i < N - 1; ++i) {
        assert(3 == scanf("%d %d %d", &U[i], &V[i], &W[i]));
        --U[i];
        --V[i];
    }

    vector<long long> closure_costs = minimum_closure_costs(N, U, V, W);
    for (int i = 0; i < static_cast<int>(closure_costs.size()); ++i) {
        if (i > 0) {
            printf(" ");
        }
        printf("%lld", closure_costs[i]);
    }
    printf("\n");
    return 0;
}*/

Compilation message

roads.cpp: In function 'void dp(ll, ll)':
roads.cpp:66:19: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   66 |     if (sz(added) < need_rem)
      |                   ^
roads.cpp:9:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define rep(i, a, b) for (int i = (a); i < (b); ++i)
      |                                          ^
roads.cpp:70:9: note: in expansion of macro 'rep'
   70 |         rep(i, need_rem, sz(diff)) {
      |         ^~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:137:31: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  137 |             while (sz(pqs[u]) > deg[u] - k) {
      |                               ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 29672 KB Output is correct
2 Correct 16 ms 30188 KB Output is correct
3 Correct 16 ms 30156 KB Output is correct
4 Correct 15 ms 30156 KB Output is correct
5 Correct 13 ms 29644 KB Output is correct
6 Correct 13 ms 29644 KB Output is correct
7 Correct 14 ms 29648 KB Output is correct
8 Correct 16 ms 30028 KB Output is correct
9 Correct 16 ms 30156 KB Output is correct
10 Correct 14 ms 29684 KB Output is correct
11 Correct 13 ms 29592 KB Output is correct
12 Correct 117 ms 45240 KB Output is correct
13 Correct 209 ms 55376 KB Output is correct
14 Correct 191 ms 52536 KB Output is correct
15 Correct 214 ms 54920 KB Output is correct
16 Correct 234 ms 55484 KB Output is correct
17 Correct 202 ms 55320 KB Output is correct
18 Correct 14 ms 29548 KB Output is correct
19 Correct 177 ms 52940 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 29772 KB Output is correct
2 Correct 107 ms 65476 KB Output is correct
3 Correct 119 ms 70672 KB Output is correct
4 Correct 125 ms 73464 KB Output is correct
5 Correct 130 ms 73492 KB Output is correct
6 Correct 16 ms 30412 KB Output is correct
7 Correct 16 ms 30584 KB Output is correct
8 Correct 16 ms 30380 KB Output is correct
9 Correct 13 ms 29640 KB Output is correct
10 Correct 14 ms 29644 KB Output is correct
11 Correct 14 ms 29644 KB Output is correct
12 Correct 77 ms 55804 KB Output is correct
13 Correct 119 ms 73340 KB Output is correct
14 Correct 13 ms 29552 KB Output is correct
15 Correct 122 ms 69020 KB Output is correct
16 Correct 121 ms 73284 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 29636 KB Output is correct
2 Correct 13 ms 29612 KB Output is correct
3 Correct 13 ms 29648 KB Output is correct
4 Correct 14 ms 29684 KB Output is correct
5 Correct 13 ms 29684 KB Output is correct
6 Correct 13 ms 29644 KB Output is correct
7 Correct 14 ms 29704 KB Output is correct
8 Incorrect 14 ms 29680 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 29636 KB Output is correct
2 Correct 13 ms 29612 KB Output is correct
3 Correct 13 ms 29648 KB Output is correct
4 Correct 14 ms 29684 KB Output is correct
5 Correct 13 ms 29684 KB Output is correct
6 Correct 13 ms 29644 KB Output is correct
7 Correct 14 ms 29704 KB Output is correct
8 Incorrect 14 ms 29680 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 248 ms 49292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 248 ms 49292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 29672 KB Output is correct
2 Correct 16 ms 30188 KB Output is correct
3 Correct 16 ms 30156 KB Output is correct
4 Correct 15 ms 30156 KB Output is correct
5 Correct 13 ms 29644 KB Output is correct
6 Correct 13 ms 29644 KB Output is correct
7 Correct 14 ms 29648 KB Output is correct
8 Correct 16 ms 30028 KB Output is correct
9 Correct 16 ms 30156 KB Output is correct
10 Correct 14 ms 29684 KB Output is correct
11 Correct 13 ms 29592 KB Output is correct
12 Correct 117 ms 45240 KB Output is correct
13 Correct 209 ms 55376 KB Output is correct
14 Correct 191 ms 52536 KB Output is correct
15 Correct 214 ms 54920 KB Output is correct
16 Correct 234 ms 55484 KB Output is correct
17 Correct 202 ms 55320 KB Output is correct
18 Correct 14 ms 29548 KB Output is correct
19 Correct 177 ms 52940 KB Output is correct
20 Correct 15 ms 29772 KB Output is correct
21 Correct 107 ms 65476 KB Output is correct
22 Correct 119 ms 70672 KB Output is correct
23 Correct 125 ms 73464 KB Output is correct
24 Correct 130 ms 73492 KB Output is correct
25 Correct 16 ms 30412 KB Output is correct
26 Correct 16 ms 30584 KB Output is correct
27 Correct 16 ms 30380 KB Output is correct
28 Correct 13 ms 29640 KB Output is correct
29 Correct 14 ms 29644 KB Output is correct
30 Correct 14 ms 29644 KB Output is correct
31 Correct 77 ms 55804 KB Output is correct
32 Correct 119 ms 73340 KB Output is correct
33 Correct 13 ms 29552 KB Output is correct
34 Correct 122 ms 69020 KB Output is correct
35 Correct 121 ms 73284 KB Output is correct
36 Correct 13 ms 29636 KB Output is correct
37 Correct 13 ms 29612 KB Output is correct
38 Correct 13 ms 29648 KB Output is correct
39 Correct 14 ms 29684 KB Output is correct
40 Correct 13 ms 29684 KB Output is correct
41 Correct 13 ms 29644 KB Output is correct
42 Correct 14 ms 29704 KB Output is correct
43 Incorrect 14 ms 29680 KB Output isn't correct
44 Halted 0 ms 0 KB -