結果

問題 No.1502 Many Simple Additions
ユーザー maroon_kurimaroon_kuri
提出日時 2021-05-07 21:52:40
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 160 ms / 2,000 ms
コード長 9,580 bytes
コンパイル時間 2,633 ms
コンパイル使用メモリ 222,572 KB
実行使用メモリ 41,844 KB
最終ジャッジ日時 2023-10-13 22:27:08
合計ジャッジ時間 6,100 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
27,932 KB
testcase_01 AC 8 ms
27,924 KB
testcase_02 AC 9 ms
28,000 KB
testcase_03 AC 8 ms
27,952 KB
testcase_04 AC 9 ms
27,996 KB
testcase_05 AC 9 ms
27,944 KB
testcase_06 AC 9 ms
27,980 KB
testcase_07 AC 9 ms
27,964 KB
testcase_08 AC 8 ms
27,968 KB
testcase_09 AC 9 ms
27,996 KB
testcase_10 AC 9 ms
28,032 KB
testcase_11 AC 9 ms
27,964 KB
testcase_12 AC 9 ms
27,984 KB
testcase_13 AC 9 ms
28,116 KB
testcase_14 AC 8 ms
27,992 KB
testcase_15 AC 9 ms
28,036 KB
testcase_16 AC 9 ms
28,044 KB
testcase_17 AC 9 ms
27,948 KB
testcase_18 AC 9 ms
27,972 KB
testcase_19 AC 9 ms
27,964 KB
testcase_20 AC 9 ms
27,956 KB
testcase_21 AC 9 ms
28,008 KB
testcase_22 AC 9 ms
27,972 KB
testcase_23 AC 9 ms
28,136 KB
testcase_24 AC 9 ms
27,992 KB
testcase_25 AC 8 ms
27,980 KB
testcase_26 AC 9 ms
27,980 KB
testcase_27 AC 61 ms
37,940 KB
testcase_28 AC 59 ms
38,176 KB
testcase_29 AC 160 ms
39,180 KB
testcase_30 AC 111 ms
41,844 KB
testcase_31 AC 119 ms
41,612 KB
testcase_32 AC 128 ms
41,580 KB
testcase_33 AC 66 ms
35,752 KB
testcase_34 AC 69 ms
36,284 KB
testcase_35 AC 64 ms
35,932 KB
testcase_36 AC 39 ms
31,296 KB
testcase_37 AC 39 ms
31,316 KB
testcase_38 AC 46 ms
33,612 KB
testcase_39 AC 31 ms
31,120 KB
testcase_40 AC 20 ms
31,308 KB
testcase_41 AC 43 ms
31,088 KB
testcase_42 AC 53 ms
36,584 KB
testcase_43 AC 9 ms
27,984 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t,class u>
void print(const pair<t,u>&p,int suc=1){
	print(p.a,2);
	print(p.b,suc);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

//mint107 は verify してねえ
//#define DYNAMIC_MOD

struct modinfo{uint mod,root;
#ifdef DYNAMIC_MOD
constexpr modinfo(uint m,uint r):mod(m),root(r),im(0){set_mod(m);}
ull im;
constexpr void set_mod(uint m){
	mod=m;
	im=ull(-1)/m+1;
}
uint product(uint a,uint b)const{
	ull z=ull(a)*b;
	uint x=((unsigned __int128)z*im)>>64;
	uint v=uint(z)-x*mod;
	return v<mod?v:v+mod;
}
#endif
};
template<modinfo const&ref>
struct modular{
	static constexpr uint const &mod=ref.mod;
	static modular root(){return modular(ref.root);}
	uint v;
	//modular(initializer_list<uint>ls):v(*ls.bg){}
	modular(ll vv=0){s(vv%mod+mod);}
	modular& s(uint vv){
		v=vv<mod?vv:vv-mod;
		return *this;
	}
	modular operator-()const{return modular()-*this;}
	modular& operator+=(const modular&rhs){return s(v+rhs.v);}
	modular&operator-=(const modular&rhs){return s(v+mod-rhs.v);}
	modular&operator*=(const modular&rhs){
		#ifndef DYNAMIC_MOD
		v=ull(v)*rhs.v%mod;
		#else
		v=ref.product(v,rhs.v);
		#endif
		return *this;
	}
	modular&operator/=(const modular&rhs){return *this*=rhs.inv();}
	modular operator+(const modular&rhs)const{return modular(*this)+=rhs;}
	modular operator-(const modular&rhs)const{return modular(*this)-=rhs;}
	modular operator*(const modular&rhs)const{return modular(*this)*=rhs;}
	modular operator/(const modular&rhs)const{return modular(*this)/=rhs;}
	modular pow(ll n)const{
		modular res(1),x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modular inv()const{return pow(mod-2);}
	/*modular inv()const{
		int x,y;
		int g=extgcd<ll>(v,mod,x,y);
		assert(g==1);
		if(x<0)x+=mod;
		return modular(x);
	}*/
	friend modular operator+(int x,const modular&y){
		return modular(x)+y;
	}
	friend modular operator-(int x,const modular&y){
		return modular(x)-y;
	}
	friend modular operator*(int x,const modular&y){
		return modular(x)*y;
	}
	friend modular operator/(int x,const modular&y){
		return modular(x)/y;
	}
	friend ostream& operator<<(ostream&os,const modular&m){
		return os<<m.v;
	}
	friend istream& operator>>(istream&is,modular&m){
		ll x;is>>x;
		m=modular(x);
		return is;
	}
	bool operator<(const modular&r)const{return v<r.v;}
	bool operator==(const modular&r)const{return v==r.v;}
	bool operator!=(const modular&r)const{return v!=r.v;}
	explicit operator bool()const{
		return v;
	}
};

#ifndef DYNAMIC_MOD
//extern constexpr modinfo base{998244353,3};
extern constexpr modinfo base{1000000007,0};
//modinfo base{1,0};
#ifdef USE_GOOD_MOD
static_assert(base.mod==998244353);
#endif
#else
modinfo base(1,0);
extern constexpr modinfo base107(1000000007,0);
using mint107=modular<base107>;
#endif
using mint=modular<base>;

const int vmax=(1<<21)+10;
mint fact[vmax],finv[vmax],invs[vmax];
void initfact(){
	fact[0]=1;
	rng(i,1,vmax){
		fact[i]=fact[i-1]*i;
	}
	finv[vmax-1]=fact[vmax-1].inv();
	for(int i=vmax-2;i>=0;i--){
		finv[i]=finv[i+1]*(i+1);
	}
	for(int i=vmax-1;i>=1;i--){
		invs[i]=finv[i]*fact[i-1];
	}
}
mint choose(int n,int k){
	return fact[n]*finv[n-k]*finv[k];
}
mint binom(int a,int b){
	return fact[a+b]*finv[a]*finv[b];
}
mint catalan(int n){
	return binom(n,n)-(n-1>=0?binom(n-1,n+1):0);
}

/*
const int vmax=110;
mint binbuf[vmax][vmax];
mint choose(int n,int k){
	return binbuf[n-k][k];
}
mint binom(int a,int b){
	return binbuf[a][b];
}
void initfact(){
	binbuf[0][0]=1;
	rep(i,vmax)rep(j,vmax){
		if(i)binbuf[i][j]+=binbuf[i-1][j];
		if(j)binbuf[i][j]+=binbuf[i][j-1];
	}
}
*/

void muri(){
	print(0);
	exit(0);
}

void slv(){
	int n,m,tar;cin>>n>>m>>tar;
	vvc<pi> g(n);
	rep(_,m){
		int x,y,z;cin>>x>>y>>z;
		x--;y--;
		g[x].eb(y,z);
		g[y].eb(x,z);
	}
	vi rs(n,-1);
	vi vis(n*2,inf);
	auto dfs=[&](auto self,int v,int k,int off,int root)->void{
		int idx=v*2+k;
		if(vis[idx]!=inf){
			if(vis[idx]!=off){
				muri();
			}
			return;
		}
		vis[idx]=off;
		rs[v]=root;
		for(auto [to,d]:g[v]){
			self(self,to,k^1,d-off,root);
		}
	};
	rep(i,n)if(rs[i]==-1)
		dfs(dfs,i,0,0,i);
	
	bool hitmax=false;
	vi dec(n,inf);
	rep(i,n)if(vis[i*2]!=inf&&vis[i*2+1]!=inf){
		int dif=vis[i*2+1]-vis[i*2];
		if(dif&1){
			muri();
		}
		dif/=2;
		int r=rs[i];
		if(dec[r]!=inf&&dec[r]!=dif)muri();
		dec[r]=dif;
	}
	rep(i,n)rep(k,2)if(dec[rs[i]]!=inf&&vis[i*2+k]!=inf){
		int w=dec[rs[i]];
		if(k)w=-w;
		w+=vis[i*2+k];
		if(w<=0||w>tar)muri();
		if(w==tar)hitmax=true;
	}
	
	auto calc=[&](int realtar)->mint{
		map<int,pi> z;
		auto upd=[&](int i,int mn,int mx){
			if(!z.count(i))z[i]=pi(mn,mx);
			chmax(z[i].a,mn);
			chmin(z[i].b,mx);
		};
		rep(i,n)if(dec[rs[i]]==inf){
			if(vis[i*2]!=inf){
				upd(rs[i],1-vis[i*2],realtar-vis[i*2]);
			}
			if(vis[i*2+1]!=inf){
				upd(rs[i],vis[i*2+1]-realtar,vis[i*2+1]-1);
			}
		}
		mint res=1;
		for(auto kv:z){
			auto [mn,mx]=kv.b;
			if(mn>mx)return 0;
			res*=(mx-mn+1);
		}
		return res;
	};
	
	mint ans=calc(tar);
	if(!hitmax)ans-=calc(tar-1);
	print(ans);
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	//int t;cin>>t;rep(_,t)
	slv();
}
0