結果
問題 | No.1222 -101 |
ユーザー |
![]() |
提出日時 | 2020-09-05 11:22:38 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 162 ms / 2,000 ms |
コード長 | 3,246 bytes |
コンパイル時間 | 1,514 ms |
コンパイル使用メモリ | 171,492 KB |
実行使用メモリ | 11,136 KB |
最終ジャッジ日時 | 2024-11-27 23:58:43 |
合計ジャッジ時間 | 5,766 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 35 |
ソースコード
#include <bits/stdc++.h>//#include <chrono>//#pragma GCC optimize("Ofast")using namespace std;#define reps(i,s,n) for(int i = s; i < n; i++)#define rep(i,n) reps(i,0,n)#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)#define Rrep(i,n) Rreps(i,n,0)#define ALL(a) a.begin(), a.end()#define fi first#define se secondtypedef long long ll;typedef vector<ll> vec;typedef vector<vec> mat;ll N,M,H,W,Q,K,A,B;string S;typedef pair<ll, ll> P;const ll INF = (1LL<<60);template<class T> bool chmin(T &a, const T &b){if(a > b) {a = b; return true;}else return false;}template<class T> bool chmax(T &a, const T &b){if(a < b) {a = b; return true;}else return false;}template <unsigned long long mod > class modint{public:ll x;constexpr modint(){x = 0;}constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}constexpr modint operator-(){return x == 0 ? 0 : mod - x;}constexpr modint& operator+=(const modint& a){if((x += a.x) >= mod) x -= mod;return *this;}constexpr modint operator+(const modint& a) const{return modint(*this) += a;}constexpr modint& operator-=(const modint& a){if((x -= a.x) < 0) x += mod;return *this;}constexpr modint operator-(const modint& a) const{return modint(*this) -= a;}constexpr modint& operator*=(const modint& a){(x *= a.x)%=mod;return *this;}constexpr modint operator*(const modint& a) const{return modint(*this) *= a;}constexpr modint pow(unsigned long long pw) const{modint res(1), comp(*this);while(pw){if(pw&1) res *= comp;comp *= comp;pw >>= 1;}return res;}//以下、modが素数のときのみconstexpr modint inv() const{return modint(*this).pow(mod - 2);}constexpr modint& operator/=(const modint &a){(x *= a.inv().x)%=mod;return *this;}constexpr modint operator/(const modint &a) const{return modint(*this) /= a;}};#define mod2 1000000007using mint = modint<mod2>;ostream& operator<<(ostream& os, const mint& a){os << a.x;return os;}using vm = vector<mint>;int main() {cin>>N>>M;ll a_num(0);vec max_R(N + 2, -1), imos(N + 2, 0);vm dp(N + 2), sum(N + 2), two(N + 2, 1);rep(i,M){int l, r, p;cin>>l>>r>>p;if(p != 0){++a_num;++imos[l];--imos[r + 1];}else{max_R[r + 1] = l;}}rep(i,N + 1) {chmax(max_R[i + 1], max_R[i]);imos[i + 1] += imos[i];two[i + 1] = two[i] * 2;}dp[0].x = sum[0].x = 1;reps(i, 1, N + 2){if(imos[i] > 0){dp[i] = 0;}else{dp[i] = sum[i - 1] - (max_R[i] ? sum[max_R[i] - 1] * two[i - max_R[i]] : 0);}sum[i] = sum[i - 1] * 2 + dp[i];}//rep(i, N + 2) cout<<dp[i]<<" \n"[i == N + 1];//rep(i, N + 2) cout<<sum[i]<<" \n"[i == N + 1];cout<<dp[N + 1] * mint(2).pow(a_num).inv()<<endl;}