oj.uz

Submission #857793

# Submission time Handle Problem Language Result Execution time Memory
857793 2023-10-07T01:47:44 Z NguyenTN091106 Putovanje (COCI20_putovanje) C++14
110 / 110
 92 ms 28520 KB 
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define mp(x,y) make_pair((x),(y))
#define bit(x,i) (((x)>>(i))&1)
#define MASK(i) (1<<(i))
#define randomize mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count())
using namespace std;
const int maxn=2e5+5;
const ll oo=2e18+5;
const int MOD=1e9+7;
const int inf=1e9+7;
void init()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}
int n,c[2][maxn],pa[maxn][20],depth[maxn];
vector< pair<int,int> > adj[maxn];
void dfs(int u,int pre)
{
    for(int it=0;it<(int)adj[u].size();it++)
    {
        int v=adj[u][it].ff;
        if(v==pre) continue;
        depth[v]=depth[u]+1;
        pa[v][0]=u;
        for(int j=1;j<=18;j++) pa[v][j]=pa[pa[v][j-1]][j-1];
        dfs(v,u);
    }
}
int LCA(int u,int v)
{
    if(depth[u]<depth[v]) swap(u,v);
    for(int j=18;j>=0;j--) if(depth[u]-MASK(j)>=depth[v]) u=pa[u][j];
    if(u==v) return u;
    for(int j=18;j>=0;j--) if(pa[u][j]!=pa[v][j])
    {
        u=pa[u][j];
        v=pa[v][j];
    }
    return pa[u][0];
}
ll cnt[maxn],sum[maxn];
void calc(int u,int pre,int id)
{
    for(int it=0;it<(int)adj[u].size();it++)
    {
        int v=adj[u][it].ff,newId=adj[u][it].ss;
        if(v==pre) continue;
        calc(v,u,newId);
        cnt[u]+=cnt[v];
    }
    if(id) sum[id]=cnt[u];
}
void solve()
{
    cin>>n;
    for(int i=1;i<n;i++)
    {
        int u,v;
        cin>>u>>v>>c[0][i]>>c[1][i];
        adj[u].push_back(mp(v,i));
        adj[v].push_back(mp(u,i));
    }
    dfs(1,0);
    for(int i=1;i<n;i++)
    {
        int w=LCA(i,i+1);
        cnt[i]++;
        cnt[i+1]++;
        cnt[w]-=2;
    }
    calc(1,0,0);
    ll ans=0;
    for(int i=1;i<n;i++)
        ans+=min(1LL*c[0][i]*sum[i],1LL*c[1][i]);
    cout<<ans;
}
int main()
{
    init();
//    int t;
//    cin>>t;
//    while(t--)
        solve();
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 26196 KB Output is correct
2 Correct 72 ms 27324 KB Output is correct
3 Correct 92 ms 28520 KB Output is correct
4 Correct 79 ms 27728 KB Output is correct
5 Correct 2 ms 12632 KB Output is correct
6 Correct 70 ms 26060 KB Output is correct
7 Correct 46 ms 22428 KB Output is correct
8 Correct 70 ms 25916 KB Output is correct
9 Correct 52 ms 25940 KB Output is correct
10 Correct 54 ms 25788 KB Output is correct
11 Correct 52 ms 26452 KB Output is correct
12 Correct 53 ms 26452 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12636 KB Output is correct
5 Correct 4 ms 12636 KB Output is correct
6 Correct 3 ms 12720 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 3 ms 12636 KB Output is correct
10 Correct 67 ms 26196 KB Output is correct
11 Correct 72 ms 27324 KB Output is correct
12 Correct 92 ms 28520 KB Output is correct
13 Correct 79 ms 27728 KB Output is correct
14 Correct 2 ms 12632 KB Output is correct
15 Correct 70 ms 26060 KB Output is correct
16 Correct 46 ms 22428 KB Output is correct
17 Correct 70 ms 25916 KB Output is correct
18 Correct 52 ms 25940 KB Output is correct
19 Correct 54 ms 25788 KB Output is correct
20 Correct 52 ms 26452 KB Output is correct
21 Correct 53 ms 26452 KB Output is correct
22 Correct 56 ms 22612 KB Output is correct
23 Correct 50 ms 22432 KB Output is correct
24 Correct 56 ms 22768 KB Output is correct
25 Correct 3 ms 12636 KB Output is correct
26 Correct 25 ms 16712 KB Output is correct
27 Correct 54 ms 22052 KB Output is correct
28 Correct 43 ms 25168 KB Output is correct
29 Correct 53 ms 26456 KB Output is correct
30 Correct 52 ms 26452 KB Output is correct
31 Correct 3 ms 12892 KB Output is correct