Submission #3316382
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define fi(a, b) for(int i=a; i<=b; i++)
#define fj(a, b) for(int j=a; j<=b; j++)
#define fo(a, b) for(int o=a; o<=b; o++)
#define fdi(a, b) for(int i=a; i>=b; i--)
#define fdj(a, b) for(int j=a; j>=b; j--)
#define fdo(a, b) for(int o=a; o>=b; o--)
#ifdef LOCAL
#define err(...) fprintf(stderr, __VA_ARGS__)
#else
#define err(...) while(false) {}
#endif
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef long double ld;
typedef unsigned long long ull;
/////////////////////////////////
int const MAX = 1e5 + 41;
int n;
int a[MAX];
int b[MAX];
int c[MAX];
vi per;
bool cmp(int i, int j) {
return c[i] > c[j];
}
int par[MAX];
ll ans[MAX];
ll add[MAX];
vi ver[MAX];
int find(int x) {
if (par[x] == x) return x;
return par[x] = find(par[x]);
}
void solve() {
fi(1, n - 1) {
per.pb(i);
}
sort(per.begin(), per.end(), cmp);
fi(1, n) {
par[i] = i;
ver[i].pb(i);
}
for (int id : per) {
int x = find(a[id]);
int y = find(b[id]);
if (sz(ver[x]) < sz(ver[y])) {
swap(x, y);
}
for (int z : ver[y]) {
ans[z] += add[y];
ans[z] += (ll) (sz(ver[x]) - sz(ver[y])) * c[id];
ans[z] -= add[x];
}
add[y] = 0;
add[x] += (ll) sz(ver[y]) * c[id];
ver[x].insert(ver[x].end(), ver[y].begin(), ver[y].end());
par[y] = x;
}
fi(1, n) {
ans[i] += add[find(i)];
printf("%lld\n", ans[i]);
}
}
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
scanf("%d", &n);
fi(1, n - 1) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
}
solve();
#ifdef LOCAL
err("ELAPSED TIME: %.3Lf\n", (ld) clock() / CLOCKS_PER_SEC);
#endif
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Black Cats Deployment |
User |
Filyan |
Language |
C++14 (GCC 5.4.1) |
Score |
800 |
Code Size |
2001 Byte |
Status |
AC |
Exec Time |
83 ms |
Memory |
14060 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:94:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:96:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &a[i], &b[i], &c[i]);
^
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
200 / 200 |
400 / 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 |
2 ms |
4352 KB |
00_example_02.txt |
AC |
2 ms |
4352 KB |
00_example_03.txt |
AC |
2 ms |
4352 KB |
s1_01.txt |
AC |
3 ms |
4352 KB |
s1_02.txt |
AC |
3 ms |
4352 KB |
s1_03.txt |
AC |
3 ms |
4352 KB |
s1_04.txt |
AC |
3 ms |
4480 KB |
s1_05.txt |
AC |
3 ms |
4480 KB |
s1_06.txt |
AC |
3 ms |
4480 KB |
s1_07.txt |
AC |
2 ms |
4352 KB |
s2_08.txt |
AC |
52 ms |
10448 KB |
s2_09.txt |
AC |
26 ms |
7248 KB |
s2_10.txt |
AC |
16 ms |
6120 KB |
s2_11.txt |
AC |
59 ms |
11256 KB |
s2_12.txt |
AC |
61 ms |
11120 KB |
s2_13.txt |
AC |
59 ms |
12280 KB |
s2_14.txt |
AC |
55 ms |
12780 KB |
s3_15.txt |
AC |
66 ms |
11128 KB |
s3_16.txt |
AC |
34 ms |
7644 KB |
s3_17.txt |
AC |
20 ms |
6144 KB |
s3_18.txt |
AC |
33 ms |
7548 KB |
s3_19.txt |
AC |
76 ms |
12024 KB |
s3_20.txt |
AC |
79 ms |
12408 KB |
s3_21.txt |
AC |
77 ms |
11896 KB |
s3_22.txt |
AC |
77 ms |
11736 KB |
s3_23.txt |
AC |
83 ms |
14060 KB |
s3_24.txt |
AC |
70 ms |
13776 KB |
s3_25.txt |
AC |
57 ms |
11256 KB |
s3_26.txt |
AC |
68 ms |
13524 KB |
s3_27.txt |
AC |
57 ms |
11256 KB |
s3_28.txt |
AC |
68 ms |
13468 KB |
s3_29.txt |
AC |
57 ms |
11256 KB |