oj.uz

Submission #401906

# Submission time Handle Problem Language Result Execution time Memory
401906 2021-05-11T01:05:57 Z fadi57 Putovanje (COCI20_putovanje) C++14
110 / 110
 274 ms 28736 KB 
#include<bits/stdc++.h>
using namespace std;
const int mx=200002;
typedef long long ll;
int inf=1e9+10;
const int mod=1e9+7;
int n,m;



vector<pair<int,pair<ll,ll>>> adj[200002];

int dp[200001][22];
int depth[mx];
void dfs(int node,int p){
dp[node][0]=p;
   depth[node]=depth[p]+1;
for(int i=1;i<=20;i++){
    dp[node][i]=dp[dp[node][i-1]][i-1];
}
for(auto it:adj[node]){
    if(it.first!=p){

        dfs(it.first,node);
    }
}

return;
 }
 int kth(int node,int k){


 for(int i=0;i<20;i++){

    if((1<<i)&k){
           // cout<<"TEST "<<i;
        node=dp[node][i];
    }
 }
 return node;


  }
 int lca(int a,int b){

 if(depth[a]<depth[b]){
    swap(a,b);
 }

 a=kth(a,depth[a]-depth[b]);

 if(a==b){return a;}

 for(int i=19;i>=0;i--){

    int aa=dp[a][i];
    int bb=dp[b][i];
    if(aa==bb){
        continue;
    }else{

    a=aa;b=bb;

    }
 }
 return dp[a][0];
  }
  int dp2[200002];
  ll ans;
  int dfs2(int node,int p){
ll sum=dp2[node];

  for(auto it:adj[node]){

    if(it.first==p){continue;}



ll sum2=0;
   sum2+=dfs2(it.first,node);
    sum+=sum2;
    ans+=min(1LL*it.second.first*sum2,it.second.second);
  }

  return sum;


  }

int main(){
cin>>n;

 for(int i=0;i<n-1;i++){
        int x,y,c1,c2;
    cin>>x>>y>>c1>>c2;
    adj[x].push_back({y,{c1,c2}});
     adj[y].push_back({x,{c1,c2}});
 }
dfs(1,0);

//cout<<lca(3,5);

 for(int i=1;i<n;i++){

    dp2[i]++;

    dp2[i+1]++;

    int x=lca(i,i+1);
  dp2[x]-=2;

 }
 dfs2(1,-1);
cout<<ans;
 }

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 7 ms 5196 KB Output is correct
3 Correct 6 ms 5324 KB Output is correct
4 Correct 7 ms 5324 KB Output is correct
5 Correct 7 ms 5324 KB Output is correct
6 Correct 3 ms 5008 KB Output is correct
7 Correct 4 ms 5008 KB Output is correct
8 Correct 5 ms 5212 KB Output is correct
9 Correct 6 ms 5324 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 23104 KB Output is correct
2 Correct 211 ms 26088 KB Output is correct
3 Correct 247 ms 28736 KB Output is correct
4 Correct 274 ms 28256 KB Output is correct
5 Correct 4 ms 5068 KB Output is correct
6 Correct 199 ms 24352 KB Output is correct
7 Correct 125 ms 19248 KB Output is correct
8 Correct 216 ms 24776 KB Output is correct
9 Correct 168 ms 25760 KB Output is correct
10 Correct 162 ms 25080 KB Output is correct
11 Correct 183 ms 26880 KB Output is correct
12 Correct 183 ms 27004 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 7 ms 5196 KB Output is correct
3 Correct 6 ms 5324 KB Output is correct
4 Correct 7 ms 5324 KB Output is correct
5 Correct 7 ms 5324 KB Output is correct
6 Correct 3 ms 5008 KB Output is correct
7 Correct 4 ms 5008 KB Output is correct
8 Correct 5 ms 5212 KB Output is correct
9 Correct 6 ms 5324 KB Output is correct
10 Correct 201 ms 23104 KB Output is correct
11 Correct 211 ms 26088 KB Output is correct
12 Correct 247 ms 28736 KB Output is correct
13 Correct 274 ms 28256 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 199 ms 24352 KB Output is correct
16 Correct 125 ms 19248 KB Output is correct
17 Correct 216 ms 24776 KB Output is correct
18 Correct 168 ms 25760 KB Output is correct
19 Correct 162 ms 25080 KB Output is correct
20 Correct 183 ms 26880 KB Output is correct
21 Correct 183 ms 27004 KB Output is correct
22 Correct 206 ms 22396 KB Output is correct
23 Correct 181 ms 20316 KB Output is correct
24 Correct 208 ms 22016 KB Output is correct
25 Correct 5 ms 5196 KB Output is correct
26 Correct 75 ms 12752 KB Output is correct
27 Correct 176 ms 19672 KB Output is correct
28 Correct 140 ms 23188 KB Output is correct
29 Correct 192 ms 27052 KB Output is correct
30 Correct 186 ms 26692 KB Output is correct
31 Correct 5 ms 5272 KB Output is correct