結果
| 問題 | No.1002 Twotone |
| ユーザー |
 t9unkubj
|
| 提出日時 | 2024-10-04 05:03:17 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2,381 ms / 5,000 ms |
| コード長 | 7,198 bytes |
| コンパイル時間 | 5,001 ms |
| コンパイル使用メモリ | 289,828 KB |
| 実行使用メモリ | 80,068 KB |
| 最終ジャッジ日時 | 2024-10-04 05:03:52 |
| 合計ジャッジ時間 | 33,761 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 33 |
ソースコード
#ifdef t9unkubj#include"template.h"//#include"template_no_debug.h"#else#undef _GLIBCXX_DEBUG#pragma GCC optimize("O3")#define dbg(...) 199958using namespace std;#include<bits/stdc++.h>using uint=unsigned;using ll=long long;using ull=unsigned long long;using ld=long double;using pii=pair<int,int>;using pll=pair<ll,ll>;template<class T>using vc=vector<T>;template<class T>using vvc=vc<vc<T>>;template<class T>using vvvc=vvc<vc<T>>;using vi=vc<int>;using vvi=vc<vi>;using vvvi=vc<vvi>;using vl=vc<ll>;using vvl=vc<vl>;using vvvl=vc<vvl>;template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;template<class T>using bipq=priority_queue<T>;#define rep(i,n) for(ll i=0;i<(ll)(n);i++)#define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++)#define DREP(i,n,m) for(ll i=(n);i>=(m);i--)#define drep(i,n) for(ll i=((n)-1);i>=0;i--)#define all(x) x.begin(),x.end()#define rall(x) x.rbegin(),x.rend()#define mp make_pair#define pb push_back#define eb emplace_back#define fi first#define se second#define is insert#define bg begin()#define ed end()void scan(int&a) { cin >> a; }void scan(ll&a) { cin >> a; }void scan(string&a) { cin >> a; }void scan(char&a) { cin >> a; }void scan(uint&a) { cin >> a; }void scan(ull&a) { cin >> a; }void scan(bool&a) { cin >> a; }void scan(ld&a){ cin>> a;}template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); }void read() {}template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); }#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__);#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__);#define LD(...) ld __VA_ARGS__; read(__VA_ARGS__);#define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name);#define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name);void print(int a) { cout << a; }void print(ll a) { cout << a; }void print(string a) { cout << a; }void print(char a) { cout << a; }void print(uint a) { cout << a; }void print(bool a) { cout << a; }void print(ull a) { cout << a; }void print(double a) { cout << a; }void print(ld a){ cout<< a; }template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;}void PRT() { cout <<endl; return ; }template<class T> void PRT(T a) { print(a); cout <<endl; return; }template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; }template<class T,class F>bool chmin(T &x, F y){if(x>y){x=y;return true;}return false;}template<class T, class F>bool chmax(T &x, F y){if(x<y){x=y;return true;}return false;}void YesNo(bool b){cout<<(b?"Yes":"No")<<endl;}void Yes(){cout<<"Yes"<<endl;}void No(){cout<<"No"<<endl;}template<class T>int popcount(T n){return __builtin_popcountll(n);}template<class T>T sum(vc<T>&a){return accumulate(all(a),T(0));}template<class T>T max(vc<T>&a){return *max_element(all(a));}template<class T>T min(vc<T>&a){return *min_element(all(a));}template<class T>void unique(vc<T>&a){a.erase(unique(all(a)),a.end());}vvi readgraph(int n,int m,int off = -1){vvi g(n);rep(i, m){int u,v;cin>>u>>v;u+=off,v+=off;g[u].push_back(v);g[v].push_back(u);}return g;}vvi readtree(int n,int off=-1){return readgraph(n,n-1,off);}template<class T>vc<T> presum(vc<T> &a){vc<T> ret(a.size()+1);rep(i,a.size())ret[i+1]=ret[i]+a[i];return ret;}template<class T, class F>vc<T> &operator+=(vc<T> &a,F b){for (auto&v:a)v += b;return a;}template<class T, class F>vc<T> &operator-=(vc<T>&a,F b){for (auto&v:a)v-=b;return a;}template<class T, class F>vc<T> &operator*=(vc<T>&a,F b){for (auto&v:a)v*=b;return a;}#endifdouble pass_time=0;ll ans=0;vc<pii>G[int(2e5)];struct centroid_decomposition{vector<int>rem,si;vector<vector<int>>g;centroid_decomposition(int n):rem(n),si(n),g(n){}void add_edge(int a,int b){g[a].push_back(b);g[b].push_back(a);}int get_centroid(int v){vector<int>ver;auto dfs=[&](auto&dfs,int u,int v)->void{ver.emplace_back(u);si[u]=1;for(auto x:g[u]){if(rem[x]||x==v)continue;dfs(dfs,x,u);si[u]+=si[x];}};dfs(dfs,v,-1);int now=(int)1e9;int now_idx=-1;for(auto x:ver){if(si[x]*2>=(int)ver.size()){if(now>si[x]){now=si[x];now_idx=x;}}}assert(now_idx!=-1);return now_idx;}void decomposition(int v){int t=get_centroid(v);assert(!rem[t]);rem[t]=1;//二色ペアmap<pair<int,int>,int>ma0;//二色ペア,一色の累積map<int,int>ma1;dbg(t);//一色int sms=0;map<int,int>ma2;for(auto [x,c]:G[t]){if(rem[x])continue;vc<vi>vs;auto dfs=[&](auto&dfs,int u,int v,unordered_set<int>&st)->void{dbg(u);vi tt;for(auto&x:st)tt.pb(x);if(tt.size()==2&&tt[0]>tt[1])swap(tt[0],tt[1]);vs.pb(tt);if(tt.size()==2){ans+=ma0[{tt[0],tt[1]}];ans+=ma2[tt[0]]+ma2[tt[1]];++ans;}else{ans+=sms-ma2[tt[0]];ans+=ma1[tt[0]];}for(auto [x,c]:G[u]){if(!rem[x]&&x!=v){auto nxt=st;nxt.insert(c);if(nxt.size()<=2){dfs(dfs,x,u,nxt);}}}};unordered_set<int>st{c};dfs(dfs,x,t,st);dbg(vs);for(auto&x:vs){if(x.size()==1)ma2[x[0]]++,sms++;else{ma0[{x[0],x[1]}]++;ma1[x[0]]++;ma1[x[1]]++;}}}dbg(ans);for(auto x:g[t]){if(!rem[x])decomposition(x);}rem[t]=0;}};void solve(){INT(n,k);centroid_decomposition g(n);rep(i,n-1){INT(u,v,c);--u,--v;g.add_edge(u,v);G[u].pb({v,c});G[v].pb({u,c});}g.decomposition(0);PRT(ans);}signed main(){cin.tie(0)->sync_with_stdio(0);pass_time=clock();int t=1;//cin>>t;while(t--)solve();pass_time=clock()-pass_time;dbg(pass_time/CLOCKS_PER_SEC);}