結果
問題 | No.1002 Twotone |
ユーザー | cureskol |
提出日時 | 2022-12-19 20:18:26 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,413 ms / 5,000 ms |
コード長 | 11,337 bytes |
コンパイル時間 | 6,100 ms |
コンパイル使用メモリ | 252,520 KB |
実行使用メモリ | 39,420 KB |
最終ジャッジ日時 | 2023-08-11 09:55:29 |
合計ジャッジ時間 | 24,802 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,384 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,384 KB |
testcase_03 | AC | 371 ms
25,272 KB |
testcase_04 | AC | 540 ms
31,596 KB |
testcase_05 | AC | 530 ms
31,624 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 219 ms
20,400 KB |
testcase_08 | AC | 404 ms
31,364 KB |
testcase_09 | AC | 410 ms
31,420 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 509 ms
25,180 KB |
testcase_12 | AC | 772 ms
31,340 KB |
testcase_13 | AC | 842 ms
31,536 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 334 ms
19,340 KB |
testcase_16 | AC | 752 ms
31,492 KB |
testcase_17 | AC | 769 ms
31,648 KB |
testcase_18 | AC | 2 ms
4,380 KB |
testcase_19 | AC | 772 ms
31,752 KB |
testcase_20 | AC | 894 ms
39,420 KB |
testcase_21 | AC | 915 ms
39,008 KB |
testcase_22 | AC | 2 ms
4,380 KB |
testcase_23 | AC | 511 ms
24,020 KB |
testcase_24 | AC | 1,049 ms
37,684 KB |
testcase_25 | AC | 1,413 ms
36,524 KB |
testcase_26 | AC | 2 ms
4,384 KB |
testcase_27 | AC | 88 ms
22,048 KB |
testcase_28 | AC | 154 ms
31,428 KB |
testcase_29 | AC | 137 ms
31,600 KB |
testcase_30 | AC | 2 ms
4,384 KB |
testcase_31 | AC | 137 ms
31,248 KB |
testcase_32 | AC | 157 ms
31,636 KB |
testcase_33 | AC | 134 ms
31,496 KB |
testcase_34 | AC | 1,378 ms
36,720 KB |
ソースコード
#pragma region template #pragma GCC optimize("Ofast") #include <bits/stdc++.h> using namespace std; using ll=long long; using ld=long double; using vi=vector<int>; using vll=vector<ll>; using pi=pair<int,int>; using pll=pair<ll,ll>; #define overload2(a,b,c,...) c #define overload3(a,b,c,d,...) d #define overload4(a,b,c,d,e,...) e #define overload5(a,b,c,d,e,f,...) f #define TYPE1(T) template<typename T> #define TYPE2(T,U) template<typename T,typename U> #define TYPE(...) overload2(__VA_ARGS__,TYPE2,TYPE1)(__VA_ARGS__) #define TYPES1(T) template<typename... T> #define TYPES2(H,T) template<typename H,typename... T> #define TYPES(...) overload2(__VA_ARGS__,TYPES2,TYPES1)(__VA_ARGS__) #define REP4(i,s,n,d) for(int i=(s);i<(n);i+=(d)) #define REP3(i,s,n) REP4(i,s,n,1) #define REP2(i,n) REP3(i,0,n) #define REP1(n) REP2(tomato,n) #define REP(...) overload4(__VA_ARGS__,REP4,REP3,REP2,REP1)(__VA_ARGS__) #define RREP4(i,n,s,d) for(int i=(n)-1;i>=s;i-=d) #define RREP3(i,n,s) RREP4(i,n,s,1) #define RREP2(i,n) RREP3(i,n,0) #define RREP1(n) RREP2(tomato,n) #define RREP(...) overload4(__VA_ARGS__,RREP4,RREP3,RREP2,RREP1)(__VA_ARGS__) #define FOR4(a,b,c,d,v) for(auto [a,b,c,d]:v) #define FOR3(a,b,c,v) for(auto [a,b,c]:v) #define FOR2(a,b,v) for(auto [a,b]:v) #define FOR1(a,v) for(auto a:v) #define FOR(...) overload5(__VA_ARGS__,FOR4,FOR3,FOR2,FOR1)(__VA_ARGS__) #define AFOR4(a,b,c,d,v) for(auto&[a,b,c,d]:v) #define AFOR3(a,b,c,v) for(auto&[a,b,c]:v) #define AFOR2(a,b,v) for(auto&[a,b]:v) #define AFOR1(a,v) for(auto&a:v) #define AFOR(...) overload5(__VA_ARGS__,AFOR4,AFOR3,AFOR2,AFOR1)(__VA_ARGS__) #define CFOR4(a,b,c,d,v) for(const auto&[a,b,c,d]:v) #define CFOR3(a,b,c,v) for(const auto&[a,b,c]:v) #define CFOR2(a,b,v) for(const auto&[a,b]:v) #define CFOR1(a,v) for(const auto&a:v) #define CFOR(...) overload5(__VA_ARGS__,CFOR4,CFOR3,CFOR2,CFOR1)(__VA_ARGS__) #define ALL(v) v.begin(),v.end() #define RALL(v) v.rbegin(),v.rend() #define SORT(v) sort(ALL(v)) #define RSORT(v) sort(RALL(v)) #define REVERSE(v) reverse(ALL(v)) #define UNIQUE(v) SORT(v),v.erase(unique(ALL(v)),v.end()) TYPES(T) void input(T&... a){ (cin>>...>>a); } #define DECLARE(T,...) T __VA_ARGS__;input(__VA_ARGS__); #define INT(...) DECLARE(int,__VA_ARGS__) #define STR(...) DECLARE(string,__VA_ARGS__) #define LL(...) DECLARE(long long,__VA_ARGS__) #define CHR(...) DECLARE(char,__VA_ARGS__) #define DBL(...) DECLARE(double,__VA_ARGS__) #define VI(n,v) vi v(n);cin>>v; #define VLL(n,v) vll v(n);cin>>v; TYPE(T) istream&operator>>(istream&is,vector<T>&v){ for(auto&a:v)cin>>a; return is; } TYPE(T) ostream&operator<<(ostream&os,const vector<T>&v){ if(&os==&cerr)os<<"["; REP(i,v.size()){ os<<v[i]; if(i+1<v.size())os<<(&os==&cerr?",":" "); } if(&os==&cerr)os<<"]"; return os; } TYPE(T,S) istream&operator>>(istream&is,pair<T,S>&p){ cin>>p.first>>p.second; return is; } #ifdef __LOCAL #include <debug> #else #define debug(...) void(0) #endif void print(){ cout << '\n'; } TYPES(T,Ts) void print(const T& a,const Ts&... b){ cout<<a; (cout<<...<<(cout<< ' ',b)); cout << '\n'; } TYPE(T) using pq=priority_queue<T>; TYPE(T) using pqg=priority_queue<T,vector<T>,greater<T>>; TYPE(T) T pick(queue<T>& que){assert(que.size()); T a=que.front();que.pop();return a;} TYPE(T) T pick(pq<T>& que){assert(que.size()); T a=que.top();que.pop();return a;} TYPE(T) T pick(pqg<T>& que){assert(que.size()); T a=que.top();que.pop();return a;} TYPE(T) T pick(stack<T>& sta){assert(sta.size()); T a=sta.top();sta.pop();return a;} string YES(bool f=true){return (f?"YES":"NO");} string Yes(bool f=true){return (f?"Yes":"No");} string yes(bool f=true){return (f?"yes":"no");} constexpr int INF=1e9+7; constexpr ll LINF=ll(1e18)+7; constexpr ld EPS=1e-10; vi iota(int n){vi a(n);iota(ALL(a),0);return a;} TYPE(T) vector<pair<T,int>> query_sort(const vector<T>&v){ vector<pair<T,int>> order(v.size()); REP(i,v.size())order[i]={v[i],i}; SORT(order); return order; } TYPE(T) T rev(T a){ REVERSE(a);return a; } TYPE(T) void fin(T a){cout<<a<<endl;exit(0);} TYPE(T) bool chmax(T &a,T b){return (a<b&&(a=b,true));} TYPE(T) bool chmin(T &a,T b){return (a>b&&(a=b,true));} TYPES(T,Ns) auto make_vector(T x,int n,Ns ...ns){ if constexpr(sizeof...(ns)==0)return vector<T>(n,x); else return vector(n,make_vector<T>(x,ns...)); } bool in(const ll S,const int a){return (S>>a)&1;} int popcount(const ll S){return __builtin_popcountll(S);} int digit(char c){ return (c>='0' and c<='9' ? c-'0' : -1);} #pragma endregion template template<typename T> struct WeightedEdge{ WeightedEdge()=default; WeightedEdge(int from,int to,T weight):from(from),to(to),weight(weight){} int from,to; T weight; }; template<typename T> struct WeightedGraph{ int n; using weight_type=T; using edge_type=WeightedEdge<T>; vector<edge_type> edges; protected: vector<int> in_deg; bool prepared; class OutgoingEdges{ WeightedGraph* g; int l,r; public: OutgoingEdges(WeightedGraph* g,int l,int r):g(g),l(l),r(r){} edge_type* begin(){ return &(g->edges[l]); } edge_type* end(){ return &(g->edges[r]); } edge_type& operator[](int i){ return g->edges[l+i]; } int size()const{ return r-l; } }; public: OutgoingEdges operator[](int v){ assert(prepared); return { this,in_deg[v],in_deg[v+1] }; } bool is_prepared()const{ return prepared; } WeightedGraph():n(0),in_deg(1,0),prepared(false){} WeightedGraph(int n):n(n),in_deg(n+1,0),prepared(false){} WeightedGraph(int n,int m,bool directed=false,int indexed=1): n(n),in_deg(n+1,0),prepared(false){ scan(m,directed,indexed); } void resize(int n){n=n;} void add_arc(int from,int to,T weight){ assert(!prepared); assert(0<=from and from<n and 0<=to and to<n); edges.emplace_back(from,to,weight); in_deg[from+1]++; } void add_edge(int u,int v,T weight){ add_arc(u,v,weight); add_arc(v,u,weight); } void add_arc(const edge_type&e){ add_arc(e.from,e.to,e.weight); } void add_edge(const edge_type&e){ add_edge(e.from,e.to,e.weight); } void scan(int m,bool directed=false,int indexed=1){ edges.reserve(directed?m:2*m); while(m--){ int u,v;cin>>u>>v;u-=indexed;v-=indexed; T weight;cin>>weight; if(directed)add_arc(u,v,weight); else add_edge(u,v,weight); } build(); } void build(){ assert(!prepared);prepared=true; for(int v=0;v<n;v++)in_deg[v+1]+=in_deg[v]; vector<edge_type> new_edges(in_deg.back()); auto counter=in_deg; for(auto&&e:edges)new_edges[ counter[e.from]++ ]=e; edges=new_edges; } void graph_debug()const{ #ifndef __LOCAL return; #endif assert(prepared); for(int from=0;from<n;from++){ cerr<<from<<";"; for(int i=in_deg[from];i<in_deg[from+1];i++) cerr<<"("<<edges[i].to<<","<<edges[i].weight<<")"; cerr<<"\n"; } } }; template<typename T> struct WeightedTree:WeightedGraph<T>{ using WeightedGraph<T>::WeightedGraph; using edge_type=typename WeightedGraph<T>::edge_type; using OutgoingEdges=typename WeightedGraph<T>::OutgoingEdges; using WeightedGraph<T>::n; using WeightedGraph<T>::in_deg; int root=-1; vector<int> DFS,BFS,depth; void scan_root(int indexed=1){ for(int i=1;i<n;i++){ int p;cin>>p; T weight;cin>>weight; add_edge(p-indexed,i,weight); } build(); } void scan(int indexed=1){ WeightedGraph<T>::scan(n-1,false,indexed); build(); } edge_type& parent(int v){ assert(~root and root!=v); return (*this)[v][0]; } OutgoingEdges son(int v){ assert(~root); if(v==root)return {this,in_deg[v],in_deg[v+1]}; return {this,in_deg[v]+1,in_deg[v+1]}; } private: void dfs(int v,int pre=-1){ for(auto&e:(*this)[v]){ if(e.to==pre)swap((*this)[v][0],e); else{ depth[e.to]=depth[v]+1; dfs(e.to,v); } } DFS.push_back(v); } public: void build(int r=0){ if(!WeightedGraph<T>::is_prepared())WeightedGraph<T>::build(); if(~root){ assert(r==root); return; } root=r; depth=vector<int>(n,0); DFS.reserve(n);BFS.reserve(n); dfs(root); queue<int> que; que.push(root); while(que.size()){ int p=que.front();que.pop(); BFS.push_back(p); for(const auto&e:son(p))que.push(e.to); } } }; template<typename TREE> class CentroidDecomposition{ TREE T; vector<int> sz,pre,timing; int find_centroid(int v){ vector<int> S{v}; pre[v]=-1; for(int i=0;i<S.size();i++){ const int u=S[i]; sz[u]=1; for(const auto&e:T[u]){ if(e.to==pre[u]||~timing[e.to])continue; pre[e.to]=u; S.push_back(e.to); } } int SZ=S.size(); reverse(S.begin(),S.end()); for(int u:S){ if( SZ-sz[u] <= SZ/2 )return u; sz[pre[u]] += sz[u]; } assert(false); return -1; }; public: vector<int> order; CentroidDecomposition(TREE T):T(T),sz(T.n),pre(T.n),timing(T.n,-1){ order.reserve(T.n); queue<int> que; que.push(0); while(que.size()){ int c=find_centroid(que.front());que.pop(); timing[c]=order.size(); order.push_back(c); for(const auto&e:T[c]) if(timing[e.to]<0) que.push(e.to); } } template<typename X,typename F,typename G,typename H> void calc(int root,X initial_val,const F&f,const G&g,const H&h){ h(); queue<tuple<int,int,X>> que; for(const auto&e:T[root]){ if(timing[e.to]<=timing[root])continue; que.emplace(e.to,root,f(initial_val,e)); while(que.size()){ auto [v,pre,val]=pick(que); g(val,false); for(const auto&e2:T[v]){ if(e2.to==pre||timing[e2.to]<=timing[root])continue; que.emplace(e2.to,v,f(val,e2)); } } h(); } que.emplace(root,-1,initial_val); while(que.size()){ auto [v,pre,val]=pick(que); g(val,true); for(const auto&e:T[v]){ if(e.to==pre||timing[e.to]<=timing[root])continue; que.emplace(e.to,v,f(val,e)); } } } }; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); INT(n,k); WeightedTree<int> T(n); T.scan(1); ll ans=0; CentroidDecomposition CD(T); map<pair<int,int>,int> m2; map<int,int> m1,m2_sum; int m1_sum; bool empty; auto F=[&](const pair<int,int>&cc,const auto&e){ auto [c1,c2]=cc; int c=e.weight; if(c1==-1)return make_pair(c1,c2); if(c1==c||c2==c)return make_pair(c1,c2); if(c2<INF)return make_pair(-1,-1); if(c>c1)swap(c,c1); return make_pair(c,c1); }; auto G=[&](pair<int,int>cc,bool add){ auto [c1,c2]=cc; if(c1==-1)return; ll sum=0; if(c2<INF){ if(m2.count(cc))sum+=m2[cc]; if(m1.count(c1))sum+=m1[c1]; if(m1.count(c2))sum+=m1[c2]; if(empty)sum++; m2[cc]++; m2_sum[c1]++; m2_sum[c2]++; } else if(c1<INF){ sum+=m1_sum; if(m1.count(c1))sum-=m1[c1]; if(m2_sum.count(c1))sum+=m2_sum[c1]; m1_sum++; m1[c1]++; } else empty=true; if(add)ans+=sum; else ans-=sum; }; auto H=[&](){ m2.clear(); m1.clear(); m2_sum.clear(); m1_sum=empty=0; }; REP(i,n) CD.calc(i,make_pair(INF,INF),F,G,H); cout<<ans<<endl; }