oj.uz

Submission #878495

# Submission time Handle Problem Language Result Execution time Memory
878495 2023-11-24T14:20:55 Z LePhiPhat Putovanje (COCI20_putovanje) C++17
110 / 110
 350 ms 61376 KB 
#include <bits/stdc++.h>

#ifdef LOCAL
#include "debuge.cpp"
#else
#define debug(...) 42;
#endif

using namespace std;

using ii = pair<int, int>;
using ll = long long;
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second

const int N = 200001;
vector<int> g[N];
ll dep[N], up[N][20], dp[N];
void dfs(int u, int p) {
    up[u][0] = p;
    for (int &v: g[u]) if (v != p) {
        dep[v] = dep[u] + 1;
        dfs(v, u);
    }
}
void calc(int n) {
    for (int i = 1; i < 20; i++) {
        for (int j = 1; j <= n; j++) {
            up[j][i] = up[up[j][i - 1]][i - 1];
        }
    }
}
int jmp(int u, int k) {
    debug(u, k);
    for (int i = 20; i >= 0; i--) {
        if ((k & (1ll << i))) {
            u = up[u][i];
        }
    }
    debug(u);
    return u;
}
int lca(int u, int v) {
    if (dep[u] != dep[v]) {
        if (dep[u] < dep[v]) 
            swap(u, v);
        u = jmp(u, dep[u] - dep[v]);
    }
    if (u == v) return u;
    for (int i = 19; i >= 0; i--) {
        if (up[u][i] != up[v][i]) {
            debug(u, v, i, up[u][i], up[v][i]);
            u = up[u][i];
            v = up[v][i];
        }
    }
    return up[u][0];
}
void push(int u, int p) {
    for (int &v: g[u]) if (v != p) {
        push(v, u);
        dp[u] += dp[v];
    }
}
ll ans = 0;
map<pair<int, int>, ll> mp1, mp2;
void dfsAns(int u, int p) {
    for (auto &v: g[u]) if (v != p) {
        ans += min(mp1[{u, v}] * dp[v], mp2[{u, v}]) * 1ll;
        dfsAns(v, u);
    }
}
void solve() {
    int n;
    cin >> n;
    for (int i = 0; i < n - 1; i++) {
        ll u, v, c1, c2;
        cin >> u >> v >> c1 >> c2;
        mp1[{u, v}] = c1;
        mp1[{v, u}] = c1;
        mp2[{u, v}] = c2;
        mp2[{v, u}] = c2;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1, 0);
    calc(n);
    for (int i = 1; i < n; i++) {
        int u = i, v = i + 1;
        int LCA = lca(u, v);
        dp[LCA] -= 2; 
        dp[u]++;
        dp[v]++;
        debug(u, v, LCA);
        // for (int j = 1; j <= n; j++) cout << dp[j] << " \n"[j == n];
    }  
    push(1, 0);   
    dfsAns(1, 0);
    cout << ans;
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    #ifdef LOCAL
    freopen("main.inp", "r", stdin);
    freopen("main.out", "w", stdout);
    #endif
    int tc = 1;
    // cin >> tc;
    while (tc--) {
        solve();
    }
}

Compilation message

putovanje.cpp: In function 'int jmp(int, int)':
putovanje.cpp:6:20: warning: statement has no effect [-Wunused-value]
    6 | #define debug(...) 42;
      |                    ^~
putovanje.cpp:35:5: note: in expansion of macro 'debug'
   35 |     debug(u, k);
      |     ^~~~~
putovanje.cpp:6:20: warning: statement has no effect [-Wunused-value]
    6 | #define debug(...) 42;
      |                    ^~
putovanje.cpp:41:5: note: in expansion of macro 'debug'
   41 |     debug(u);
      |     ^~~~~
putovanje.cpp: In function 'int lca(int, int)':
putovanje.cpp:6:20: warning: statement has no effect [-Wunused-value]
    6 | #define debug(...) 42;
      |                    ^~
putovanje.cpp:53:13: note: in expansion of macro 'debug'
   53 |             debug(u, v, i, up[u][i], up[v][i]);
      |             ^~~~~
putovanje.cpp: In function 'void solve()':
putovanje.cpp:6:20: warning: statement has no effect [-Wunused-value]
    6 | #define debug(...) 42;
      |                    ^~
putovanje.cpp:95:9: note: in expansion of macro 'debug'
   95 |         debug(u, v, LCA);
      |         ^~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 4 ms 9052 KB Output is correct
3 Correct 5 ms 9052 KB Output is correct
4 Correct 5 ms 9052 KB Output is correct
5 Correct 5 ms 9052 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 3 ms 8652 KB Output is correct
8 Correct 4 ms 9052 KB Output is correct
9 Correct 5 ms 9024 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 54108 KB Output is correct
2 Correct 283 ms 55944 KB Output is correct
3 Correct 279 ms 59212 KB Output is correct
4 Correct 350 ms 61004 KB Output is correct
5 Correct 3 ms 8792 KB Output is correct
6 Correct 238 ms 53076 KB Output is correct
7 Correct 157 ms 41088 KB Output is correct
8 Correct 281 ms 53840 KB Output is correct
9 Correct 147 ms 55120 KB Output is correct
10 Correct 140 ms 54356 KB Output is correct
11 Correct 160 ms 58772 KB Output is correct
12 Correct 155 ms 58960 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 4 ms 9052 KB Output is correct
3 Correct 5 ms 9052 KB Output is correct
4 Correct 5 ms 9052 KB Output is correct
5 Correct 5 ms 9052 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 3 ms 8652 KB Output is correct
8 Correct 4 ms 9052 KB Output is correct
9 Correct 5 ms 9024 KB Output is correct
10 Correct 248 ms 54108 KB Output is correct
11 Correct 283 ms 55944 KB Output is correct
12 Correct 279 ms 59212 KB Output is correct
13 Correct 350 ms 61004 KB Output is correct
14 Correct 3 ms 8792 KB Output is correct
15 Correct 238 ms 53076 KB Output is correct
16 Correct 157 ms 41088 KB Output is correct
17 Correct 281 ms 53840 KB Output is correct
18 Correct 147 ms 55120 KB Output is correct
19 Correct 140 ms 54356 KB Output is correct
20 Correct 160 ms 58772 KB Output is correct
21 Correct 155 ms 58960 KB Output is correct
22 Correct 349 ms 54892 KB Output is correct
23 Correct 248 ms 49156 KB Output is correct
24 Correct 328 ms 52144 KB Output is correct
25 Correct 4 ms 8792 KB Output is correct
26 Correct 98 ms 30288 KB Output is correct
27 Correct 263 ms 45852 KB Output is correct
28 Correct 142 ms 53328 KB Output is correct
29 Correct 161 ms 61376 KB Output is correct
30 Correct 162 ms 60668 KB Output is correct
31 Correct 4 ms 9052 KB Output is correct