Submission #3387017
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <string> #include <sstream> #include <complex> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> using namespace std; #define mod 1000000007 #define FOR(x,to) for(int x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) #define long long long inline int rei(){int x;cin>>x;return x;} inline long rel(){long x;cin>>x;return x;} inline string res(){string x;cin>>x;return x;} //------------------------------------------------------- struct UnionFind{ vector<int> par; UnionFind(int N){ par.resize(N); for(int i=0;i<N;i++){ par[i] = i; } } void Union(int x,int y){ par[Get(x)] = Get(y); } bool Same(int x,int y){ return Get(x) == Get(y); } int Get(int x){ if(x != par[x]){ par[x] = Get(par[x]); } return par[x]; } }; vector<tuple<long,int,int>> Edge; pair<int,int> G[199999]; int To[100000]; long ans[100000]; int child[199999]; long cost[199999]; void Calc(){ int N = rei(); for(int i=0;i<N-1;i++){ To[i] = i; int a = rei()-1; int b = rei()-1; long c = rel(); Edge.push_back({c,a,b}); } To[N-1] = N-1; sort(Edge.begin(),Edge.end()); UnionFind U(N); int d = N; for(int i=N-2;i>=0;i--){ G[d].first = To[U.Get(get<1>(Edge[i]))]; G[d].second = To[U.Get(get<2>(Edge[i]))]; U.Union(get<1>(Edge[i]),get<2>(Edge[i])); cost[d] = get<0>(Edge[i]); To[U.Get(get<1>(Edge[i]))] = d++; } stack<int> sp; sp.push(d-1); while(!sp.empty()){ int v = sp.top(); sp.pop(); if(v >= d){ v -= d; child[v] = 1; if(v >= N){ child[v] += child[G[v].first] + child[G[v].second]; } } else{ sp.push(v+d); if(v >= N){ sp.push(G[v].first); sp.push(G[v].second); } } } for(int i=0;i<d;i++){ child[i] = (child[i]+1) / 2; } stack<pair<int,long>> sp2; sp2.push({d-1,0}); while(!sp2.empty()){ int v = sp2.top().first; long c = sp2.top().second; sp2.pop(); if(v < N){ ans[v] = c; } else{ sp2.push({G[v].first,c + child[G[v].second]*cost[v]}); sp2.push({G[v].second,c + child[G[v].first]*cost[v]}); } } for(int i=0;i<N;i++){ cout << ans[i] << endl; } } int main(int argc,char** argv){ ios::sync_with_stdio(false), cin.tie(0); cout.tie(0); Calc(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Black Cats Deployment |
User | leign |
Language | C++14 (Clang 3.8.0) |
Score | 800 |
Code Size | 2665 Byte |
Status | AC |
Exec Time | 481 ms |
Memory | 8560 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 | 2304 KB |
00_example_02.txt | AC | 1 ms | 2304 KB |
00_example_03.txt | AC | 2 ms | 2304 KB |
s1_01.txt | AC | 4 ms | 2304 KB |
s1_02.txt | AC | 4 ms | 2304 KB |
s1_03.txt | AC | 4 ms | 2304 KB |
s1_04.txt | AC | 6 ms | 2432 KB |
s1_05.txt | AC | 6 ms | 2432 KB |
s1_06.txt | AC | 6 ms | 2432 KB |
s1_07.txt | AC | 2 ms | 2304 KB |
s2_08.txt | AC | 365 ms | 6512 KB |
s2_09.txt | AC | 178 ms | 4212 KB |
s2_10.txt | AC | 104 ms | 3448 KB |
s2_11.txt | AC | 414 ms | 7024 KB |
s2_12.txt | AC | 415 ms | 7024 KB |
s2_13.txt | AC | 416 ms | 6896 KB |
s2_14.txt | AC | 413 ms | 7024 KB |
s3_15.txt | AC | 429 ms | 7152 KB |
s3_16.txt | AC | 210 ms | 4468 KB |
s3_17.txt | AC | 121 ms | 3576 KB |
s3_18.txt | AC | 210 ms | 4596 KB |
s3_19.txt | AC | 481 ms | 7792 KB |
s3_20.txt | AC | 480 ms | 7664 KB |
s3_21.txt | AC | 478 ms | 7920 KB |
s3_22.txt | AC | 478 ms | 7792 KB |
s3_23.txt | AC | 479 ms | 7408 KB |
s3_24.txt | AC | 468 ms | 7536 KB |
s3_25.txt | AC | 478 ms | 8560 KB |
s3_26.txt | AC | 469 ms | 7536 KB |
s3_27.txt | AC | 470 ms | 8560 KB |
s3_28.txt | AC | 464 ms | 7536 KB |
s3_29.txt | AC | 478 ms | 8560 KB |