結果

問題 No.1222 -101
ユーザー mtsd
提出日時 2020-09-04 22:30:34
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 632 ms / 2,000 ms
コード長 7,911 bytes
コンパイル時間 1,496 ms
コンパイル使用メモリ 133,108 KB
実行使用メモリ 12,672 KB
最終ジャッジ日時 2024-11-26 14:58:50
合計ジャッジ時間 10,375 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
template<class T> inline bool chmax(T &a, T b){
if(a<b){
a = b;
return true;
}
return false;
}
template<class T> inline bool chmin(T &a, T b){
if(a>b){
a = b;
return true;
}
return false;
}
template <unsigned int mod>
class ModInt {
private:
unsigned int v;
static unsigned int norm(const unsigned int& x){ return x < mod ? x : x - mod; }
static ModInt make(const unsigned int& x){ ModInt m; return m.v = x, m; }
static ModInt inv(const ModInt& x){ return make(inverse(x.v, mod)); }
static unsigned int inverse(int a, int m){
int u[] = {a, 1, 0}, v[] = {m, 0, 1}, t;
while(*v){
t = *u / *v;
swap(u[0] -= t * v[0], v[0]), swap(u[1] -= t * v[1], v[1]), swap(u[2] -= t * v[2], v[2]);
}
return (u[1] % m + m) % m;
}
public:
ModInt() : v{0}{}
ModInt(const long long val) : v{norm(val % mod + mod)} {}
ModInt(const ModInt<mod>& n) : v{n()} {}
explicit operator bool() const noexcept { return v != 0; }
bool operator!() const noexcept { return !static_cast<bool>(*this); }
ModInt& operator=(const ModInt& n){ return v = n(), (*this); }
ModInt& operator=(const long long val){ return v = norm(val % mod + mod), (*this); }
ModInt operator+() const { return *this; }
ModInt operator-() const { return v == 0 ? make(0) : make(mod - v); }
ModInt operator+(const ModInt& val) const { return make(norm(v + val())); }
ModInt operator-(const ModInt& val) const { return make(norm(v + mod - val())); }
ModInt operator*(const ModInt& val) const { return make((long long)v * val() % mod); }
ModInt operator/(const ModInt& val) const { return *this * inv(val); }
ModInt& operator+=(const ModInt& val){ return *this = *this + val; }
ModInt& operator-=(const ModInt& val){ return *this = *this - val; }
ModInt& operator*=(const ModInt& val){ return *this = *this * val; }
ModInt& operator/=(const ModInt& val){ return *this = *this / val; }
ModInt operator+(const long long val) const { return ModInt{v + val}; }
ModInt operator-(const long long val) const { return ModInt{v - val}; }
ModInt operator*(const long long val) const { return ModInt{(long long)v * (val % mod)}; }
ModInt operator/(const long long val) const { return ModInt{(long long)v * inv(val)}; }
ModInt& operator+=(const long long val){ return *this = *this + val; }
ModInt& operator-=(const long long val){ return *this = *this - val; }
ModInt& operator*=(const long long val){ return *this = *this * val; }
ModInt& operator/=(const long long val){ return *this = *this / val; }
bool operator==(const ModInt& val) const { return v == val.v; }
bool operator!=(const ModInt& val) const { return !(*this == val); }
bool operator==(const long long val) const { return v == norm(val % mod + mod); }
bool operator!=(const long long val) const { return !(*this == val); }
unsigned int operator()() const { return v; }
friend ModInt operator+(const long long val, const ModInt& n) { return n + val; }
friend ModInt operator-(const long long val, const ModInt& n) { return ModInt{val - n()}; }
friend ModInt operator*(const long long val, const ModInt& n) { return n * val; }
friend ModInt operator/(const long long val, const ModInt& n) { return ModInt{val} / n; }
friend bool operator==(const long long val, const ModInt& n) { return n == val; }
friend bool operator!=(const long long val, const ModInt& n) { return !(val == n); }
friend istream& operator>>(istream& is, ModInt& n){
unsigned int v;
return is >> v, n = v, is;
}
friend ostream& operator<<(ostream& os, const ModInt& n){ return (os << n()); }
friend ModInt mod_pow(ModInt x, long long n){
ModInt ans = 1;
while(n){
if(n & 1) ans *= x;
x *= x, n >>= 1;
}
return ans;
}
};
#define MOD 1000000007
using mod = ModInt<MOD>;
template<typename T> class segtree {
private:
int n,sz,h; vector<T> node, lazy_update, lazy_add; vector<bool> lazyFlag;
public:
segtree(vector<T> v) : n(1), sz((int)v.size()), h(0){
while(n < sz) n *= 2, h++;
node.resize(2*n, 0);
lazy_update.resize(2*n, 0); lazyFlag.resize(2*n, false);
lazy_add.resize(2*n, 1);
for(int i = 0; i < sz; i++) node[i+n] = v[i];
for(int i=n-1; i>=1; i--) node[i] = node[2*i] + node[2*i+1];
}
void eval(int k) {
if(lazyFlag[k]){
lazy_update[k] *= lazy_add[k];
node[k] = lazy_update[k];
if(k < n) {
lazy_add[2*k] = lazy_add[2*k+1] = 0;
lazy_update[2*k] = lazy_update[2*k+1] = lazy_update[k] ;
lazyFlag[2*k] = lazyFlag[2*k+1] = true;
}
lazy_add[k] = 1, lazyFlag[k] = false;
}else if(lazy_add[k] != 0){
node[k] *= lazy_add[k];
if(k < n){
lazy_add[2*k] *= lazy_add[k]; lazy_add[2*k+1] *= lazy_add[k] ;
}
lazy_add[k] = 1;
}
}
void update(int a, int b, T x, int k=1, int l=0, int r=-1) {
if(r < 0) r = n;
eval(k);
if(b <= l || r <= a) return;
if(a <= l && r <= b){
lazy_update[k] = x*(r-l); lazyFlag[k] = true; eval(k);
}else{
update(a, b, x, 2*k, l, (l+r)/2); update(a, b, x, 2*k+1, (l+r)/2, r);
node[k] = node[2*k] + node[2*k+1];
}
}
void add(int a, int b, T x, int k=1, int l=0, int r=-1){
if(r < 0) r = n;
eval(k);
if(b <= l || r <= a) return;
if(a <= l && r <= b){
lazy_add[k] *= x; eval(k);
}else{
add(a, b, x, 2*k, l, (l+r)/2); add(a, b, x, 2*k+1, (l+r)/2, r);
node[k] = node[2*k] + node[2*k+1];
}
}
T query(int a, int b) {
a += n, b += n - 1;
for(int i = h; i > 0; i--) eval(a >> i), eval(b >> i);
b++;
T res1 = 0, res2 = 0;
while(a < b) {
if(a & 1) eval(a), res1 += node[a++];
if(b & 1) eval(--b), res2 += node[b];
a >>= 1, b >>= 1;
}
return res1 + res2;
}
void print(){for(int i = 0; i < sz; i++)cout<<query(i,i+1)<< " ";cout<<endl;}
};
int ng[200010];
int Q[200010];
int main(){
int n,m;
cin >> n >> m;
mod P = 1;
rep(i,m){
int l,r,p;
cin >> l >> r >> p;
if(p!=0){
ng[l]++;
ng[r+1]--;
P *= 2;
}else{
Q[r] = l;
}
}
rep(i,n){
ng[i+1] += ng[i];
}
vector<mod> v(n+1);
v[0] = 1;
segtree<mod> sg(v);
for(int i=1;i<=n;i++){
if(ng[i]){
sg.add(0,i,2);
}else{
sg.update(i,i+1,sg.query(0,i));
sg.add(0,i,2);
}
if(Q[i]!=0){
sg.update(0,Q[i],0);
}
// cerr << "test " << i << ": ";
// sg.print();
}
cout << sg.query(0,n+1) / P << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0