結果

問題 No.1502 Many Simple Additions
ユーザー kiyoshi0205kiyoshi0205
提出日時 2021-05-07 23:35:11
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,835 bytes
コンパイル時間 3,993 ms
コンパイル使用メモリ 216,864 KB
実行使用メモリ 18,716 KB
最終ジャッジ日時 2024-09-15 11:42:09
合計ジャッジ時間 6,362 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 WA -
testcase_11 AC 2 ms
5,376 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 WA -
testcase_19 AC 2 ms
5,376 KB
testcase_20 WA -
testcase_21 AC 2 ms
5,376 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 2 ms
5,376 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 52 ms
10,496 KB
testcase_34 AC 56 ms
10,880 KB
testcase_35 AC 55 ms
10,496 KB
testcase_36 AC 31 ms
6,784 KB
testcase_37 AC 30 ms
6,784 KB
testcase_38 AC 39 ms
9,216 KB
testcase_39 AC 24 ms
6,144 KB
testcase_40 AC 21 ms
9,680 KB
testcase_41 AC 11 ms
7,560 KB
testcase_42 AC 62 ms
16,316 KB
testcase_43 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'll dfs(ll, ll, ll)':
main.cpp:196:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  196 |   for(auto [s,id]:g[now]){
      |            ^
main.cpp: In function 'void dfs2(ll, ll)':
main.cpp:205:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  205 |   for(auto [s,id]:g[now]){
      |            ^

ソースコード

diff # 

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<long double,long double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define popcount __builtin_popcountll
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr long double eps=1e-9;
const long double PI=acosl(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

inline void startupcpp(void) noexcept{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

ll modinv(ll a,const ll m=mod) noexcept{
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(const ll a,const ll b) noexcept{return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(const ll n,const ll r) noexcept{
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod;
    modncrlistm[n]=modinv(modncrlistp[n]);
    for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod;
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,const ll m=mod){
  if(n<0)return 0;
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

constexpr ll gcd(const ll a,const ll b) noexcept{return (!b)?abs(a):(a%b==0)?abs(b):gcd(b,a%b);}
constexpr ll lcm(const ll a,const ll b) noexcept{return a/gcd(a,b)*b;}

struct unionfind{
  private:
  int maxN;
  vector<int> par,treesize;
  public:unionfind(int N) :maxN(N),par(N),treesize(N,1){
    for(int i=0;i<maxN;++i)par[i]=i;
  }
  int root(int x){
    while(par[x]!=x){
      x=par[x]=par[par[x]];
    }
    return x;
  }
  bool unite(int x,int y){
    x=root(x);
    y=root(y);
    if(x==y)return false;
    if(treesize[x]>treesize[y])swap(x,y);
    par[x]=y;
    treesize[y]+=treesize[x];
    return true;
  }
  bool unite(pair<int,int> v){
    return unite(v.first,v.second);
  }
  bool parcheck(int x,int y){
    return root(x)==root(y);
  }
  bool parcheck(pair<int,int> v){
    return parcheck(v.first,v.second);
  }
  int size(int x){
    return treesize[root(x)];
  }
  void clear(){
    treesize.assign(maxN,1);
    for(int i=0;i<maxN;++i)par[i]=i;
  }
  vector<vector<int>> groups(){
    vector<vector<int>> res(maxN);
    for(int i=0;i<maxN;++i)res[root(i)].eb(i);
    // return res;
    vector<vector<int>> res2;
    for(vector<int> x:res){
      if(x.size())res2.eb(x);
    }
    return res2;
  }
};

bool vis[100001];
pvec val;
pmat g;
ll dfs(ll now,ll a,ll b){
  if(vis[now]){
    if(val[now].first==a){
      if(b!=val[now].second)return -1;
      else return 0;
    }else{
      if(a<val[now].first){
        swap(a,val[now].first);
        swap(b,val[now].second);
      }
      assert(a==1&&val[now].first==-1);
      if((val[now].second-b)<=0||(val[now].second-b)%2==1)return -1;
      return (val[now].second-b)/2;
    }
  }
  vis[now]=true;
  val[now]=datas(a,b);
  for(auto [s,id]:g[now]){
    ll t=dfs(id,-a,s-b);
    if(t)return t;
  }
  return 0;
}
void dfs2(ll now,ll x){
  vis[now]=true;
  val[now]=datas(0,x);
  for(auto [s,id]:g[now]){
    if(vis[id])continue;
    dfs2(id,s-x);
  }
}
int main(){
  startupcpp();
  ll i,j,N,M,K;
  cin>>N>>M>>K;
  g.resize(N);
  val.resize(N,datas(0,0));
  unionfind dsu(N);
  while(M--){
    ll c;
    cin>>i>>j>>c;
    --i;--j;
    g[i].eb(c,j);
    g[j].eb(c,i);
    dsu.unite(i,j);
  }
  ll ans0=1,ans1=1;
  for(auto v:dsu.groups()){
    ll t=dfs(v[0],1,0);
    if(t<0||t>=K){
      print(0);
      return 0;
    }
    debug(t);
    debug(val);
    if(t){
      for(auto x:v)vis[x]=false;
      dfs2(v[0],t);
      bool f=false;
      for(auto x:v){
        if(val[x].second<=0||val[x].second>K){
          print(0);
          return 0;
        }
        f|=val[x].second==K;
      }
      if(f)ans0=0;
      continue;
    }
    vec p,m;
    for(auto x:v){
      assert(abs(val[x].first)==1);
      if(val[x].first>0)p.emplace_back(val[x].second);
      else m.emplace_back(val[x].second);
    }
    vsort(p);
    vec Klis;
    debug(p);
    ll mi=1-p[0],ma=min(K,K-p.back());
    debug(mi,ma);
    for(auto x:p)Klis.emplace_back(K-x);
    if(m.size()){
      vsort(m);
      debug(m);
      chmax(mi,m.back()-K);
      chmin(ma,m[0]-K);
      debug(mi,ma);
      for(auto x:m)Klis.emplace_back(x-K);
    }
    if(mi>ma){
      print(0);
      return 0;
    }
    debug(mi,ma);
    uniq(Klis);
    t=0;
    for(auto x:Klis)if(mi<=x&&ma<=x)++t;
    (ans1*=ma-mi+1)%=mod;
    (ans0*=ma-mi+1-t)%=mod;
  }
  print((ans1-ans0+mod)%mod);
}
0