oj.uz

Submission #805228

# Submission time Handle Problem Language Result Execution time Memory
805228 2023-08-03T14:17:22 Z vjudge1 Putovanje (COCI20_putovanje) C++17
110 / 110
 89 ms 36304 KB 
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
#define mp make_pair
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define dbg(msg,x) cout<<msg<<" "<<x<<endl;
#define output(x) for(auto c:x){cout<<c<<" ";}cout<<" ";
#define int long long 
#define ff first
#define ss second
#define endl "\n"
#define pq priority_queue
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef vector<pair<int,int> > vpp;
const int MAXN = 2*1e5+1;
int up[MAXN][19];
int psum[MAXN];
int tin[MAXN];
int tout[MAXN]; 
int idx=0;
int ans=0;
int cur=0;

struct Edge{
    int dest;
    int c1;
    int c2;
    
    Edge(int a,int b,int c){
        dest=a;
        c1=b;
        c2=c;
    }

    Edge(){
        dest=c1=c2=0;
    }


};


vector<Edge> adj[MAXN];



void dfs(int v=1,int p=-1){

    up[v][0]=p;
    if(p==-1)up[v][0]=v;
    rep(i,1,19)up[v][i]=up[up[v][i-1]][i-1];

    tin[v]=idx++;
    for(auto c:adj[v]){
        if(c.dest == p)continue;
        dfs(c.dest,v);
    }

    tout[v]=idx++;
}


int getAns(int v=1,int p=-1){


    for(auto c:adj[v]){
        if(c.dest == p)continue;
        int aux = getAns(c.dest,v);
        ans+=min(aux*c.c1,c.c2);
        psum[v]+=aux;
    }


    return psum[v];
}

bool isAncestor(int a,int b){
    return tin[a]<=tin[b] && tout[a]>=tout[b];
}


int lca(int a,int b){
    if(isAncestor(a,b))return a;
    if(isAncestor(b,a))return b;

    rep(j,0,19){
        int i = 18-j;
        if(!isAncestor(up[a][i],b))a=up[a][i];
    }
    return up[a][0];
}
int32_t main(){
    sws
    int n;cin>>n;

    rep(i,0,n-1){
        int a,b,c1,c2;
        cin>>a>>b>>c1>>c2;
        adj[a].pb(Edge(b,c1,c2));
        adj[b].pb(Edge(a,c1,c2));
    }

    dfs();


    rep(i,1,n){
        psum[i]++;
        psum[i+1]++;
        psum[lca(i,i+1)]-=2;
    }


    getAns();

    cout<<ans;
    
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5028 KB Output is correct
2 Correct 3 ms 5424 KB Output is correct
3 Correct 3 ms 5552 KB Output is correct
4 Correct 3 ms 5548 KB Output is correct
5 Correct 5 ms 5484 KB Output is correct
6 Correct 2 ms 5032 KB Output is correct
7 Correct 2 ms 5164 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 4 ms 5460 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 31652 KB Output is correct
2 Correct 75 ms 33052 KB Output is correct
3 Correct 79 ms 36304 KB Output is correct
4 Correct 89 ms 36144 KB Output is correct
5 Correct 3 ms 5204 KB Output is correct
6 Correct 76 ms 30992 KB Output is correct
7 Correct 47 ms 23908 KB Output is correct
8 Correct 73 ms 31784 KB Output is correct
9 Correct 58 ms 33244 KB Output is correct
10 Correct 57 ms 32352 KB Output is correct
11 Correct 60 ms 34644 KB Output is correct
12 Correct 73 ms 34880 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5028 KB Output is correct
2 Correct 3 ms 5424 KB Output is correct
3 Correct 3 ms 5552 KB Output is correct
4 Correct 3 ms 5548 KB Output is correct
5 Correct 5 ms 5484 KB Output is correct
6 Correct 2 ms 5032 KB Output is correct
7 Correct 2 ms 5164 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 4 ms 5460 KB Output is correct
10 Correct 84 ms 31652 KB Output is correct
11 Correct 75 ms 33052 KB Output is correct
12 Correct 79 ms 36304 KB Output is correct
13 Correct 89 ms 36144 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 76 ms 30992 KB Output is correct
16 Correct 47 ms 23908 KB Output is correct
17 Correct 73 ms 31784 KB Output is correct
18 Correct 58 ms 33244 KB Output is correct
19 Correct 57 ms 32352 KB Output is correct
20 Correct 60 ms 34644 KB Output is correct
21 Correct 73 ms 34880 KB Output is correct
22 Correct 77 ms 29948 KB Output is correct
23 Correct 83 ms 26956 KB Output is correct
24 Correct 72 ms 29484 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 37 ms 16248 KB Output is correct
27 Correct 64 ms 26092 KB Output is correct
28 Correct 52 ms 29772 KB Output is correct
29 Correct 67 ms 34876 KB Output is correct
30 Correct 59 ms 34472 KB Output is correct
31 Correct 3 ms 5332 KB Output is correct