Submission #3386998
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 (GCC 5.4.1) |
Score | 0 |
Code Size | 2665 Byte |
Status | CE |
Compile Error
./Main.cpp: In function ‘void Calc()’: ./Main.cpp:63:25: error: converting to ‘std::vector<std::tuple<long long int, int, int> >::value_type {aka std::tuple<long long int, int, int>}’ from initializer list would use explicit constructor ‘constexpr std::tuple< <template-parameter-1-1> >::tuple(_UElements&& ...) [with _UElements = {long long int&, int&, int&}; <template-parameter-2-2> = void; _Elements = {long long int, int, int}]’ Edge.push_back({c,a,b}); ^