oj.uz

답안 #882387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
882387 2023-12-03T06:19:48 Z 12345678 Putovanje (COCI20_putovanje) C++17
110 / 110
 110 ms 38744 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5, kx=18;
long long n, u, v, c[nx], c2[nx], dp[nx], cnt[nx], res, pa[nx][kx], lvl[nx];
vector<pair<int, int>> d[nx];

void dfs(int u, int p)
{
    lvl[u]=lvl[p]+1; pa[u][0]=p;
    for (int i=1; i<kx; i++) pa[u][i]=pa[pa[u][i-1]][i-1];
    for (auto [v, idx]:d[u]) if (v!=p) dfs(v, u);
}

int lca(int u, int v)
{
    if (lvl[u]>lvl[v]) swap(u, v);
    for (int i=kx-1; i>=0; i--) if (lvl[pa[v][i]]>=lvl[u]) v=pa[v][i];
    if (u==v) return v;
    for (int i=kx-1; i>=0; i--) if (pa[u][i]!=pa[v][i]) u=pa[u][i], v=pa[v][i];
    return pa[u][0];
}

void dfs2(int u, int p, int idx)
{
    for (auto [v, id]:d[u]) if (v!=p) dfs2(v, u, id), dp[u]+=dp[v];
    cnt[idx]=dp[u];
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<n; i++) cin>>u>>v>>c[i]>>c2[i], d[u].push_back({v, i}), d[v].push_back({u, i});
    dfs(1, 1);
    for (int i=2; i<=n; i++) dp[i]++, dp[i-1]++, dp[lca(i, i-1)]-=2;
    dfs2(1, 1, 0);
    for (int i=1; i<n; i++) res+=min(c[i]*cnt[i], c2[i]);
    cout<<res;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14952 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 32852 KB Output is correct
2 Correct 90 ms 36088 KB Output is correct
3 Correct 110 ms 37460 KB Output is correct
4 Correct 106 ms 38744 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 82 ms 34444 KB Output is correct
7 Correct 55 ms 30288 KB Output is correct
8 Correct 98 ms 36872 KB Output is correct
9 Correct 59 ms 36644 KB Output is correct
10 Correct 57 ms 36472 KB Output is correct
11 Correct 73 ms 37200 KB Output is correct
12 Correct 63 ms 37432 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14952 KB Output is correct
10 Correct 96 ms 32852 KB Output is correct
11 Correct 90 ms 36088 KB Output is correct
12 Correct 110 ms 37460 KB Output is correct
13 Correct 106 ms 38744 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct
15 Correct 82 ms 34444 KB Output is correct
16 Correct 55 ms 30288 KB Output is correct
17 Correct 98 ms 36872 KB Output is correct
18 Correct 59 ms 36644 KB Output is correct
19 Correct 57 ms 36472 KB Output is correct
20 Correct 73 ms 37200 KB Output is correct
21 Correct 63 ms 37432 KB Output is correct
22 Correct 88 ms 33872 KB Output is correct
23 Correct 70 ms 30804 KB Output is correct
24 Correct 73 ms 33268 KB Output is correct
25 Correct 3 ms 14936 KB Output is correct
26 Correct 30 ms 23832 KB Output is correct
27 Correct 64 ms 30548 KB Output is correct
28 Correct 52 ms 33360 KB Output is correct
29 Correct 65 ms 37464 KB Output is correct
30 Correct 66 ms 37044 KB Output is correct
31 Correct 3 ms 14940 KB Output is correct