結果
問題 | No.1222 -101 |
ユーザー |
![]() |
提出日時 | 2020-09-05 16:47:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 539 ms / 2,000 ms |
コード長 | 8,546 bytes |
コンパイル時間 | 2,390 ms |
コンパイル使用メモリ | 214,324 KB |
最終ジャッジ日時 | 2025-01-14 07:13:50 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 35 |
ソースコード
#include<bits/stdc++.h>using namespace std;#define ALL(x) x.begin(),x.end()#define rep(i,n) for(int i=0;i<(n);i++)#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;#define mod 1000000007using ll=long long;const int INF=1000000000;const ll LINF=1001002003004005006ll;int dx[]={1,0,-1,0},dy[]={0,1,0,-1};// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}struct IOSetup{IOSetup(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(12);}} iosetup;template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}template<typename T>ostream &operator<<(ostream &os,const vector<T>&v){for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");return os;}template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}template<typename T>istream &operator>>(istream &is,vector<T>&v){for(T &x:v)is>>x;return is;}template<ll Mod>struct ModInt{long long x;ModInt():x(0){}ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){}ModInt &operator+=(const ModInt &p){if((x+=p.x)>=Mod) x-=Mod;return *this;}ModInt &operator-=(const ModInt &p){if((x+=Mod-p.x)>=Mod)x-=Mod;return *this;}ModInt &operator*=(const ModInt &p){x=(int)(1ll*x*p.x%Mod);return *this;}ModInt &operator/=(const ModInt &p){(*this)*=p.inverse();return *this;}ModInt operator-()const{return ModInt(x);}ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}ModInt operator==(const ModInt &p)const{return x==p.x;}ModInt operator!=(const ModInt &p)const{return x!=p.x;}ModInt inverse()const{int a=x,b=Mod,u=1,v=0,t;while(b>0){t=a/b;swap(a-=t*b,b);swap(u-=t*v,v);}return ModInt(u);}ModInt pow(long long n)const{ModInt ret(1),mul(x);while(n>0){if(n&1) ret*=mul;mul*=mul;n>>=1;}return ret;}friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;}friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);}static int get_mod(){return Mod;}};using mint=ModInt<mod>;template<int MAX>struct comcalc{vector<mint> fact,finv,inv;comcalc():fact(MAX),finv(MAX),inv(MAX){fact[0]=mint(1),fact[1]=mint(1),finv[0]=mint(1),finv[1]=mint(1),inv[1]=mint(1);for(int i=2;i<MAX;i++){fact[i]=fact[i-1]*mint(i);inv[i]=mint(0)-inv[mod%i]*(mint(mod/i));finv[i]=finv[i-1]*inv[i];}}mint com(int n,int k){if(n<k) return mint(0);if(n<0 or k<0) return mint(0);return fact[n]*(finv[k]*finv[n-k]);}mint fac(int n){return fact[n];}// 重複組み合わせ:n種類の物から重複を許し,k個選ぶmint nHk(int n,int k){return com(n+k-1,k);}// 玉n区別,箱k区別,各箱1個以上O(k)mint F12_dis_dis_one(int n,int k){if(n<k)return mint(0);mint ret=0;for(int i=0;i<=k;i++){mint add=com(k,i)*(mint(i).pow(n));if((k-i)%2) ret-=add;else ret+=add;}return ret;}};mint pow_mod(mint x,ll n){return x.pow(n);}mint inv_mod(mint x){return x.inverse();}// O(n)mint fact_mod(ll n){mint ret=1;for(int i=2;i<=n;i++) ret*=mint(i);return ret;}// O(r)mint comb_mod(ll n,ll r){if(r>n-r) r=n-r;if(r==0) return 1;mint a=1,b=mint(fact_mod(r)).inverse();for(int i=0;i<r;i++)a*=mint(n-i);return a*b;}const int MAX=4010000;using cominit=comcalc<MAX>;template<typename Monoid, typename OperatorMonoid=Monoid>struct LazySegmentTree{using F=function<Monoid(Monoid,Monoid)>;using G=function<Monoid(Monoid,OperatorMonoid)>;using H=function<OperatorMonoid(OperatorMonoid,OperatorMonoid)>;int sz,height;vector<Monoid> data;vector<OperatorMonoid> lazy;const F f;const G g;const H h;const Monoid M1;const OperatorMonoid OM0;LazySegmentTree(int n,const F f,const G g,const H h,const Monoid &M1,const OperatorMonoid OM0): f(f),g(g),h(h),M1(M1),OM0(OM0) {sz=1;height=0;while(sz<n) sz<<=1,height++;data.assign(2*sz,M1);lazy.assign(2*sz,OM0);}void set(int k,const Monoid &x){data[k+sz]=x;}void build(){for(int k=sz-1;k>0;k--) data[k]=f(data[2*k+0],data[2*k+1]);}inline void propagate(int k){if(lazy[k]!=OM0){lazy[2*k+0]=h(lazy[2*k+0],lazy[k]);lazy[2*k+1]=h(lazy[2*k+1],lazy[k]);data[k]=reflect(k);lazy[k]=OM0;}}inline Monoid reflect(int k){return lazy[k]==OM0?data[k]:g(data[k],lazy[k]);}inline void recalc(int k){while(k>>=1)data[k]=f(reflect(2*k+0),reflect(2*k+1));}inline void thrust(int k){for(int i=height;i>0;i--) propagate(k>>i);}void update(int a,int b,const OperatorMonoid &x){if(a>=b) return ;thrust(a+=sz);thrust(b+=sz-1);for(int l=a,r=b+1;l<r;l>>=1,r>>=1){if(l&1) lazy[l]=h(lazy[l],x),l++;if(r&1) --r,lazy[r]=h(lazy[r],x);}recalc(a);recalc(b);}Monoid query(int a,int b){thrust(a+=sz);thrust(b+=sz-1);Monoid L=M1,R=M1;for(int l=a,r=b+1;l<r;l>>=1,r>>=1){if(l&1) L=f(L,reflect(l++));if(r&1) R=f(reflect(--r),R);}return f(L,R);}Monoid operator[](const int &k){return query(k,k+1);}};// // range set range min// using M=ll;// using OM=ll;// const M M1=LINF;// const OM OM0=-LINF;// M segf(M a,M b){// return (a<b?a:b);// }// M segg(M a,OM b){// return (b==OM0?a:b);// }// OM segh(OM a,OM b){// return (b==OM0?a:b);// }// // range set range max// using M=ll;// using OM=ll;// const M M1=-LINF;// const OM OM0=-LINF;// M segf(M a,M b){// return (a>b?a:b);// }// M segg(M a,OM b){// return (b==OM0?a:b);// }// OM segh(OM a,OM b){// return (b==OM0?a:b);// }// // range add range min// using M=ll;// using OM=ll;// const M M1=LINF;// const OM OM0=0;// M segf(M a,M b){// return (a<b?a:b);// }// M segg(M a,OM b){// return a+b;// }// OM segh(OM a,OM b){// return a+b;// }// // range add range max// using M=ll;// using OM=ll;// const M M1=-LINF;// const OM OM0=0;// M segf(M a,M b){// return (a>b?a:b);// }// M segg(M a,OM b){// return a+b;// }// OM segh(OM a,OM b){// return a+b;// }// range set range sum (sum, count)using M=pair<ll,ll>;using OM=ll;const M M1=M(0,0);const OM OM0=-LINF;M segf(M a,M b){return M(a.first+b.first,a.second+b.second);}M segg(M a,OM b){return M(a.second*b,a.second);}ll segh(ll a,ll b){return (b==OM0?a:b);}signed main(){int n,m;cin>>n>>m;using P=pair<int,int>;vector<P> b;vector<int> a(n+1,-1);LazySegmentTree<M,OM> seg(n+1,segf,segg,segh,M1,OM0);auto query=[&](int l,int r){return seg.query(l,r).first;};seg.set(0,M(0,0));for(int i=1;i<=n;i++)seg.set(i,M(0,1));seg.build();int k=0;rep(i,m){int l,r,p;cin>>l>>r>>p;if(p==0){a[r]=l;}else{seg.update(l,r+1,1);k++;}}vector<mint> dp(n+1,0),sum(n+1,0);dp[0]=1;sum[0]=1;int lmx=0;for(int i=1;i<=n;i++){if(query(i,i+1)==0){if(lmx) dp[i]=sum[i-1]-mint(2).pow(i-lmx)*sum[lmx-1];else dp[i]=sum[i-1];}sum[i]=mint(2)*sum[i-1]+dp[i];chmax(lmx,a[i]);}mint ans=0;for(int i=lmx;i<=n;i++){ans+=dp[i]*mint(2).pow(n-i);}ans/=mint(2).pow(k);cout<<ans<<endl;return 0;}