oj.uz

Submission #706611

# Submission time Handle Problem Language Result Execution time Memory
706611 2023-03-07T06:37:04 Z YugiHacker Putovanje (COCI20_putovanje) C++14
110 / 110
 88 ms 24048 KB 
#include<bits/stdc++.h>
#define el cout<<"\n"
#define f0(i,n) for(int i=0;i<n;++i)
#define f1(i,n) for(int i=1;i<=n;++i)
#define maxn 200005
using namespace std;
int n, lg;
int p[20][maxn], d[maxn], f[maxn];
struct edge
{
    int v, c1, c2;
};
vector <edge> a[maxn];
void dfs(int u, int par)
{
    for (auto e:a[u])
    {
        int v = e.v;
        if (v!=par)
        {
            p[0][v] = u;
            d[v] = d[u]+1;
            dfs(v, u);
        }
    }
}
void rmq()
{
    for (int i=1; i<=lg; i++)
        for (int j=1; j<=n; j++)
            p[i][j] = p[i-1][p[i-1][j]];
}
int lca(int u, int v)
{
    if (d[u] < d[v]) swap(u, v);
    int h=d[u]-d[v];
    for (int i=lg; ~i; i--)
        if ((h>>i)&1) u = p[i][u];
    if (u==v) return u;
    for (int i=lg; ~i; i--)
        if (p[i][u]!=p[i][v]) u = p[i][u], v = p[i][v];
    return p[0][u];
}
long long ans;
void dfs2(int u, int par)
{
    for (auto e:a[u])
    {
        int v = e.v;
        if (v!=par)
        {
            dfs2(v, u);
            ans += min(1ll*e.c1*f[v],1ll*e.c2);
            f[u] += f[v];
        }
    }
}
main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    lg = log2(n);
    f1 (i, n-1)
    {
        int u, v, c1, c2;
        cin >> u >> v >> c1 >> c2;
        a[u].push_back({v, c1, c2});
        a[v].push_back({u, c1, c2});
    }
    d[1] = 1;
    dfs(1, 0);
    rmq();
    f1 (i, n-1)
    {
        int p = lca(i, i+1);
        f[p]-=2;
        f[i]++;
        f[i+1]++;
    }
    dfs2(1, 0);
    cout << ans;
}

Compilation message

putovanje.cpp:58:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   58 | main()
      | ^~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 4 ms 5204 KB Output is correct
3 Correct 4 ms 5272 KB Output is correct
4 Correct 4 ms 5204 KB Output is correct
5 Correct 4 ms 5292 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5200 KB Output is correct
9 Correct 4 ms 5204 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 20656 KB Output is correct
2 Correct 74 ms 21744 KB Output is correct
3 Correct 87 ms 24048 KB Output is correct
4 Correct 88 ms 23320 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 72 ms 20128 KB Output is correct
7 Correct 45 ms 16076 KB Output is correct
8 Correct 75 ms 20352 KB Output is correct
9 Correct 51 ms 21008 KB Output is correct
10 Correct 49 ms 20520 KB Output is correct
11 Correct 54 ms 21880 KB Output is correct
12 Correct 63 ms 22020 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 4 ms 5204 KB Output is correct
3 Correct 4 ms 5272 KB Output is correct
4 Correct 4 ms 5204 KB Output is correct
5 Correct 4 ms 5292 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5200 KB Output is correct
9 Correct 4 ms 5204 KB Output is correct
10 Correct 78 ms 20656 KB Output is correct
11 Correct 74 ms 21744 KB Output is correct
12 Correct 87 ms 24048 KB Output is correct
13 Correct 88 ms 23320 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 72 ms 20128 KB Output is correct
16 Correct 45 ms 16076 KB Output is correct
17 Correct 75 ms 20352 KB Output is correct
18 Correct 51 ms 21008 KB Output is correct
19 Correct 49 ms 20520 KB Output is correct
20 Correct 54 ms 21880 KB Output is correct
21 Correct 63 ms 22020 KB Output is correct
22 Correct 80 ms 18480 KB Output is correct
23 Correct 76 ms 16804 KB Output is correct
24 Correct 71 ms 18088 KB Output is correct
25 Correct 3 ms 5152 KB Output is correct
26 Correct 29 ms 10784 KB Output is correct
27 Correct 58 ms 16388 KB Output is correct
28 Correct 44 ms 18988 KB Output is correct
29 Correct 61 ms 22056 KB Output is correct
30 Correct 53 ms 21672 KB Output is correct
31 Correct 3 ms 5204 KB Output is correct