結果
問題 | No.1222 -101 |
ユーザー |
![]() |
提出日時 | 2020-09-04 22:10:07 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 491 ms / 2,000 ms |
コード長 | 4,701 bytes |
コンパイル時間 | 1,521 ms |
コンパイル使用メモリ | 141,356 KB |
最終ジャッジ日時 | 2025-01-14 05:49:57 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 35 |
ソースコード
#include <cstdio>#include <cstring>#include <iostream>#include <string>#include <cmath>#include <bitset>#include <vector>#include <map>#include <set>#include <queue>#include <deque>#include <algorithm>#include <complex>#include <unordered_map>#include <unordered_set>#include <random>#include <cassert>#include <fstream>#include <utility>#include <functional>#include <time.h>#include <stack>#include <array>#define popcount __builtin_popcountusing namespace std;typedef long long int ll;typedef pair<int, int> P;struct unionfind{vector<int> par, sz;unionfind() {}unionfind(int n):par(n), sz(n, 1){for(int i=0; i<n; i++) par[i]=i;}int find(int x){if(par[x]==x) return x;return par[x]=find(par[x]);}void unite(int x, int y){x=find(x); y=find(y);if(x==y) return;if(sz[x]>sz[y]) swap(x, y);par[x]=y;sz[y]+=sz[x];}bool same(int x, int y){return find(x)==find(y);}int size(int x){return sz[find(x)];}};template<typename Monoid, typename OperatorMonoid=Monoid>struct LazySegmentTree{using F=function<Monoid(Monoid, Monoid)>;using G=function<Monoid(Monoid, OperatorMonoid, int)>;using H=function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;int sz;vector<Monoid> data;vector<OperatorMonoid> lazy;const F f;const G g;const H h;const Monoid e1;const OperatorMonoid e0;LazySegmentTree(int n, const F f, const G g, const H h, const Monoid &e1, const OperatorMonoid &e0): f(f), g(g), h(h), e1(e1), e0(e0){sz=1;while(sz<n) sz<<=1;data.resize(2*sz-1, e1);lazy.resize(2*sz-1, e0);}void build(vector<Monoid> v){for(int i=0; i<v.size(); i++) data[i+sz-1]=v[i];for(int i=sz-2; i>=0; i--) data[i]=f(data[2*i+1], data[2*i+2]);}void eval(int k, int l, int r){if(lazy[k]!=e0){data[k]=g(data[k], lazy[k], r-l);if(k<sz-1){lazy[2*k+1]=h(lazy[2*k+1], lazy[k]);lazy[2*k+2]=h(lazy[2*k+2], lazy[k]);}}lazy[k]=e0;}void update(int a, int b, const OperatorMonoid &x, int k, int l, int r){eval(k, l, r);if(r<=a || b<=l) return;if(a<=l && r<=b){lazy[k]=h(lazy[k], x);eval(k, l, r);}else{update(a, b, x, 2*k+1, l, (l+r)/2);update(a, b, x, 2*k+2, (l+r)/2, r);data[k]=f(data[2*k+1], data[2*k+2]);}}void update(int a, int b, const OperatorMonoid &x){return update(a, b, x, 0, 0, sz);}Monoid find(int a, int b, int k, int l, int r){eval(k, l, r);if(b<=l || r<=a) return e1;if(a<=l && r<=b) return data[k];else return f(find(a, b, 2*k+1, l, (l+r)/2), find(a, b, 2*k+2, (l+r)/2, r));}Monoid find(int a, int b){return find(a, b, 0, 0, sz);}Monoid operator[](const int &k){return find(k, k+1);}};int main(){int n, m;cin>>n>>m;int l[200020], r[200020], p[200020];for(int i=0; i<m; i++){cin>>l[i]>>r[i]>>p[i];l[i]--;}int c=0;unionfind uf(n+1);for(int i=0; i<m; i++){if(p[i]==0) continue;if(uf.same(l[i], r[i])) continue;c++;uf.unite(l[i], r[i]);}vector<P> g[200020];for(int i=0; i<m; i++){if(p[i]==0) continue;g[l[i]].push_back({r[i], p[i]});g[r[i]].push_back({l[i], p[i]});}int x[200020]={};bool dame=0;auto dfs=[&](auto dfs, int v)->void{for(auto q:g[v]){int y=q.first;if(x[y]!=0){if(x[y]!=q.second*x[v]){dame=1;}}else{x[y]=q.second*x[v];dfs(dfs, y);}}};for(int i=0; i<=n; i++){if(x[i]!=0) continue;x[i]=1;dfs(dfs, i);if(dame){cout<<0<<endl;return 0;}}int ri[200020];fill(ri, ri+n+1, -1);for(int i=0; i<m; i++){ri[r[i]]=i;}const ll MOD=1e9+7;auto f=[&](ll x, ll y){ll z=x+y;if(z>=MOD) z-=MOD;return z;};auto G=[&](ll a, ll x, int len){return x*len%MOD;};auto h=[&](ll x, ll y){return y;};LazySegmentTree<ll, ll> seg(n+1, f, G, h, 0, -1);seg.update(0, 1, 1);for(int i=1; i<=n; i++){int k=ri[i];if(k>=0 && p[k]!=0){seg.update(l[k]+1, n+1, 0);}else{seg.update(i, i+1, seg.find(0, i)*((MOD+1)/2)%MOD);if(k>=0 && p[k]==0){seg.update(0, l[k]+1, 0);}}}ll ans=seg.find(0, n+1);for(int i=0; i<n-c; i++) (ans*=2)%=MOD;cout<<ans<<endl;return 0;}