結果
| 問題 | No.1222 -101 |
| ユーザー |
 hitonanode
|
| 提出日時 | 2020-09-04 22:13:17 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 468 ms / 2,000 ms |
| コード長 | 12,984 bytes |
| コンパイル時間 | 2,260 ms |
| コンパイル使用メモリ | 215,044 KB |
| 最終ジャッジ日時 | 2025-01-14 05:52:37 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 35 |
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); returnvec; }template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }#if __cplusplus >= 201703Ltemplate <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); returnis; }template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);},tpl); return os; }#endiftemplate <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; returnos; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os;}template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')';return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first <<"=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCAL#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl#else#define dbg(x)#endiftemplate <int mod>struct ModInt{using lint = long long;static int get_mod() { return mod; }static int get_primitive_root() {static int primitive_root = 0;if (!primitive_root) {primitive_root = [&](){std::set<int> fac;int v = mod - 1;for (lint i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i;if (v > 1) fac.insert(v);for (int g = 1; g < mod; g++) {bool ok = true;for (auto i : fac) if (ModInt(g).power((mod - 1) / i) == 1) { ok = false; break; }if (ok) return g;}return -1;}();}return primitive_root;}int val;constexpr ModInt() : val(0) {}constexpr ModInt &_setval(lint v) { val = (v >= mod ? v - mod : v); return *this; }constexpr ModInt(lint v) { _setval(v % mod + mod); }explicit operator bool() const { return val != 0; }constexpr ModInt operator+(const ModInt &x) const { return ModInt()._setval((lint)val + x.val); }constexpr ModInt operator-(const ModInt &x) const { return ModInt()._setval((lint)val - x.val + mod); }constexpr ModInt operator*(const ModInt &x) const { return ModInt()._setval((lint)val * x.val % mod); }constexpr ModInt operator/(const ModInt &x) const { return ModInt()._setval((lint)val * x.inv() % mod); }constexpr ModInt operator-() const { return ModInt()._setval(mod - val); }constexpr ModInt &operator+=(const ModInt &x) { return *this = *this + x; }constexpr ModInt &operator-=(const ModInt &x) { return *this = *this - x; }constexpr ModInt &operator*=(const ModInt &x) { return *this = *this * x; }constexpr ModInt &operator/=(const ModInt &x) { return *this = *this / x; }friend constexpr ModInt operator+(lint a, const ModInt &x) { return ModInt()._setval(a % mod + x.val); }friend constexpr ModInt operator-(lint a, const ModInt &x) { return ModInt()._setval(a % mod - x.val + mod); }friend constexpr ModInt operator*(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.val % mod); }friend constexpr ModInt operator/(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.inv() % mod); }constexpr bool operator==(const ModInt &x) const { return val == x.val; }constexpr bool operator!=(const ModInt &x) const { return val != x.val; }bool operator<(const ModInt &x) const { return val < x.val; } // To use std::map<ModInt, T>friend std::istream &operator>>(std::istream &is, ModInt &x) { lint t; is >> t; x = ModInt(t); return is; }friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { os << x.val; return os; }constexpr lint power(lint n) const {lint ans = 1, tmp = this->val;while (n) {if (n & 1) ans = ans * tmp % mod;tmp = tmp * tmp % mod;n /= 2;}return ans;}constexpr lint inv() const { return this->power(mod - 2); }constexpr ModInt operator^(lint n) const { return ModInt(this->power(n)); }constexpr ModInt &operator^=(lint n) { return *this = *this ^ n; }inline ModInt fac() const {static std::vector<ModInt> facs;int l0 = facs.size();if (l0 > this->val) return facs[this->val];facs.resize(this->val + 1);for (int i = l0; i <= this->val; i++) facs[i] = (i == 0 ? ModInt(1) : facs[i - 1] * ModInt(i));return facs[this->val];}ModInt doublefac() const {lint k = (this->val + 1) / 2;if (this->val & 1) return ModInt(k * 2).fac() / ModInt(2).power(k) / ModInt(k).fac();else return ModInt(k).fac() * ModInt(2).power(k);}ModInt nCr(const ModInt &r) const {if (this->val < r.val) return ModInt(0);return this->fac() / ((*this - r).fac() * r.fac());}ModInt sqrt() const {if (val == 0) return 0;if (mod == 2) return val;if (power((mod - 1) / 2) != 1) return 0;ModInt b = 1;while (b.power((mod - 1) / 2) == 1) b += 1;int e = 0, m = mod - 1;while (m % 2 == 0) m >>= 1, e++;ModInt x = power((m - 1) / 2), y = (*this) * x * x;x *= (*this);ModInt z = b.power(m);while (y != 1) {int j = 0;ModInt t = y;while (t != 1) j++, t *= t;z = z.power(1LL << (e - j - 1));x *= z, z *= z, y *= z;e = j;}return ModInt(std::min(x.val, mod - x.val));}};using mint = ModInt<1000000007>;// UnionFind Tree (0-indexed), based on size of each disjoint setstruct UnionFind{std::vector<int> par, cou;UnionFind(int N = 0) : par(N), cou(N, 1) {iota(par.begin(), par.end(), 0);}int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }bool unite(int x, int y) {x = find(x), y = find(y);if (x == y) return false;if (cou[x] < cou[y]) std::swap(x, y);par[y] = x, cou[x] += cou[y];return true;}int count(int x) { return cou[find(x)]; }bool same(int x, int y) { return find(x) == find(y); }};void bad(){puts("0");exit(0);}template <typename VAL, typename DVAL>struct LazySegTree{int N;int head;vector<VAL> val;vector<DVAL> dval;VAL I_val;DVAL I_dval;using vv2v = function<VAL(const VAL&, const VAL&)>;using d2d = function<void(DVAL&, const DVAL&)>;using d2v = function<void(VAL&, const DVAL&)>;vv2v merge_val;d2d add_dval;d2v refl_dval;LazySegTree() = default;LazySegTree(const vector<VAL> &val_init, VAL val_default, DVAL dval_default,vv2v f, d2d dadd, d2v dreflect): N(val_init.size()), I_val(val_default), I_dval(dval_default),merge_val(f),add_dval(dadd),refl_dval(dreflect){int N_tmp = 1;while (N_tmp < N) N_tmp <<= 1;val = vector<VAL>(N_tmp*2, I_val);dval = vector<DVAL>(N_tmp*2, I_dval);head = N_tmp - 1;for (int i=0; i<N; i++) val[head+i] = val_init[i];for (int pos=head-1; pos>=0; pos--) val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);}void resolve_dval(int pos, int l, int r) { // posで遅延を解消して子孫に押し付けるrefl_dval(val[pos], dval[pos]);if (pos < head){add_dval(dval[pos*2+1], dval[pos]);add_dval(dval[pos*2+2], dval[pos]);}dval[pos] = I_dval;}void update(int begin, int end, DVAL dval_q) { update(begin, end, dval_q, 0, 0, head+1); }void update(int begin, int end, DVAL dval_q, int pos, int l, int r){// 後でリファクタリングif (begin <= l && r <= end) { // 担当区間全部使うadd_dval(dval[pos], dval_q);resolve_dval(pos, l, r);}else if (begin < r && l < end) { // 少なくともどこかで交差resolve_dval(pos, l, r);update(begin, end, dval_q, pos*2+1, l, (l+r)/2);update(begin, end, dval_q, pos*2+2, (l+r)/2, r);val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);}else resolve_dval(pos, l, r);}VAL getvalue(int begin, int end) { return getvalue(begin, end, 0, 0, head+1); }VAL getvalue(int begin, int end, int pos, int l, int r){resolve_dval(pos, l, r);if (begin <= l && r <= end) return val[pos];else if (begin<r && l<end) {VAL vl = getvalue(begin, end, pos*2+1, l, (l+r)/2);VAL vr = getvalue(begin, end, pos*2+2, (l+r)/2, r);val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);return merge_val(vl, vr);}else return I_val;}};int main(){int N, M;cin >> N >> M;vector<pint> r2lp(N + 1, pint(-1, -1));using pib = pair<mint, bool>;using P = pair<mint, int>;vector<P> v(N + 1, P(0, 1));LazySegTree<P, pib> segtree(v, P(0, 0), pib(100000000, false),[](P a, P b) { return a + b; },[](pib &a, pib b) {if (b.second) a = b; },[](P &a, pib b) {if (b.second) a = make_pair(a.second * b.first, a.second); });vector<mint> pow2(N + 1, 1);FOR(i, 1, pow2.size()) pow2[i] = pow2[i - 1] * 2;segtree.update(0, 1, pib(pow2[N], 1));while (M--){int l, r, p;cin >> l >> r >> p;r2lp[r] = make_pair(l, p);}mint inv2 = mint(2).inv();int cnt = 0;FOR(r, 1, N + 1){auto [l, p] = r2lp[r];if (l == -1){segtree.update(r, r + 1, pib(segtree.getvalue(0, r).first * inv2, 1));continue;}if (p == 0){segtree.update(r, r + 1, pib(segtree.getvalue(0, r).first * inv2, 1));segtree.update(0, l, pib(0, 1));}else{segtree.update(l, r, pib(0, 1));cnt++;}}dbg(segtree.getvalue(0, N + 1));cout << segtree.getvalue(0, N + 1).first / pow2[cnt] << '\n';}