oj.uz

답안 #937040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937040 2024-03-03T09:24:18 Z sleepntsheep Putovanje (COCI20_putovanje) C
110 / 110
 69 ms 15660 KB 
#include<stdio.h>
#include<stdlib.h>
#define N 200005
long long z,run;
int n,ff[N],dd[N],pp[N],jj[N],e[N<<1][4],ne,h[N],tin[N],tout[N],timer=1;
void link(int u,int v,int c1,int c2){
    e[++ne][0]=v,e[ne][1]=c1,e[ne][2]=c2,e[ne][3]=h[u],h[u]=ne;
}
void dfs(int u,int p){
    dd[u]=dd[pp[u]=p]+1;
    jj[u]=(dd[p]-dd[jj[p]]==dd[jj[p]]-dd[jj[jj[p]]])?jj[jj[p]]:p;
    tin[u]=timer++;
    for(int v,j=h[u];j;j=e[j][3])if((v=e[j][0])-p){
        dfs(v,u);
    }
    tout[u]=timer++;
}
int lca(int u,int v){
    if(dd[v]<dd[u])return lca(v,u);
    while(dd[v]>dd[u])
        v=dd[jj[v]]>=dd[u]?jj[v]:pp[v];
    while(u-v)
        if(jj[u]!=jj[v])u=jj[u],v=jj[v];
        else u=pp[u],v=pp[v];
    return u;
}
void dfs2(int u,int p){
    for(int v,j=h[u];j;j=e[j][3])if((v=e[j][0])-p){
        dfs2(v,u);
        long long tk=e[j][2],fr=0;
        fr=ff[tout[v]]-ff[tin[v]-1];
        if(e[j][1]*1ll*fr<tk)tk=fr*1ll*e[j][1];
        z+=tk;
    }
}
int main(){
    scanf("%d",&n);
    for(int a,b,c,d,i=1;i<n;++i) scanf("%d%d%d%d",&a,&b,&c,&d), link(a,b,c,d),link(b,a,c,d);
    dfs(1,1);
    for(int a,i=1;i<n;++i)a=lca(i,i+1),++ff[tin[i]],++ff[tin[i+1]],ff[tin[a]]-=2;
    for(int i=1;i<timer;++i)ff[i]+=ff[i-1];
    dfs2(1,1);
    printf("%lld",z);
}

Compilation message

putovanje.c: In function 'main':
putovanje.c:37:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     scanf("%d",&n);
      |     ^~~~~~~~~~~~~~
putovanje.c:38:34: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     for(int a,b,c,d,i=1;i<n;++i) scanf("%d%d%d%d",&a,&b,&c,&d), link(a,b,c,d),link(b,a,c,d);
      |                                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 11348 KB Output is correct
2 Correct 56 ms 12392 KB Output is correct
3 Correct 69 ms 15660 KB Output is correct
4 Correct 69 ms 14688 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 53 ms 11092 KB Output is correct
7 Correct 35 ms 9816 KB Output is correct
8 Correct 54 ms 11088 KB Output is correct
9 Correct 35 ms 12884 KB Output is correct
10 Correct 33 ms 10600 KB Output is correct
11 Correct 37 ms 13136 KB Output is correct
12 Correct 38 ms 13064 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 53 ms 11348 KB Output is correct
11 Correct 56 ms 12392 KB Output is correct
12 Correct 69 ms 15660 KB Output is correct
13 Correct 69 ms 14688 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 53 ms 11092 KB Output is correct
16 Correct 35 ms 9816 KB Output is correct
17 Correct 54 ms 11088 KB Output is correct
18 Correct 35 ms 12884 KB Output is correct
19 Correct 33 ms 10600 KB Output is correct
20 Correct 37 ms 13136 KB Output is correct
21 Correct 38 ms 13064 KB Output is correct
22 Correct 37 ms 9048 KB Output is correct
23 Correct 34 ms 6716 KB Output is correct
24 Correct 35 ms 9040 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 16 ms 5980 KB Output is correct
27 Correct 33 ms 6744 KB Output is correct
28 Correct 29 ms 10068 KB Output is correct
29 Correct 48 ms 13136 KB Output is correct
30 Correct 43 ms 13140 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct