//~ while (clock()<=69*CLOCKS_PER_SEC) //~ #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("O3") //~ #pragma GCC optimize("Ofast") //~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //~ #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using ll=long long; using ld=long double; using pii=pair<int, int>; using pll=pair<ll, ll>; using vi=vector<int>; using vll=vector<ll>; template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<" = "<<h<<endl; } #ifdef LOCAL #define _upgrade ios_base::sync_with_stdio(0); #define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__); #else #define _upgrade ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); #define debug(...) 98; #define cerr if(0) cout #endif #define pb push_back #define mp make_pair #define all(x) x.begin(),x.end() #define sz(x) ((int)(x).size()) #define fi first #define se second #define erase_duplicates(x) sort(all(x)), (x).resize(distance((x).begin(), unique(all(x)))); #define watch(x) cout << (#x) << " is " << (x) << endl; #define pow2(x) ((x)*(x)) #define mod(x, m) ((((x) % (m)) + (m)) % (m)) #define max3(a, b, c) max(a, max(b, c)) #define min3(a, b, c) min(a, min(b, c)) #define REP(i, a, b) for(int i = a; i <= b; ++i) #define REPV(i, b, a) for(int i = b; i >= a; --i) const double m_pi = acos(-1.0); const int int_max = 0x3f3f3f3f; const int M7 = 1000*1000*1000+7; const int M9 = 1000*1000*1000+9; vector<pair<int, int > > tos[30009]; long long npot[100009]; //const long long MOD1 = 1LL*M7*M7; long long tempvs1; vector<long long> odls1; void dfs1(int pos, int ojc, int dziad){ //odl[dziad][pos]=temp; if(dziad<pos)odls1.pb(tempvs1); for(int i=0;i<sz(tos[pos]);++i){ pii too = tos[pos][i]; if(too.fi == ojc)continue; tempvs1+=npot[too.se]; dfs1(too.fi, pos, dziad); tempvs1-=npot[too.se]; } } vector<short> tempvs; vector<vector<short> > odls; void dfs2(int pos, int ojc, int dziad){ //odl[dziad][pos]=temp; if(dziad<pos)odls.pb(tempvs); for(int i=0;i<sz(tos[pos]);++i){ pii too = tos[pos][i]; if(too.fi == ojc)continue; tempvs.pb(too.se); dfs2(too.fi, pos, dziad); tempvs.pop_back(); } } vector<long long> qwe; int maxp = 0; int brutq = 0; int main(){ _upgrade cout<<fixed<<setprecision(15); int n, k;cin>>n>>k; for(int i=0;i<n-1;++i){ int a, b, p; cin>>a>>b>>p; tos[a].pb({b, p}); tos[b].pb({a, p}); maxp=max(maxp, p); } npot[1]=1; for(int i=2;i<=max(maxp, 4);++i){ long long temp = npot[i-1]; temp*=n; if(maxp>4)temp%=M7; npot[i]=temp; } if(maxp <= 4){ for(int i=1;i<=n;++i){ dfs1(i, i, i); } sort(all(odls1)); cout<<odls1[k-1]%M7*npot[2]%M7<<"\n"; } else{ for(int i=1;i<=n;++i){ dfs2(i, i, i); } for(int i=0;i<sz(odls);++i){ sort(all(odls[i])); reverse(all(odls[i])); } sort(all(odls)); long long www=0; for(int i=0;i<sz(odls[k-1]);++i){//cerr<<odls[k-1][i]<<" "; www+=npot[odls[k-1][i]]; www%=M7; }//cerr<<endl; cout<<www*npot[2]%M7<<"\n"; } return 0; } /* __builtin_popcount count total set bits on a given integer (use __builtin_popcountll for long long). */
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 | //~ while (clock()<=69*CLOCKS_PER_SEC) //~ #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("O3") //~ #pragma GCC optimize("Ofast") //~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //~ #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using ll=long long; using ld=long double; using pii=pair<int, int>; using pll=pair<ll, ll>; using vi=vector<int>; using vll=vector<ll>; template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<" = "<<h<<endl; } #ifdef LOCAL #define _upgrade ios_base::sync_with_stdio(0); #define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__); #else #define _upgrade ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); #define debug(...) 98; #define cerr if(0) cout #endif #define pb push_back #define mp make_pair #define all(x) x.begin(),x.end() #define sz(x) ((int)(x).size()) #define fi first #define se second #define erase_duplicates(x) sort(all(x)), (x).resize(distance((x).begin(), unique(all(x)))); #define watch(x) cout << (#x) << " is " << (x) << endl; #define pow2(x) ((x)*(x)) #define mod(x, m) ((((x) % (m)) + (m)) % (m)) #define max3(a, b, c) max(a, max(b, c)) #define min3(a, b, c) min(a, min(b, c)) #define REP(i, a, b) for(int i = a; i <= b; ++i) #define REPV(i, b, a) for(int i = b; i >= a; --i) const double m_pi = acos(-1.0); const int int_max = 0x3f3f3f3f; const int M7 = 1000*1000*1000+7; const int M9 = 1000*1000*1000+9; vector<pair<int, int > > tos[30009]; long long npot[100009]; //const long long MOD1 = 1LL*M7*M7; long long tempvs1; vector<long long> odls1; void dfs1(int pos, int ojc, int dziad){ //odl[dziad][pos]=temp; if(dziad<pos)odls1.pb(tempvs1); for(int i=0;i<sz(tos[pos]);++i){ pii too = tos[pos][i]; if(too.fi == ojc)continue; tempvs1+=npot[too.se]; dfs1(too.fi, pos, dziad); tempvs1-=npot[too.se]; } } vector<short> tempvs; vector<vector<short> > odls; void dfs2(int pos, int ojc, int dziad){ //odl[dziad][pos]=temp; if(dziad<pos)odls.pb(tempvs); for(int i=0;i<sz(tos[pos]);++i){ pii too = tos[pos][i]; if(too.fi == ojc)continue; tempvs.pb(too.se); dfs2(too.fi, pos, dziad); tempvs.pop_back(); } } vector<long long> qwe; int maxp = 0; int brutq = 0; int main(){ _upgrade cout<<fixed<<setprecision(15); int n, k;cin>>n>>k; for(int i=0;i<n-1;++i){ int a, b, p; cin>>a>>b>>p; tos[a].pb({b, p}); tos[b].pb({a, p}); maxp=max(maxp, p); } npot[1]=1; for(int i=2;i<=max(maxp, 4);++i){ long long temp = npot[i-1]; temp*=n; if(maxp>4)temp%=M7; npot[i]=temp; } if(maxp <= 4){ for(int i=1;i<=n;++i){ dfs1(i, i, i); } sort(all(odls1)); cout<<odls1[k-1]%M7*npot[2]%M7<<"\n"; } else{ for(int i=1;i<=n;++i){ dfs2(i, i, i); } for(int i=0;i<sz(odls);++i){ sort(all(odls[i])); reverse(all(odls[i])); } sort(all(odls)); long long www=0; for(int i=0;i<sz(odls[k-1]);++i){//cerr<<odls[k-1][i]<<" "; www+=npot[odls[k-1][i]]; www%=M7; }//cerr<<endl; cout<<www*npot[2]%M7<<"\n"; } return 0; } /* __builtin_popcount count total set bits on a given integer (use __builtin_popcountll for long long). */ |