Submission #2667677
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>ii;
typedef pair<int,ii>iii;
typedef vector<int>vi;
vector<vi>adjlist;
vector<iii>edge;
const int N=1e5+5;
long long ans[N],lazy[N];
int pa[N],sz[N];
void unionset(int x,int y,int w)
{
x=pa[x];
y=pa[y];
if(sz[x]<sz[y]){
lazy[y]+=sz[x]*w;
for(int i=0;i<adjlist[x].size();++i){
int v=adjlist[x][i];
pa[v]=y;
adjlist[y].push_back(v);
ans[v]+=lazy[x];
ans[v]+=sz[y]*w;
ans[v]-=lazy[y];
}
sz[y]+=sz[x];
}
else{
lazy[x]+=sz[y]*w;
for(int i=0;i<adjlist[y].size();++i){
int v=adjlist[y][i];
pa[v]=x;
adjlist[x].push_back(v);
ans[v]+=lazy[y];
ans[v]+=sz[x]*w;
ans[v]-=lazy[x];
}
sz[x]+=sz[y];
}
}
int main()
{
int n;
scanf("%d",&n);
adjlist.assign(n+1,vi());
for(int i=1;i<=n;++i){
adjlist[i].push_back(i);
pa[i]=i;
sz[i]=1;
}
for(int i=1;i<n;++i){
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
edge.push_back(iii(w,ii(u,v)));
}
sort(edge.begin(),edge.end());
reverse(edge.begin(),edge.end());
for(int i=0;i<edge.size();++i){
unionset(edge[i].second.first,edge[i].second.second,edge[i].first);
}
int root=0;
for(int i=1;i<=n;++i)if(pa[i]==i)root=i;
for(int i=0;i<adjlist[root].size();i++)ans[adjlist[root][i]]+=lazy[root];
for(int i=1;i<=n;++i)printf("%lld\n",ans[i]);
}
Submission Info
Submission Time
2018-06-14 23:06:50+0900
Task
E - Black Cats Deployment
User
vjudge3
Language
C++14 (GCC 5.4.1)
Score
200
Code Size
1567 Byte
Status
WA
Exec Time
76 ms
Memory
14324 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:43:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:52:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&u,&v,&w);
^
Judge Result
Set Name
Sample
Subtask1
Subtask2
All
Score / Max Score
0 / 0
0 / 200
200 / 200
0 / 400
Status
Set Name
Test Cases
Sample
00_example_01.txt, 00_example_02.txt, 00_example_03.txt
Subtask1
00_example_01.txt, 00_example_02.txt, 00_example_03.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s1_07.txt
Subtask2
00_example_02.txt, s1_07.txt, s2_08.txt, s2_09.txt, s2_10.txt, s2_11.txt, s2_12.txt, s2_13.txt, s2_14.txt
All
00_example_01.txt, 00_example_02.txt, 00_example_03.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s1_07.txt, s2_08.txt, s2_09.txt, s2_10.txt, s2_11.txt, s2_12.txt, s2_13.txt, s2_14.txt, s3_15.txt, s3_16.txt, s3_17.txt, s3_18.txt, s3_19.txt, s3_20.txt, s3_21.txt, s3_22.txt, s3_23.txt, s3_24.txt, s3_25.txt, s3_26.txt, s3_27.txt, s3_28.txt, s3_29.txt
Case Name
Status
Exec Time
Memory
00_example_01.txt
AC
1 ms
256 KB
00_example_02.txt
AC
1 ms
256 KB
00_example_03.txt
AC
1 ms
256 KB
s1_01.txt
WA
1 ms
384 KB
s1_02.txt
WA
1 ms
384 KB
s1_03.txt
WA
1 ms
256 KB
s1_04.txt
WA
2 ms
384 KB
s1_05.txt
WA
2 ms
384 KB
s1_06.txt
WA
2 ms
384 KB
s1_07.txt
AC
1 ms
256 KB
s2_08.txt
AC
58 ms
9972 KB
s2_09.txt
AC
28 ms
5236 KB
s2_10.txt
AC
16 ms
3068 KB
s2_11.txt
AC
62 ms
11252 KB
s2_12.txt
AC
68 ms
11764 KB
s2_13.txt
AC
72 ms
13684 KB
s2_14.txt
AC
76 ms
13812 KB
s3_15.txt
WA
63 ms
10740 KB
s3_16.txt
WA
30 ms
5492 KB
s3_17.txt
WA
17 ms
3196 KB
s3_18.txt
WA
30 ms
5368 KB
s3_19.txt
WA
72 ms
12020 KB
s3_20.txt
WA
71 ms
12532 KB
s3_21.txt
WA
68 ms
12020 KB
s3_22.txt
WA
71 ms
11892 KB
s3_23.txt
WA
76 ms
14324 KB
s3_24.txt
WA
74 ms
13812 KB
s3_25.txt
WA
58 ms
10740 KB
s3_26.txt
WA
74 ms
13556 KB
s3_27.txt
WA
58 ms
10740 KB
s3_28.txt
WA
73 ms
13556 KB
s3_29.txt
WA
58 ms
10740 KB