結果
| 問題 | No.1502 Many Simple Additions |
| ユーザー |
 kiyoshi0205
|
| 提出日時 | 2021-05-08 17:29:47 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,893 bytes |
| コンパイル時間 | 2,540 ms |
| コンパイル使用メモリ | 187,884 KB |
| 最終ジャッジ日時 | 2025-03-26 00:09:27 |
| 合計ジャッジ時間 | 4,781 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
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]){
| ^
main.cpp: In function ‘int main()’:
main.cpp:239:18: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ [-Wc++17-extensions]
239 | for(auto [s,id]:g[x]){
| ^
In file included from /usr/include/c++/13/string:43,
from /usr/include/c++/13/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52,
from main.cpp:4:
/usr/include/c++/13/bits/allocator.h: In destructor ‘std::_Vector_base<long long int, std::allocator<long long int> >::_Vector_impl::~_Vector_impl()’:
/usr/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to ‘always_inline’ ‘std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = long long int]’: target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /usr/include/c++/13/vector:66,
from /usr/include/c++/13/queue:63,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:157:
/usr/include/c++/13/bits/stl_vector.h:133:14: note: called from here
133 | struct _Vector_impl
| ^~~~~~~~~~~~
ソースコード
#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 DEBUGvoid 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))#endifinline 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){for(auto [s,id]:g[x]){if(val[x].second+val[id].second!=s){print(0);return 0;}}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;ll mi=1-p[0],ma=min(K,K-p.back());for(auto x:p)Klis.emplace_back(K-x);if(m.size()){vsort(m);chmax(mi,m.back()-K);chmin(ma,m[0]-1);for(auto x:m)Klis.emplace_back(x-K);}if(mi>ma){print(0);return 0;}uniq(Klis);t=0;for(auto x:Klis)if(mi<=x&&x<=ma)++t;(ans1*=ma-mi+1)%=mod;(ans0*=ma-mi+1-t)%=mod;}print((ans1-ans0+mod)%mod);}