oj.uz

Submission #563268

# Submission time Handle Problem Language Result Execution time Memory
563268 2022-05-16T16:53:18 Z ngpin04 Road Closures (APIO21_roads) C++14
49 / 100
 593 ms 290020 KB 
#include <bits/stdc++.h>
#include "roads.h"
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}
const int N = 1e5 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

struct trie {
    struct node {
        int cnt; long long tot;
        int ptr[2];
        node (int _cnt = 0, long long _tot = 0) {
            cnt = _cnt;
            tot = _tot;
            for (int i = 0; i < 2; i++)
                ptr[i] = 0;
        }
    };

    bool neg;
    int num, sz;
    vector <node> tree;

    #define ptr(cur, i) tree[cur].ptr[i]
    #define cnt(cur) tree[cur].cnt
    #define tot(cur) tree[cur].tot

    trie(int _neg = 0) {
        neg = _neg;
        num = 0;
        sz = 0;
        tree.emplace_back();
    }

    void add(long long x, int val) {
        // cerr << "trie add " << x << " " << val << "\n";
        sz += val;
        x = abs(x);
        int cur = 0;
        for (int i = 60; i >= 0; i--) {
            int v = getbit(x, i);
            if (!ptr(cur, v)) {
                ptr(cur, v) = ++num;
                tree.emplace_back();
            }
            cur = ptr(cur, v);
            cnt(cur) += val;
            tot(cur) += (val > 0) ? x : -x;
        }
    }

    long long getkth(int k) {
        // cerr << "query " << k << "\n";
        long long res = 0;
        long long tmp = 0;
        int cur = 0;
        for (int i = 60; k > 0 && i >= 0; i--) 
        for (int v = 0; v < 2; v++) {
            int p = ptr(cur, v ^ neg);
            // cerr << cur << " " << (v ^ neg) << " " << p << "\n";
            if (cnt(p) > k) {
                if (v ^ neg)
                    tmp |= bit(i);
                cur = p;
                break;
            }
            k -= cnt(p);
            res += tot(p);
        }
        // cerr << k << "\n";

        if (k > 0)
            res += k * tmp;
        
        if (neg)
            res = -res;

        return res;
    }
};

vector <int> adj[N];
vector <int> deg[N];
vector <int> g[N];

trie neg[N];

long long dp[N][2];

int val[N];
int par[N];
int fr[N];
int to[N];
int h[N];
int w[N];
int n;

bool vis[N];
bool flag[N];

void dfs(int u, int p = -1) {
    par[u] = p;
    for (int i : adj[u]) {
        int v = fr[i] ^ to[i] ^ u;
        if (v == p)
            continue;
        h[v] = h[u] + 1;
        dfs(v, u);
    }
}

void addvalue(int v, long long x, int val) {
    if (x < 0)
        neg[v].add(x, val);
}

void add(int u) {
    for (int i : adj[u]) {
        int v = fr[i] ^ to[i] ^ u;
        if (!flag[v]) {
            val[u] += w[i];
            addvalue(u, -w[i], 1);
            continue;
        }

        val[v] -= w[i];
        addvalue(v, -w[i], -1);

        if (v == par[u])
            g[v].push_back(i);
        else
            g[u].push_back(i);
    }

    flag[u] = true;
}

void solve(int u, int k) {
    long long tot = val[u];

    for (int i : g[u]) {
        int v = fr[i] ^ to[i] ^ u;
        solve(v, k);
        tot += dp[v][1] + w[i];
        addvalue(u, dp[v][0] - (dp[v][1] + w[i]), 1);
    }

    int cntneg = neg[u].sz;
    // cerr << tot << "\n";
    // cerr << cntneg << "\n";
    if (cntneg >= k) {
        dp[u][0] = neg[u].getkth(k - 1);
        dp[u][1] = neg[u].getkth(k);    
        // cerr << dp[u][0] << " " << dp[u][1] << "\n";
    } else 
        dp[u][0] = dp[u][1] = neg[u].getkth(cntneg);   

    dp[u][0] += tot;
    dp[u][1] += tot;

    for (int i : g[u]) {
        int v = fr[i] ^ to[i] ^ u;
        addvalue(u, dp[v][0] - (dp[v][1] + w[i]), -1);
    }
}

vector <long long> solve() {
    for (int i = 0; i < n; i++)
        neg[i] = trie(1);

    for (int i = 0; i < n - 1; i++) {
        adj[fr[i]].push_back(i);
        adj[to[i]].push_back(i);
    }

    for (int i = 0; i < n; i++)
        deg[adj[i].size()].push_back(i);

    dfs(1);

    vector <long long> res;
    vector <int> node;

    for (int k = n - 1; k >= 1; k--) {
        // cerr << "deg = " << k << "\n";
        for (int v : deg[k]) {
            add(v);
            node.push_back(v);
            // cerr << "add " <<  v << "\n";
        }
        long long tmp = 0;
    
        for (int v : node) if (!flag[par[v]]) {
            solve(v, k);
            tmp += min(dp[v][0], dp[v][1]);
        }

        res.push_back(tmp);
    }

    res.push_back(accumulate(w, w + (n - 1), 0LL));
    reverse(ALL(res));
    return res;
}

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++) {
        fr[i] = U[i];
        to[i] = V[i];
        w[i] = W[i];
    }

    return solve();
}

//#include "grader.cpp"

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14420 KB Output is correct
2 Incorrect 17 ms 16208 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14448 KB Output is correct
2 Correct 411 ms 254044 KB Output is correct
3 Correct 419 ms 252052 KB Output is correct
4 Correct 473 ms 290020 KB Output is correct
5 Correct 358 ms 192964 KB Output is correct
6 Correct 19 ms 19388 KB Output is correct
7 Correct 20 ms 19540 KB Output is correct
8 Correct 19 ms 17580 KB Output is correct
9 Correct 12 ms 14808 KB Output is correct
10 Correct 14 ms 14908 KB Output is correct
11 Correct 12 ms 14676 KB Output is correct
12 Correct 284 ms 172912 KB Output is correct
13 Correct 409 ms 247648 KB Output is correct
14 Correct 10 ms 14420 KB Output is correct
15 Correct 334 ms 175408 KB Output is correct
16 Correct 358 ms 192864 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14420 KB Output is correct
2 Correct 12 ms 14420 KB Output is correct
3 Correct 11 ms 14420 KB Output is correct
4 Incorrect 12 ms 14740 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14420 KB Output is correct
2 Correct 12 ms 14420 KB Output is correct
3 Correct 11 ms 14420 KB Output is correct
4 Incorrect 12 ms 14740 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 460 ms 110076 KB Output is correct
2 Correct 472 ms 109660 KB Output is correct
3 Correct 281 ms 28676 KB Output is correct
4 Correct 507 ms 114960 KB Output is correct
5 Correct 279 ms 28744 KB Output is correct
6 Correct 319 ms 27740 KB Output is correct
7 Correct 382 ms 83068 KB Output is correct
8 Correct 269 ms 26880 KB Output is correct
9 Correct 414 ms 100156 KB Output is correct
10 Correct 477 ms 97340 KB Output is correct
11 Correct 281 ms 28800 KB Output is correct
12 Correct 248 ms 27744 KB Output is correct
13 Correct 12 ms 14420 KB Output is correct
14 Correct 332 ms 176480 KB Output is correct
15 Correct 371 ms 194304 KB Output is correct
16 Correct 20 ms 16340 KB Output is correct
17 Correct 23 ms 16340 KB Output is correct
18 Correct 17 ms 14752 KB Output is correct
19 Correct 19 ms 14640 KB Output is correct
20 Correct 18 ms 14676 KB Output is correct
21 Correct 220 ms 26300 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 460 ms 110076 KB Output is correct
2 Correct 472 ms 109660 KB Output is correct
3 Correct 281 ms 28676 KB Output is correct
4 Correct 507 ms 114960 KB Output is correct
5 Correct 279 ms 28744 KB Output is correct
6 Correct 319 ms 27740 KB Output is correct
7 Correct 382 ms 83068 KB Output is correct
8 Correct 269 ms 26880 KB Output is correct
9 Correct 414 ms 100156 KB Output is correct
10 Correct 477 ms 97340 KB Output is correct
11 Correct 281 ms 28800 KB Output is correct
12 Correct 248 ms 27744 KB Output is correct
13 Correct 12 ms 14420 KB Output is correct
14 Correct 332 ms 176480 KB Output is correct
15 Correct 371 ms 194304 KB Output is correct
16 Correct 20 ms 16340 KB Output is correct
17 Correct 23 ms 16340 KB Output is correct
18 Correct 17 ms 14752 KB Output is correct
19 Correct 19 ms 14640 KB Output is correct
20 Correct 18 ms 14676 KB Output is correct
21 Correct 220 ms 26300 KB Output is correct
22 Correct 14 ms 14420 KB Output is correct
23 Correct 14 ms 14408 KB Output is correct
24 Correct 14 ms 14404 KB Output is correct
25 Correct 466 ms 153632 KB Output is correct
26 Correct 427 ms 137460 KB Output is correct
27 Correct 546 ms 173772 KB Output is correct
28 Correct 321 ms 29120 KB Output is correct
29 Correct 323 ms 28016 KB Output is correct
30 Correct 280 ms 27284 KB Output is correct
31 Correct 289 ms 27552 KB Output is correct
32 Correct 457 ms 109012 KB Output is correct
33 Correct 253 ms 27128 KB Output is correct
34 Correct 450 ms 104312 KB Output is correct
35 Correct 593 ms 188820 KB Output is correct
36 Correct 294 ms 29392 KB Output is correct
37 Correct 299 ms 27772 KB Output is correct
38 Correct 266 ms 173780 KB Output is correct
39 Correct 436 ms 249004 KB Output is correct
40 Correct 20 ms 16812 KB Output is correct
41 Correct 19 ms 17484 KB Output is correct
42 Correct 18 ms 14692 KB Output is correct
43 Correct 19 ms 14628 KB Output is correct
44 Correct 20 ms 14596 KB Output is correct
45 Correct 13 ms 14548 KB Output is correct
46 Correct 13 ms 14676 KB Output is correct
47 Correct 15 ms 14584 KB Output is correct
48 Correct 12 ms 14400 KB Output is correct
49 Correct 11 ms 14396 KB Output is correct
50 Correct 153 ms 22260 KB Output is correct
51 Correct 272 ms 27312 KB Output is correct
52 Correct 468 ms 111580 KB Output is correct
53 Correct 467 ms 109672 KB Output is correct
54 Correct 291 ms 28884 KB Output is correct
55 Correct 501 ms 115024 KB Output is correct
56 Correct 292 ms 28592 KB Output is correct
57 Correct 270 ms 27728 KB Output is correct
58 Correct 403 ms 82896 KB Output is correct
59 Correct 242 ms 26772 KB Output is correct
60 Correct 439 ms 100172 KB Output is correct
61 Correct 456 ms 97328 KB Output is correct
62 Correct 325 ms 28740 KB Output is correct
63 Correct 253 ms 27752 KB Output is correct
64 Correct 14 ms 14428 KB Output is correct
65 Correct 345 ms 176468 KB Output is correct
66 Correct 387 ms 194328 KB Output is correct
67 Correct 18 ms 16340 KB Output is correct
68 Correct 19 ms 16340 KB Output is correct
69 Correct 17 ms 14684 KB Output is correct
70 Correct 17 ms 14600 KB Output is correct
71 Correct 18 ms 14684 KB Output is correct
72 Correct 222 ms 26312 KB Output is correct

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14420 KB Output is correct
2 Incorrect 17 ms 16208 KB Output isn't correct
3 Halted 0 ms 0 KB -