oj.uz

Submission #749956

# Submission time Handle Problem Language Result Execution time Memory
749956 2023-05-29T02:18:49 Z bgnbvnbv Putovanje (COCI20_putovanje) C++14
110 / 110
 166 ms 34548 KB 
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=3e5;
const ll inf=1e18;
const ll mod=1e9+7;
ll P[maxN][20],h[maxN];
vector<pli>g[maxN];
ll n,id[maxN];
void dfs(ll u=1,ll p=1)
{
    P[u][0]=p;
    for(int i=1;i<=18;i++) P[u][i]=P[P[u][i-1]][i-1];
    for(auto vv:g[u])
    {
        ll v=vv.fi;
        ll e=vv.se;
        if(v!=p)
        {
            h[v]=h[u]+1;
            dfs(v,u);
            id[e]=v;
        }
    }
}
ll lca(ll u,ll v)
{
    if(h[u]<h[v]) swap(u,v);
    for(int i=18;i>=0;i--)if(h[u]-(1<<i)>=h[v]) u=P[u][i];
    if(u==v) return u;
    for(int i=18;i>=0;i--) if(P[u][i]!=P[v][i]) u=P[u][i],v=P[v][i];
    return P[u][0];
}
ll cnt[maxN];
void dfs1(ll u=1,ll p=1)
{
    for(auto vv:g[u])
    {
        if(vv.fi!=p)
        {
            dfs1(vv.fi,u);
            cnt[u]+=cnt[vv.fi];
        }
    }
}
ll a[maxN],b[maxN],ans=0;
void solve()
{
    cin >> n;
    for(int i=1;i<n;i++)
    {
        ll u,v;
        cin >> u >> v;
        g[u].pb({v,i});
        g[v].pb({u,i});
        cin >> a[i] >> b[i];
    }
    dfs();
    for(int i=2;i<=n;i++)
    {
        ll x=lca(i,i-1);
        cnt[i]++;
        cnt[i-1]++;
        cnt[x]-=2;
    }
    dfs1();
    for(int i=1;i<n;i++)
    {
        ll u=id[i];
        ans+=min(cnt[u]*a[i],b[i]);
    }
    cout << ans;
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7764 KB Output is correct
3 Correct 6 ms 7764 KB Output is correct
4 Correct 5 ms 7764 KB Output is correct
5 Correct 6 ms 7764 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7508 KB Output is correct
8 Correct 4 ms 7636 KB Output is correct
9 Correct 5 ms 7764 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 30684 KB Output is correct
2 Correct 166 ms 31800 KB Output is correct
3 Correct 155 ms 34156 KB Output is correct
4 Correct 159 ms 34548 KB Output is correct
5 Correct 4 ms 7508 KB Output is correct
6 Correct 144 ms 30056 KB Output is correct
7 Correct 76 ms 23884 KB Output is correct
8 Correct 146 ms 30900 KB Output is correct
9 Correct 74 ms 31928 KB Output is correct
10 Correct 89 ms 31156 KB Output is correct
11 Correct 75 ms 33204 KB Output is correct
12 Correct 75 ms 33116 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7764 KB Output is correct
3 Correct 6 ms 7764 KB Output is correct
4 Correct 5 ms 7764 KB Output is correct
5 Correct 6 ms 7764 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7508 KB Output is correct
8 Correct 4 ms 7636 KB Output is correct
9 Correct 5 ms 7764 KB Output is correct
10 Correct 147 ms 30684 KB Output is correct
11 Correct 166 ms 31800 KB Output is correct
12 Correct 155 ms 34156 KB Output is correct
13 Correct 159 ms 34548 KB Output is correct
14 Correct 4 ms 7508 KB Output is correct
15 Correct 144 ms 30056 KB Output is correct
16 Correct 76 ms 23884 KB Output is correct
17 Correct 146 ms 30900 KB Output is correct
18 Correct 74 ms 31928 KB Output is correct
19 Correct 89 ms 31156 KB Output is correct
20 Correct 75 ms 33204 KB Output is correct
21 Correct 75 ms 33116 KB Output is correct
22 Correct 106 ms 29816 KB Output is correct
23 Correct 101 ms 27188 KB Output is correct
24 Correct 114 ms 29572 KB Output is correct
25 Correct 5 ms 7636 KB Output is correct
26 Correct 49 ms 17644 KB Output is correct
27 Correct 109 ms 26212 KB Output is correct
28 Correct 73 ms 29160 KB Output is correct
29 Correct 79 ms 33116 KB Output is correct
30 Correct 70 ms 33056 KB Output is correct
31 Correct 4 ms 7764 KB Output is correct