結果
問題 | No.1222 -101 |
ユーザー |
![]() |
提出日時 | 2020-09-26 12:55:12 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 214 ms / 2,000 ms |
コード長 | 10,692 bytes |
コンパイル時間 | 11,516 ms |
コンパイル使用メモリ | 291,132 KB |
最終ジャッジ日時 | 2025-01-14 22:10:57 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 35 |
ソースコード
#ifdef ONLINE_JUDGE#pragma GCC target("avx2,avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#endif//#include <atcoder/all>//using namespace atcoder;//using mint = modint998244353;//using mint = modint1000000007;#include <bits/stdc++.h>using namespace std;//#include <ext/pb_ds/assoc_container.hpp>//#include <ext/pb_ds/tree_policy.hpp>//using namespace __gnu_pbds;//using i128 = __int128_t;using ll = long long;using ull = unsigned long long;using pii = pair<int, int>;using pll = pair<long long, long long>;#define rep(i, n) for(int i = 0; i < (n); ++i)#define all(x) (x).begin(),(x).end()#define SZ(x) ((int)(x).size())constexpr char ln = '\n';template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}inline int popcount(int x) {return __builtin_popcount(x);}inline int popcount(long long x) {return __builtin_popcountll(x);}inline int kthbit(long long x, int k) {return (x>>k)&1;}inline void print() {cout << "\n";}template<class T>inline void print(const vector<T> &v) {for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";print();}template<class T, class... Args>inline void print(const T &x, const Args &... args) {cout << x << " ";print(args...);}#ifdef MINATO_LOCAL#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;inline void debug() {cerr << endl;}template<class T>inline void debug(const vector<T> &v) {for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";debug();}template<class T, class... Args>inline void debug(const T &x, const Args &... args) {cerr << x << " ";debug(args...);}#else#define dump(x) void(0)inline void debug() {}template<class T> inline void debug(const vector<T> &v) {}template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}#endifstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////template <uint_fast64_t Modulus>struct ModInt {using u64 = uint_fast64_t;u64 a;constexpr ModInt(const long long x = 0) noexcept : a(x >= 0 ? x % Modulus : (Modulus - (-x) % Modulus) % Modulus) {}constexpr u64 &value() noexcept {return a;}constexpr const u64 &value() const noexcept {return a;}constexpr ModInt operator+(const ModInt rhs) const noexcept {return ModInt(*this) += rhs;}constexpr ModInt operator-(const ModInt rhs) const noexcept {return ModInt(*this) -= rhs;}constexpr ModInt operator*(const ModInt rhs) const noexcept {return ModInt(*this) *= rhs;}constexpr ModInt operator/(const ModInt rhs) const noexcept {return ModInt(*this) /= rhs;}constexpr ModInt operator^(const long long rhs) const noexcept {return ModInt(*this) ^= rhs;}constexpr bool operator==(const ModInt &rhs) const noexcept {return a == rhs.a;}constexpr bool operator!=(const ModInt &rhs) const noexcept {return a != rhs.a;}constexpr ModInt &operator+=(const ModInt rhs) noexcept {a += rhs.a;if (a >= Modulus) {a -= Modulus;}return *this;}constexpr ModInt &operator-=(const ModInt rhs) noexcept {if (a < rhs.a) {a += Modulus;}a -= rhs.a;return *this;}constexpr ModInt &operator*=(const ModInt rhs) noexcept {a = a * rhs.a % Modulus;return *this;}constexpr ModInt &operator/=(ModInt rhs) noexcept {u64 exp = Modulus - 2;while (exp) {if (exp&1) *this *= rhs;exp >>= 1;rhs *= rhs;}return *this;}constexpr ModInt &operator^=(long long exp) noexcept {ModInt rhs = a;a = 1;while (exp) {if (exp&1) *this *= rhs;exp >>= 1;rhs *= rhs;}return *this;}friend ostream &operator<<(ostream& os, const ModInt& rhs) noexcept {return os << rhs.a;}friend istream &operator>>(istream& is, ModInt& rhs) noexcept {long long a; is >> a; rhs = a; return is;}};constexpr long long MOD = 1000000007;//constexpr long long MOD = 998244353;using mint = ModInt<MOD>;template<typename T, typename U, typename F, typename G, typename H>struct LazySegmentTree {private:F op;G mapping;H composition;T e;U id;int _n, size ,log;vector<T> node;vector<U> lazy;public:LazySegmentTree() {}LazySegmentTree(const F& op, const G& mapping, const H& composition, T e, U id, int n): LazySegmentTree(op, mapping, composition, e, id, vector<T>(n, e)) {}LazySegmentTree(const F& op, const G& mapping, const H& composition, T e, U id, const vector<T>& v): op(op), mapping(mapping), composition(composition), e(e), id(id),_n(int(v.size())), log(0) {while ((1<<log) < _n) log++;size = 1 << log;node = vector<T>(2 * size, e);lazy = vector<U>(size, id);for (int i = 0; i < _n; i++) node[size + i] = v[i];for (int i = size - 1; i >= 1; i--) {update(i);}}void set(int p, T x) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);node[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}// [l, r) (0-indexed)T get(int l, int r) {if (l >= r) return e;l += size;r += size;for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push(r >> i);}T sml = e, smr = e;while (l < r) {if (l & 1) sml = op(sml, node[l++]);if (r & 1) smr = op(node[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}T all_get() { return node[1]; }void apply(int p, U val) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);node[p] = val == id ? node[p] : mapping(node[p], val);for (int i = 1; i <= log; i++) update(p >> i);}void apply(int l, int r, U val) {if (l >= r) return;l += size;r += size;for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push((r - 1) >> i);}{int l2 = l, r2 = r;while (l < r) {if (l & 1) all_apply(l++, val);if (r & 1) all_apply(--r, val);l >>= 1;r >>= 1;}l = l2;r = r2;}for (int i = 1; i <= log; i++) {if (((l >> i) << i) != l) update(l >> i);if (((r >> i) << i) != r) update((r - 1) >> i);}}template <typename C>int max_right(int l, const C& check) {assert(0 <= l && l <= _n);assert(check(e));if (l == _n) return _n;l += size;for (int i = log; i >= 1; i--) push(l >> i);T sm = e;do {while (~l & 1) l >>= 1;if (!check(op(sm, node[l]))) {while (l < size) {push(l);l = (2 * l);if (check(op(sm, node[l]))) {sm = op(sm, node[l]);l++;}}return l - size;}sm = op(sm, node[l]);l++;} while ((l & -l) != l);return _n;}template <typename C>int min_left(int r, const C& check) {assert(0 <= r && r <= _n);assert(check(e));if (r == 0) return 0;r += size;for (int i = log; i >= 1; i--) push((r - 1) >> i);T sm = e;do {r--;while (r > 1 && (r & 1)) r >>= 1;if (!check(op(node[r], sm))) {while (r < size) {push(r);r = (2 * r + 1);if (check(op(node[r], sm))) {sm = op(node[r], sm);r--;}}return r + 1 - size;}sm = op(node[r], sm);} while ((r & -r) != r);return 0;}T operator[](int p) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);return node[p];}private:void update(int k) { node[k] = op(node[2 * k], node[2 * k + 1]); }void all_apply(int k, U val) {node[k] = val == id ? node[k] : mapping(node[k], val);if (k < size) lazy[k] = composition(lazy[k], val);}void push(int k) {if (lazy[k] == id) return;all_apply(2 * k, lazy[k]);all_apply(2 * k + 1, lazy[k]);lazy[k] = id;}};int main() {int N,M; cin >> N >> M;vector<int> A(N+1);vector<pii> R(N+1,pii(-1,-1));int rank = 0;rep(i,M) {int l,r,p; cin >> l >> r >> p;l--;R[r] = pii(l,p);if (p != 0) {A[l]++;A[r]--;rank++;}}rep(i,N) A[i+1] += A[i];mint ans = 2;int cnt = 0;rep(i,N) if (A[i]) cnt++;ans ^= (cnt-rank);auto f=[](mint a, mint b) {return a+b;};auto g=[](mint a, mint b) {return a*b;};const mint e = 0;const mint id = 1;LazySegmentTree seg(f,g,g,e,id,N+1);seg.set(0,1);rep(i,N) {if (A[i]==0) {seg.set(i+1,seg.get(0,i+1));seg.apply(0,i+1,2);}if (R[i+1].second==0) {int l = R[i+1].first;seg.apply(0,l+1,0);}}ans *= seg.all_get();cout << ans << ln;}