Submission #2666715
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define ii pair<int, int> #define mp make_pair #define iii pair< int, pair<int, ii> > #define int long long #define FOR(a, b, c) for(int a = b; a <= c; ++a) const int N = 1e5 + 10; const int oo = 1e8; const int mod = 1e9 + 7; const double PI = acos(-1); int n; int res[N], la[N], pr[N]; vector<int> dsu[N]; struct book{ int u, v, val; } eg[N]; bool cmp(const book x, const book y) { return x.val < y.val; } void join(int u, int v, int val) { int pru = pr[u], prv = pr[v]; if(dsu[pru].size() < dsu[prv].size()) swap(pru, prv); int tmp = dsu[pru].size(); la[pru] += dsu[prv].size()*val; for(int j = 0; j < dsu[prv].size(); ++j) { int cur = dsu[prv][j]; pr[cur] = pru; dsu[pru].pb(cur); res[cur] += tmp*val; res[cur] += la[prv]; res[cur] -= la[pru]; } dsu[prv].clear(); } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for(int i = 1; i <= n; ++i) { pr[i] = i; dsu[i].pb(i); } for(int i = 1; i < n; ++i) { cin >> eg[i].u >> eg[i].v >> eg[i].val; } sort(eg + 1, eg + n, cmp); for(int i = n - 1; i >= 1; --i) { int u1 = eg[i].u, v1 = eg[i].v, val1 = eg[i].val; join(u1, v1, val1); } for(int i = 1; i <= n; ++i) cout << res[i] + la[pr[i]] << '\n'; }
Submission Info
Submission Time | |
---|---|
Task | E - Black Cats Deployment |
User | vjudge2 |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1344 Byte |
Status | AC |
Exec Time | 79 ms |
Memory | 18804 KB |
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 | 2 ms | 4480 KB |
s1_02.txt | AC | 3 ms | 4480 KB |
s1_03.txt | AC | 2 ms | 4480 KB |
s1_04.txt | AC | 2 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 | 47 ms | 12276 KB |
s2_09.txt | AC | 24 ms | 8312 KB |
s2_10.txt | AC | 15 ms | 6816 KB |
s2_11.txt | AC | 53 ms | 13048 KB |
s2_12.txt | AC | 56 ms | 13172 KB |
s2_13.txt | AC | 60 ms | 15604 KB |
s2_14.txt | AC | 58 ms | 16236 KB |
s3_15.txt | AC | 59 ms | 13296 KB |
s3_16.txt | AC | 31 ms | 9080 KB |
s3_17.txt | AC | 18 ms | 7040 KB |
s3_18.txt | AC | 30 ms | 8696 KB |
s3_19.txt | AC | 72 ms | 14324 KB |
s3_20.txt | AC | 72 ms | 15348 KB |
s3_21.txt | AC | 69 ms | 14196 KB |
s3_22.txt | AC | 69 ms | 14196 KB |
s3_23.txt | AC | 79 ms | 18804 KB |
s3_24.txt | AC | 78 ms | 17772 KB |
s3_25.txt | AC | 52 ms | 12660 KB |
s3_26.txt | AC | 70 ms | 17388 KB |
s3_27.txt | AC | 52 ms | 12660 KB |
s3_28.txt | AC | 71 ms | 17528 KB |
s3_29.txt | AC | 54 ms | 12660 KB |