結果
| 問題 | No.1502 Many Simple Additions |
| ユーザー |
 n_vip
|
| 提出日時 | 2021-05-07 23:11:34 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 146 ms / 2,000 ms |
| コード長 | 9,046 bytes |
| コンパイル時間 | 1,877 ms |
| コンパイル使用メモリ | 150,516 KB |
| 最終ジャッジ日時 | 2025-01-21 08:45:18 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 39 |
ソースコード
#include <string>#include <vector>#include<iostream>#include<cstdio>#include<cstdlib>#include<stack>#include<queue>#include<cmath>#include<algorithm>#include<functional>#include<list>#include<deque>#include<bitset>#include<set>#include<map>#include<unordered_map>#include<unordered_set>#include<cstring>#include<sstream>#include<complex>#include<iomanip>#include<numeric>#include<cassert>#include<random>#define X first#define Y second#define pb push_back#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))#define peat(X,Y) for (;(X) < (Y);++(X))#define all(X) (X).begin(),(X).end()#define rall(X) (X).rbegin(),(X).rend()#define eb emplace_back#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())#define Endl endl#define NL <<"\n"#define cauto const autousing namespace std;using ll=long long;using pii=pair<int,int>;using pll=pair<ll,ll>;template<class T> using vv=vector<vector<T>>;template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}//#undef NUIP#ifdef NUIP#include "benri.h"#else#define out(args...)#endifvoid ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}#ifdef __cpp_init_capturestemplate<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}#endiftemplate<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}template<class T=ll> T read(){ T re; cin>>re; return move(re);}template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}vv<int> readG(const int &n){ return readG(n,n-1);}#define TT cauto TTT=read();rep(_,TTT)const ll MOD=1e9+7; //998244353;struct UF{vector<int> data;UF(const int &size):data(size,-1){}int unite(int x, int y){x=root(x); y=root(y);if(x==y) return 0;if(-data[y]>-data[x]) swap(x,y);data[x]+=data[y]; data[y]=x;return y+1;}bool findSet(const int &x, const int &y){ return root(x)==root(y);}int root(const int &x){ return data[x]<0?x:data[x]=root(data[x]);}int size(const int &x){ return -data[root(x)];}int size(){ return count_if(all(data),[](const int &x){ return x<0;});}; //unverifiedint operator()(const int &x, const int &y){ return unite(x,y);}int operator()(const pii &xy){ return unite(xy.X,xy.Y);}int operator[](const int &x){ return root(x);}bool operator[](const pii &xy){ return findSet(xy.X,xy.Y);}};ll modpow_(ll r,ll n,ll m=MOD){ll re=1,d=r%m;if(n<0)(n%=m-1)+=m-1;for(;n;n/=2){if(n&1)(re*=d)%=m;(d*=d)%=m;}return re;}template <int mod=MOD> struct ModInt{int v;ModInt(int v=0):v(v){}ModInt operator+(const ModInt &n)const{return v+n.v<mod ? v+n.v : v+n.v-mod;}ModInt operator-(const ModInt &n)const{return v-n.v<0 ? v-n.v+mod : v-n.v;}ModInt operator*(const ModInt &n)const{return ll(v)*n.v%mod;}ModInt operator/(const ModInt &n)const{return ll(v)*modpow_(n.v%mod,-1,mod)%mod;}ModInt operator+(const ll &n)const{return v+n<mod ? v+n : v+n-mod;}ModInt operator-(const ll &n)const{return v-n<0 ? v-n+mod : v-n;}ModInt operator*(const ll &n)const{return ll(v)*(n%mod)%mod;}ModInt operator/(const ll &n)const{return ll(v)*modpow_(n%mod,-1,mod)%mod;}ModInt& operator+=(const ModInt &n){v+=n.v; if(v>=mod) v-=mod; return *this;}ModInt& operator-=(const ModInt &n){v-=n.v; if(v<0) v+=mod; return *this;}ModInt& operator*=(const ModInt &n){v=ll(v)*n.v%mod; return *this;}ModInt& operator/=(const ModInt &n){v=ll(v)*modpow_(n.v,-1,mod)%mod; return *this;}ModInt& operator+=(const ll &n){v+=n; if(v>=mod) v-=mod; return *this;}ModInt& operator-=(const ll &n){v-=n; if(v<0) v+=mod; return *this;}ModInt& operator*=(const ll &n){v=ll(v)*n%mod; return *this;}ModInt& operator/=(const ll &n){v=ll(v)*modpow_(n,-1,mod)%mod; return *this;}bool operator==(const ModInt &n)const{return v==n.v;};bool operator!=(const ModInt &n)const{return v!=n.v;};ModInt& operator++(){ return operator+=(1); }ModInt& operator--(){ return operator-=(1); }ModInt operator++(int i){ ModInt tmp(*this); operator++(); return tmp; }ModInt operator--(int i){ ModInt tmp(*this); operator--(); return tmp; }};#ifdef NUIPclass MINT_FRAC____{public:unordered_map<int,pii> dict;MINT_FRAC____(int n){rep(p,n+1)reps(q,1,n+1)if(__gcd(p,q)==1){dict[1ll*p*modpow_(q,-1)%MOD]=pii(p,q);dict[MOD-1ll*p*modpow_(q,-1)%MOD]=pii(-p,q);}}} Il1Il1Il1(1000);template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){if(Il1Il1Il1.dict.count(n.v)) os<<n.v, cerr<<"("<<Il1Il1Il1.dict[n.v].X<<"/"<<Il1Il1Il1.dict[n.v].Y<<")";else os<<n.v;return os;};#elsetemplate<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){return os<<n.v;};#endiftemplate<int mod> ModInt<mod> operator+(const ll &n,const ModInt<mod> &m){return m.v+n<mod ? m.v+n : m.v+n-mod;}template<int mod> ModInt<mod> operator-(const ll &n,const ModInt<mod> &m){return n-m.v<0 ? n-m.v+mod : n-m.v;}template<int mod> ModInt<mod> operator*(const ll &n,const ModInt<mod> &m){return ll(m.v)*(n%mod)%mod;}template<int mod> ModInt<mod> operator/(const ll &n,const ModInt<mod> &m){return ModInt<mod>(n%mod)/m;}typedef ModInt<MOD> mint;template <int mod> ModInt<mod> modpow(ModInt<mod> r,ll n){ ModInt<mod> re(1); if(n<0)(n%=mod-1)+=mod-1; for(;n;n/=2){if(n&1) re*=r; r*=r;} return re;}vector<mint> fact,finv,inv;mint comb(ll n,ll r){ if(n<r||r<0)return 0; return fact[n]*finv[n-r]*finv[r];}class Doralion{void Modinvs(vector<mint> &re,int n){ re.resize(n+1); re[1]=1; for(int i=2;i<=n;++i)re[i]=re[MOD%i]*(MOD-MOD/i);}void Facts(vector<mint> &re,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*(i+1);}void Factinvs(vector<mint> &re,const vector<mint> &inv,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*inv[i+1];}public:Doralion(int n){ Modinvs(inv,n); Facts(fact,n); Factinvs(finv,inv,n);}} doralion(1123456);using pmm=pair<mint,mint>;mint modpow(ll r,ll n){ return modpow_(r,n);}mint solve(const vv<pii> &g,const ll t){const int n=g.size();vector<ll> nums(n);vector<ll> cs(n);vector<int> usd(n);{cauto dfs=[&](auto &&dfs,int v)->void{for(cauto &[u,s]:g[v]){if(!MX(usd[u],1)) continue;nums[u]=s-nums[v];cs[u]=1-cs[v];dfs(dfs,u);}};rep(v,n)if(MX(usd[v],1)) dfs(dfs,v);}out(nums,1);UF uf(n);rep(v,n)for(cauto &[u,s]:g[v]) uf(u,v);vector<int> isB(n,1);vector<ll> difs(n);rep(v,n)for(cauto &[u,s]:g[v])if(cs[u]==cs[v]){isB[uf[v]]=0;if(cs[v]) difs[uf[v]]=s-nums[u]-nums[v];else difs[uf[v]]=nums[u]+nums[v]-s;}out(difs,1);for(cauto &v:difs)if(v%2) return 0;rep(v,n){if(cs[v]) nums[v]+=difs[uf[v]]/2;else nums[v]-=difs[uf[v]]/2;}out(nums,1);rep(v,n)for(cauto &[u,s]:g[v]){if(nums[u]+nums[v]!=s) return 0;}const ll INF=1e16;vector<ll> mns(n+n,INF),mxs(n+n,-INF);rep(v,n){MN(mns[2*uf[v]+cs[v]],nums[v]);MX(mxs[2*uf[v]+cs[v]],nums[v]);}out(nums,cs,isB,mns,mxs,1);vector<mint> re(2,1);rep(i,2){ //t-i;rep(v,n)if(uf[v]==v){out(v,t-i,1);if(!isB[v]){if(mns[2*v]<=0 || mns[2*v+1]<=0 ||mxs[2*v]>t-i || mxs[2*v+1]>t-i){re[i]=0; break;}continue;}// 1<=mn0+x && mx0+x<=t-i// 1<=mn1-x && mx1-x<=t-icauto lb=max(1-mns[2*v], mxs[2*v+1]-t+i);cauto ub=min(t-i-mxs[2*v], mns[2*v+1]-1);re[i]*=max(0ll,ub-lb+1)%MOD;}}out(re,1);return re[0]-re[1];}int main(){ios_base::sync_with_stdio(false); cin.tie(0);cout<<fixed<<setprecision(0);cauto n=read();cauto m=read();cauto t=read();vv<pii> g(n);rep(_,m){cauto v=read(1);cauto u=read(1);cauto w=read(0);g[u].eb(v,w);g[v].eb(u,w);}cout<<solve(g,t) NL;return 0;}