結果

問題 No.1222 -101
ユーザー heno239heno239
提出日時 2020-09-04 22:05:30
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 64 ms / 2,000 ms
コード長 3,753 bytes
コンパイル時間 1,387 ms
コンパイル使用メモリ 116,984 KB
実行使用メモリ 16,968 KB
最終ジャッジ日時 2024-11-26 12:53:48
合計ジャッジ時間 4,018 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 19;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}

void solve() {
	int n, m; cin >> n >> m;
	vector<int> l(m), r(m), p(m);
	vector<int> cnt(n + 1);

	vector<int> updseg(n, -1);
	rep(i, m) {
		cin >> l[i] >> r[i] >> p[i]; l[i]--; r[i]--;
		if (p[i] != 0) {
			cnt[l[i]]++;
			cnt[r[i] + 1]--;
		}
		else {
			updseg[r[i]] = l[i];
		}
	}
	rep(i, n) {
		cnt[i + 1] += cnt[i];
	}
	
	vector<modint> rdp(n + 1);
	rdp[0] = 1;
	int loc = -1;
	modint pro = 1;
	rep(i, n) {
		rdp[i + 1] = rdp[i];
		if (cnt[i] == 0) {
			modint val = rdp[i];
			if (loc >= 0)val -= rdp[loc];
			rdp[i + 1]+=val*(modint)((1+mod)/2);

			pro *= 2;
		}
		if (updseg[i] >= 0)loc = max(loc, updseg[i]);
	}
	//rep(i, n + 1)cout << rdp[i] << "\n";
	modint x1 = rdp[n];
	if (loc >= 0)x1 -= rdp[loc];
	x1 *= pro;
	//cout << x1 << "\n";
	int t = 0;
	rep(i, n)if (cnt[i] > 0)t++;
	rep(i, m)if (p[i] != 0)t--;
	modint x2 = 1;
	rep(i, t)x2 *= 2;
	modint ans = x1 * x2;
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0