結果

問題 No.1207 グラフX
ユーザー WA_TLEWA_TLE
提出日時 2020-08-30 13:20:04
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 351 ms / 2,000 ms
コード長 5,785 bytes
コンパイル時間 1,505 ms
コンパイル使用メモリ 148,136 KB
実行使用メモリ 35,492 KB
最終ジャッジ日時 2023-08-09 11:43:03
合計ジャッジ時間 15,437 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 277 ms
18,796 KB
testcase_01 AC 286 ms
18,860 KB
testcase_02 AC 282 ms
18,888 KB
testcase_03 AC 282 ms
18,664 KB
testcase_04 AC 282 ms
18,856 KB
testcase_05 AC 348 ms
35,364 KB
testcase_06 AC 346 ms
35,168 KB
testcase_07 AC 351 ms
35,368 KB
testcase_08 AC 296 ms
12,556 KB
testcase_09 AC 270 ms
16,100 KB
testcase_10 AC 339 ms
28,372 KB
testcase_11 AC 350 ms
35,492 KB
testcase_12 AC 264 ms
13,372 KB
testcase_13 AC 184 ms
5,668 KB
testcase_14 AC 289 ms
17,856 KB
testcase_15 AC 274 ms
14,924 KB
testcase_16 AC 173 ms
6,412 KB
testcase_17 AC 225 ms
11,684 KB
testcase_18 AC 161 ms
11,868 KB
testcase_19 AC 262 ms
8,664 KB
testcase_20 AC 282 ms
18,536 KB
testcase_21 AC 28 ms
4,376 KB
testcase_22 AC 212 ms
12,036 KB
testcase_23 AC 222 ms
13,300 KB
testcase_24 AC 136 ms
10,872 KB
testcase_25 AC 275 ms
18,224 KB
testcase_26 AC 228 ms
14,312 KB
testcase_27 AC 267 ms
16,508 KB
testcase_28 AC 268 ms
16,016 KB
testcase_29 AC 246 ms
16,380 KB
testcase_30 AC 159 ms
8,728 KB
testcase_31 AC 153 ms
4,896 KB
testcase_32 AC 114 ms
8,792 KB
testcase_33 AC 132 ms
8,592 KB
testcase_34 AC 265 ms
14,388 KB
testcase_35 AC 30 ms
4,376 KB
testcase_36 AC 252 ms
15,580 KB
testcase_37 AC 242 ms
12,396 KB
testcase_38 AC 63 ms
5,584 KB
testcase_39 AC 137 ms
9,644 KB
testcase_40 AC 118 ms
4,380 KB
testcase_41 AC 230 ms
9,336 KB
testcase_42 AC 1 ms
4,380 KB
testcase_43 AC 1 ms
4,376 KB
testcase_44 AC 1 ms
4,384 KB
testcase_45 AC 262 ms
18,612 KB
testcase_46 AC 257 ms
18,788 KB
testcase_47 AC 257 ms
18,740 KB
testcase_48 AC 259 ms
19,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<list>
#include<bitset>
#include<stack>
#include<memory>
#include<numeric>
using namespace std;
using namespace std::chrono;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define REP(i, n) for(int i = 0;i < (n);i++)
/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/
const llint mod=1000000007;
const llint inf=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-10;
template <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}

#include <algorithm>
#include <utility>
#include <type_traits>
#include <cstdint>
//永夜作
#define mnt mint_base
class mint_base;
//mint_base_base型用の累乗関数
constexpr mint_base m_pow(mint_base x, uint64_t n)noexcept;
//mod計算を自動で行う整数テンプレートクラス
class mint_base
{
public:
	constexpr mint_base operator+(const mint_base &other)const noexcept
	{auto v = *this;return v += other;}
	constexpr mint_base operator-(const mint_base &other)const noexcept
	{auto v = *this;return v -= other;}
	constexpr mint_base operator*(const mint_base &other)const noexcept
	{auto v = *this;return v *= other;}
	constexpr auto operator/(const mint_base &other)const noexcept
	{auto v = *this;return v /= other;}
	constexpr mint_base & operator+=(const mint_base &other) noexcept
	{a += other.a;if (mod <= a) { a -= mod; };return *this;}
	constexpr mint_base & operator-=(const mint_base &other) noexcept
	{if (a >= other.a) {a -= other.a;}else {a = (a + mod) - other.a;}return *this;}
	constexpr mint_base & operator*=(const mint_base &other) noexcept
	{a *= other.a;a %= mod;return *this;}
	constexpr mint_base & operator/=(const mint_base &other) noexcept
	{return *this *= ~other;}
	constexpr mint_base operator+()const noexcept { return *this; }
	constexpr mint_base operator-()const noexcept
	{return{ mod - a, mod_value_tag{} };}
	constexpr mint_base & operator++() noexcept
	{if (mod <= ++a) { a = 0; };return *this;}
	constexpr mint_base & operator--() noexcept
	{if (a <= 0) { a = mod; };--a;return *this;}
	constexpr mint_base operator++(int) noexcept
	{auto tmp = *this;++*this;return tmp;}
	constexpr mint_base operator--(int) noexcept
	{auto tmp = *this;--*this;return tmp;}
	constexpr mint_base operator~()const noexcept
	{return m_pow(*this, mod-2);}
	constexpr mint_base & operator=(const mint_base &other) noexcept
	{a=other.a;return *this;}
	constexpr explicit operator uint64_t()const noexcept
	{return a;}
	constexpr explicit operator int()const noexcept
	{return a;}
	constexpr explicit operator unsigned()const noexcept
	{return (unsigned)a;}
	static constexpr uint64_t getmod() noexcept
	{return mod;}
	constexpr mint_base(uint64_t a_) noexcept :a(a_ % mod) {}
	constexpr mint_base()noexcept : a(0) {}
	struct mod_value_tag {};
	constexpr mint_base(uint64_t a_, mod_value_tag) :a(a_) {}
private:
	uint64_t a;
};

//mint_base型用の累乗関数
constexpr mint_base m_pow(mint_base x,uint64_t n)noexcept
{
	mint_base res = 1;
	while(n>0){
		if(n&1){res*=x;}
		x*=x;
		n>>=1;
	}
	return res;
}
//mint_baseの階乗計算
//0からxまでの階乗を返す
//O(x)時間が必要
vector<mint_base> fla;//階乗が入る
void fla_set(mint_base x)
{
	fla.resize(((uint64_t)x)+1);
	fla[0] = 1;
	for (uint64_t i = 1; i <= (uint64_t)x;i++){fla[i]=fla[i-1]*i;}
}
vector<mint_base> gya;//~fla[i] が入る

//O(x+log mod)で求める O(xlogmod)より速い
void fla_gya_set(mint_base x)
{
	fla_set(x);
	gya.resize(((uint64_t)x)+1);
	gya[(uint64_t)x]=~fla[(uint64_t)x];
	for(uint64_t i =(uint64_t)x;i>0;i--){gya[i-1]=gya[i]*i;}
}

//mint_base型のstreamへの出力
std::ostream& operator<<(std::ostream& os, mint_base i)
{os<<(uint64_t)i;return os;}
//mint_base型のstreamからの入力
std::istream& operator >> (std::istream& is, mint_base& i)
{uint64_t tmp;is>>tmp;i=tmp;return is;}


llint n,m,X;
vector<vector<pair<int,llint>>>ki;
pair<mint_base,int>solve(int t,int p){
	mint_base ans=0;
	int ko=1;
	for(auto it:ki[t]){
		if(it.fir==p){continue;}
		mint_base ka;
		int kk;
		tie(ka,kk)=solve(it.fir,t);
		ans+=ka;ko+=kk;
		ans+=m_pow(X,it.sec)*kk*(n-kk);
	}
	return mp(ans,ko);
}
int main(void){
	cin>>n>>m>>X;
	int i;
	llint ans=0;
	ki.res(n);
	vector<int>go(n);
	vector<int>ran(n);
	for(i=0;i<n;i++){go[i]=i;}
	for(i=0;i<m;i++){
		int x,y;llint z;cin>>x>>y>>z;
		x--;y--;
		int xx=x,yy=y;
		while(go[xx]!=xx){xx=go[xx];}
		while(go[yy]!=yy){yy=go[yy];}
		go[x]=xx;go[y]=yy;
		if(go[xx]==go[yy]){continue;}
		if(ran[xx]>ran[yy]){swap(xx,yy);}
		if(ran[xx]==ran[yy]){ran[xx]++;}
		go[xx]=yy;
		ki[x].pub(mp(y,z));
		ki[y].pub(mp(x,z));
	}
	cout<<solve(0,-1).fir<<endl;
	
	return 0;
}
0