Submission #1692376
Source Code Expand
#include<bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define N 100009
using namespace std;
int n,rt,tot=1,fst[N],pnt[N<<1],len[N<<1],nxt[N<<1],sz[N]; ll ans;
void add(int x,int y,int z){
pnt[++tot]=y; len[tot]=z; nxt[tot]=fst[x]; fst[x]=tot;
}
void dfs(int x,int p){
int i,y,tmp=0; sz[x]=1;
for (i=fst[x]; i; i=nxt[i]) if (i^p^1){
y=pnt[i]; dfs(y,i);
sz[x]+=sz[y]; tmp=max(tmp,sz[y]);
}
ans+=2ll*len[p]*min(sz[x],n-sz[x]);
if (!rt && max(tmp,n-sz[x])<=(n>>1)) rt=x;
}
int main(){
scanf("%d",&n);
int i,x,y,z;
for (i=1; i<n; i++){
scanf("%d%d%d",&x,&y,&z);
add(x,y,z); add(y,x,z);
}
dfs(1,0);
ans=0; dfs(rt,0);
for (i=fst[rt]; i; i=nxt[i]){
x=pnt[i];
if ((sz[x]<<1)==n) break;
}
if (i) ans-=len[i];
else{
for (i=fst[rt],x=inf; i; i=nxt[i]) x=min(x,len[i]);
ans-=x;
}
printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time
2017-10-18 20:11:37+0900
Task
D - Tree and Hamilton Path
User
lych_cys
Language
C++14 (GCC 5.4.1)
Score
1100
Code Size
891 Byte
Status
AC
Exec Time
42 ms
Memory
8704 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:21:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:24:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&x,&y,&z);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1100 / 1100
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt
All
sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
1 ms
256 KB
sample_02.txt
AC
1 ms
256 KB
subtask_1_01.txt
AC
1 ms
256 KB
subtask_1_02.txt
AC
34 ms
3072 KB
subtask_1_03.txt
AC
17 ms
1792 KB
subtask_1_04.txt
AC
37 ms
3328 KB
subtask_1_05.txt
AC
21 ms
3072 KB
subtask_1_06.txt
AC
15 ms
1664 KB
subtask_1_07.txt
AC
16 ms
1536 KB
subtask_1_08.txt
AC
18 ms
1792 KB
subtask_1_09.txt
AC
12 ms
1280 KB
subtask_1_10.txt
AC
5 ms
1280 KB
subtask_1_11.txt
AC
10 ms
1152 KB
subtask_1_12.txt
AC
39 ms
3328 KB
subtask_1_13.txt
AC
38 ms
3328 KB
subtask_1_14.txt
AC
38 ms
3328 KB
subtask_1_15.txt
AC
38 ms
3328 KB
subtask_1_16.txt
AC
39 ms
3328 KB
subtask_1_17.txt
AC
39 ms
3328 KB
subtask_1_18.txt
AC
38 ms
3328 KB
subtask_1_19.txt
AC
38 ms
3328 KB
subtask_1_20.txt
AC
39 ms
3328 KB
subtask_1_21.txt
AC
38 ms
3328 KB
subtask_1_22.txt
AC
38 ms
3456 KB
subtask_1_23.txt
AC
42 ms
6912 KB
subtask_1_24.txt
AC
42 ms
8448 KB
subtask_1_25.txt
AC
39 ms
3456 KB
subtask_1_26.txt
AC
41 ms
4736 KB
subtask_1_27.txt
AC
42 ms
7936 KB
subtask_1_28.txt
AC
39 ms
3456 KB
subtask_1_29.txt
AC
42 ms
8704 KB
subtask_1_30.txt
AC
41 ms
7424 KB
subtask_1_31.txt
AC
35 ms
3328 KB
subtask_1_32.txt
AC
34 ms
3328 KB
subtask_1_33.txt
AC
22 ms
2560 KB
subtask_1_34.txt
AC
29 ms
3328 KB