結果

問題 No.1502 Many Simple Additions
ユーザー akuaakua
提出日時 2023-03-05 07:28:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,799 bytes
コンパイル時間 2,412 ms
コンパイル使用メモリ 155,604 KB
実行使用メモリ 26,012 KB
最終ジャッジ日時 2024-09-18 01:29:40
合計ジャッジ時間 7,396 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
11,076 KB
testcase_01 AC 40 ms
10,988 KB
testcase_02 AC 38 ms
11,060 KB
testcase_03 AC 38 ms
10,904 KB
testcase_04 AC 40 ms
11,132 KB
testcase_05 WA -
testcase_06 AC 40 ms
11,040 KB
testcase_07 WA -
testcase_08 AC 39 ms
11,052 KB
testcase_09 AC 40 ms
10,996 KB
testcase_10 AC 39 ms
10,992 KB
testcase_11 WA -
testcase_12 AC 40 ms
11,016 KB
testcase_13 AC 40 ms
11,004 KB
testcase_14 AC 40 ms
11,000 KB
testcase_15 AC 39 ms
11,060 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 39 ms
11,132 KB
testcase_25 AC 40 ms
11,008 KB
testcase_26 WA -
testcase_27 AC 86 ms
23,900 KB
testcase_28 AC 86 ms
24,120 KB
testcase_29 AC 57 ms
21,548 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 AC 71 ms
14,752 KB
testcase_37 AC 73 ms
14,616 KB
testcase_38 AC 88 ms
17,580 KB
testcase_39 AC 67 ms
14,096 KB
testcase_40 AC 64 ms
16,412 KB
testcase_41 WA -
testcase_42 AC 107 ms
23,976 KB
testcase_43 AC 39 ms
10,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
using namespace std;  
//using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;  
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vpp=vector<vp>;
using vd=vector<double>;
using vvd =vector<vd>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
void putsYes(bool f){cout << (f?"Yes":"No") << endl;}
void putsYES(bool f){cout << (f?"YES":"NO") << endl;}
void putsFirst(bool f){cout << (f?"First":"Second") << endl;}
void debug(int test){cout << "TEST" << " " << test << endl;}
ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
ll gcd(ll x,ll y){
    if(y==0)return x;
    return gcd(y,x%y);
}
 
ll lcm(ll x,ll y){
    return ll(x/gcd(x,y))*y;
}
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
 
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
ll mod =1e9+7;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    //assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(500000); 
  using vm=vector<mint> ;
using vvm=vector<vm> ;
 
 
ll sqrt_(ll x) {
  ll l = 0, r = ll(3e9)+1;
  while (l+1<r) {
    ll c = (l+r)/2;
    if (c*c <= x) l = c; else r = c;
  }
  return l;
}
 
 
int valid(int x,int y,int h,int w){
  if(x>=0 && y>=0 && x<h && y<w)return 1;
  else return 0;
}
 
struct edge{
  int to; ll cost;
  edge(int to,ll cost) : to(to),cost(cost){}
};
//snuke
template<typename T>
struct Matrix {
  int h, w;
  vector<vector<T> > d;
  Matrix() {}
  Matrix(int h, int w, T val=0): h(h), w(w), d(h, vector<T>(w,val)) {}
  Matrix& unit() {
    //assert(h == w);
    rep(i,h) d[i][i] = 1;
    return *this;
  }
  const vector<T>& operator[](int i) const { return d[i];}
  vector<T>& operator[](int i) { return d[i];}
  Matrix operator*(const Matrix& a) const {
    //assert(w == a.h);
    Matrix r(h, a.w);
    rep(i,h)rep(k,w)rep(j,a.w) {
      r[i][j] += d[i][k]*a[k][j];
    }
    return r;
  }
  Matrix pow(ll t) const {
  //  assert(h == w);
    if (!t) return Matrix(h,h).unit();
    if (t == 1) return *this;
    Matrix r = pow(t>>1);
    r = r*r;
    if (t&1) r = r*(*this);
    return r;
  }
};
using ve=vector<edge>;
using vve=vector<ve>;
vp val;
vve g;
vi seen;
int is=1;
ll y=-1;
void dfs(int v,int p=-1){
  seen[v]=1;
  for(auto u:g[v]){
    P base=P(-val[v].first,u.cost-val[v].second);
    if(seen[u.to]){
      if(base!=val[u.to]){
        if(val[u.to].first==base.first){
          is=0;
        }
        else {
          ll x=val[u.to].second-base.second;
          if(x%abs(base.first-val[u.to].first)){
            is=0;
          }
          x/=(base.first-val[u.to].first);
          if(x<=0)is=0;
          else if(y==-1)y=x;
          else if(y!=x){
            is=0;
          }
        }
      }
    }
    else {
      val[u.to]=base;
      dfs(u.to);
    }
  }

}
struct UnionFind { vector<int> par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x;
        else return par[x] = root(par[x]);
    }
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false; 
        if (siz[x] < siz[y]) swap(x, y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    int size(int x) {
        return siz[root(x)];
    }
};
void solve(int test){
  int n,m,k; cin >> n >> m >> k;
  g.resize(n);
  seen.resize(n);
  val.resize(n);
  UnionFind uf(n);  
  rep(i,m){
    int a,b,z; cin >> a >> b >> z;a--;b--;
    g[a].push_back(edge(b,z));
    g[b].push_back(edge(a,z));
    uf.unite(a,b);
  }
  vvi vs(n);
  rep(i,n)vs[uf.root(i)].push_back(i);
  auto f=[&](int x){
    is=1;y=-1;
    rep(i,n)seen[i]=0;
    rep(i,n)val[i].first=0,val[i].second=0;
    mint res=1;
    rep(i,n)if(!seen[i]){
       val[i].first=1;
       dfs(i);
       if(!is)res=0;
       if(y!=-1){
        if(y>x)res=0;
        else {
         for(auto u:vs[i]){
            ll now=val[u].first*y+val[u].second;
            if(now>x || now<=0)res=0;
         }
        }
       }
       else {
         ll l=1,r=x;
         for(auto u:vs[i]){
            P now=val[u];
            if(now.first==1){
              chmin(r,x-now.second);
              chmax(l,1-now.second);
            }
            else {
              chmin(r,now.second-1);
              chmax(l,now.second-x);
            }
         }
       //  cout << l << " " << r << endl;
         res*=(r-l+1);
       }
    }
       return res;
  };
  mint ans=f(k);
  if(k>=2)ans-=f(k-1);
  cout << ans << endl;
}
//g++ main.cpp -std=c++17 -I .
int main(){cin.tie(0);ios::sync_with_stdio(false);
  int t=1;// cin >> t;
  rep(test,t)solve(test);
}
0