oj.uz

Submission #857791

# Submission time Handle Problem Language Result Execution time Memory
857791 2023-10-07T01:35:29 Z caohung06 Putovanje (COCI20_putovanje) C++17
110 / 110
 103 ms 34640 KB 
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
using namespace std;
vector<pair<ll,ll>> g[100050];
ll p[100050][22],h[100050],n,u,v,c1[100050],c2[100050],dem[100050],d[100050],ans;
ll getbit(ll x,ll k)
{
    return (x>>k)&1;
}
void dfs(int u)
{
    for(int v=0; v<g[u].size(); v++)
    {
        if(g[u][v].f!=p[u][0])
        {
            h[g[u][v].f]=h[u]+1;
            p[g[u][v].f][0]=u;
            for(int i=1; i<=18; i++)
            {
                p[g[u][v].f][i]=p[p[g[u][v].f][i-1]][i-1];
            }
            dfs(g[u][v].f);
        }
    }
}
ll lca(int u,int v)
{
    if(h[u]<h[v]) swap(u,v);
    int delta=h[u]-h[v];
    for(int i=0; i<=18; i++)
    {
        if(getbit(delta,i)==1)
        {
            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];
}

void dfs2(int u,int id)
{
    for(int v=0; v<g[u].size(); v++)
    {
        if(g[u][v].f!=p[u][0])
        {
            dfs2(g[u][v].f,g[u][v].s);
            d[u]+=d[g[u][v].f];
        }
    }
    dem[id]=d[u];
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // freopen("friend.inp", "r", stdin);
    // freopen("friend.out", "w", stdout);
    cin>>n;
    for(int i=1; i<=n-1; i++)
    {
        cin>>u>>v>>c1[i]>>c2[i];
        g[u].push_back({v,i});
        g[v].push_back({u,i});
    }
    dfs(1);
    for(int i=1; i<=n-1; i++)
    {
        d[i]++;
        d[i+1]++;
        d[lca(i,i+1)]-=2;
    }
    dfs2(1,0);
    for(int i=1; i<=n; i++)
    {
        ans+=min(dem[i]*c1[i],c2[i]);
    }
    cout<<ans;
    return 0;
}

Compilation message

putovanje.cpp: In function 'void dfs(int)':
putovanje.cpp:14:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for(int v=0; v<g[u].size(); v++)
      |                  ~^~~~~~~~~~~~
putovanje.cpp: In function 'void dfs2(int, int)':
putovanje.cpp:53:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for(int v=0; v<g[u].size(); v++)
      |                  ~^~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 2 ms 7256 KB Output is correct
5 Correct 3 ms 7256 KB Output is correct
6 Correct 1 ms 7260 KB Output is correct
7 Correct 1 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 32344 KB Output is correct
2 Correct 90 ms 33616 KB Output is correct
3 Correct 87 ms 34640 KB Output is correct
4 Correct 103 ms 34264 KB Output is correct
5 Correct 2 ms 7256 KB Output is correct
6 Correct 91 ms 30116 KB Output is correct
7 Correct 45 ms 24144 KB Output is correct
8 Correct 81 ms 32068 KB Output is correct
9 Correct 55 ms 31984 KB Output is correct
10 Correct 64 ms 31768 KB Output is correct
11 Correct 57 ms 32340 KB Output is correct
12 Correct 61 ms 32336 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 2 ms 7256 KB Output is correct
5 Correct 3 ms 7256 KB Output is correct
6 Correct 1 ms 7260 KB Output is correct
7 Correct 1 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct
10 Correct 76 ms 32344 KB Output is correct
11 Correct 90 ms 33616 KB Output is correct
12 Correct 87 ms 34640 KB Output is correct
13 Correct 103 ms 34264 KB Output is correct
14 Correct 2 ms 7256 KB Output is correct
15 Correct 91 ms 30116 KB Output is correct
16 Correct 45 ms 24144 KB Output is correct
17 Correct 81 ms 32068 KB Output is correct
18 Correct 55 ms 31984 KB Output is correct
19 Correct 64 ms 31768 KB Output is correct
20 Correct 57 ms 32340 KB Output is correct
21 Correct 61 ms 32336 KB Output is correct
22 Correct 76 ms 28704 KB Output is correct
23 Correct 64 ms 26196 KB Output is correct
24 Correct 84 ms 28644 KB Output is correct
25 Correct 2 ms 7260 KB Output is correct
26 Correct 25 ms 17848 KB Output is correct
27 Correct 65 ms 25936 KB Output is correct
28 Correct 49 ms 29124 KB Output is correct
29 Correct 61 ms 32596 KB Output is correct
30 Correct 59 ms 32320 KB Output is correct
31 Correct 2 ms 7260 KB Output is correct