結果

問題 No.1222 -101
ユーザー hitonanodehitonanode
提出日時 2020-09-04 22:46:12
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 13,540 bytes
コンパイル時間 2,849 ms
コンパイル使用メモリ 228,084 KB
実行使用メモリ 21,184 KB
最終ジャッジ日時 2024-11-26 20:40:04
合計ジャッジ時間 8,222 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 WA -
testcase_10 AC 133 ms
21,136 KB
testcase_11 AC 132 ms
21,012 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 2 ms
5,248 KB
testcase_23 WA -
testcase_24 AC 2 ms
5,248 KB
testcase_25 WA -
testcase_26 AC 2 ms
5,248 KB
testcase_27 WA -
testcase_28 AC 2 ms
5,248 KB
testcase_29 AC 2 ms
5,248 KB
testcase_30 AC 2 ms
5,248 KB
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 AC 229 ms
21,144 KB
testcase_35 AC 229 ms
21,100 KB
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
権限があれば一括ダウンロードができます

ソースコード

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

#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()); return
    vec; }
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 >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return
    is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);},
    tpl); return os; }
#endif
template <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 << '}'; return
    os; }
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)
#endif
template <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>;
template <typename TDATA, typename TLAZY, typename TRET, typename TQUERY>
struct LazySegmentTree
{
TLAZY zero_lazy;
TRET zero_ret;
int N;
int head;
std::vector<TDATA> data;
std::vector<TLAZY> lazy;
// Here, you have to calculate data[pos] from children (data[l], data[r]),
// Assumptions: `lazy[pos] = lazy[l] = lazy[r] = zero_lazy`
virtual void merge_data(int pos) = 0;
// Here, you must propagate lazy[pos] and update data[pos] by reflecting lazy[pos], without inconsistency
// After this, lazy[pos] must be zero_lazy.
virtual void reflect_lazy(int pos) = 0;
// operate d to lazy[pos] (merge two TLAZY's)
virtual void overlap_lazy(int pos, const TLAZY &d) = 0;
// Assumption: `lazy[pos] = zero_lazy`
virtual TRET data2ret(int pos, const TQUERY &query) = 0;
virtual TRET merge_ret(const TRET &l, const TRET &r, const TQUERY &query) = 0;
////// general description //////
LazySegmentTree() = default;
void initialize(const std::vector<TDATA> &data_init, const TDATA &zero_data, const TLAZY &zero_lazy_, const TRET &zero_ret_)
{
N = data_init.size();
head = 1;
while (head < N) head <<= 1;
zero_lazy = zero_lazy_;
zero_ret = zero_ret_;
data.assign(head * 2, zero_data);
lazy.assign(head * 2, zero_lazy);
std::copy(data_init.begin(), data_init.end(), data.begin() + head);
for (int pos = head; --pos;) merge_data(pos);
}
void _update(int begin, int end, const TLAZY &delay, int pos, int l, int r)
{
// Operate `delay` to the node pos
// After this, lazy[pos] MUST be zero so that merge_data() works correctly
if (begin <= l and r <= end) { // Update whole [l, r) by delay
overlap_lazy(pos, delay);
reflect_lazy(pos);
}
else if (begin < r and l < end) { // Update somewhere in [l, r)
reflect_lazy(pos);
_update(begin, end, delay, pos * 2, l, (l + r) / 2);
_update(begin, end, delay, pos * 2 + 1, (l + r) / 2, r);
merge_data(pos);
}
else reflect_lazy(pos);
}
void update(int begin, int end, const TLAZY &delay) {
_update(begin, end, delay, 1, 0, head);
}
TRET _get(int begin, int end, int pos, int l, int r, const TQUERY &query) // Get value in [begin, end)
{
reflect_lazy(pos);
if (begin <= l and r <= end) return data2ret(pos, query);
else if (begin < r and l < end) {
TRET vl = _get(begin, end, pos * 2, l, (l + r) / 2, query);
TRET vr = _get(begin, end, pos * 2 + 1, (l + r) / 2, r, query);
return merge_ret(vl, vr, query);
}
else return zero_ret;
}
TRET get(int begin, int end, const TQUERY &query = NULL)
{
return _get(begin, end, 1, 0, head, query);
}
};
struct Empty {
};
template <typename T>
struct RangeUpdateRangeSum : public LazySegmentTree<std::pair<T, size_t>, std::pair<T, bool>, T, Empty>
{
using TDATA = std::pair<T, size_t>;
using TLAZY = std::pair<T, bool>;
using SegTree = LazySegmentTree<TDATA, TLAZY, T, Empty>;
using SegTree::data;
using SegTree::lazy;
void merge_data(int i) override
{
data[i] = std::make_pair(data[i * 2].first + data[i * 2 + 1].first, data[i * 2].second + data[i * 2 + 1].second);
};
void reflect_lazy(int i) override
{
if (lazy[i].second) data[i].first = data[i].second * lazy[i].first, lazy[i].first = 0, lazy[i].second = false;
}
void overlap_lazy(int i, const TLAZY &p) override
{
if (p.second) lazy[i] = p;
}
T data2ret(int i, const Empty &) override { return data[i].first; }
T merge_ret(const T &l, const T &r, const Empty&) override { return l + r; }
void update(int l, int r, T val) { SegTree::update(l, r, TLAZY(val, true)); }
T get(int l, int r) { return SegTree::get(l, r, {}); }
RangeUpdateRangeSum(const std::vector<T> &seq) : SegTree::LazySegmentTree()
{
std::vector<TDATA> vec;
for (const auto &x : seq) vec.emplace_back(x, 1);
SegTree::initialize(vec, TDATA(0, 0), TLAZY(0, false), 0);
}
};
int main()
{
int N, M;
cin >> N >> M;
vector<pint> r2lp(N + 1, pint(-1, -1));
vector<mint> v(N + 1, 0);
RangeUpdateRangeSum<mint> segtree(v);
vector<mint> pow2(N + 1, 1);
FOR(i, 1, pow2.size()) pow2[i] = pow2[i - 1] * 2;
segtree.update(0, 1, pow2[N]);
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, segtree.get(0, r) * inv2);
continue;
}
if (p == 0)
{
segtree.update(r, r + 1, segtree.get(0, r) * inv2);
segtree.update(0, l, 0);
}
else
{
segtree.update(l, r, 0);
cnt++;
}
}
cout << segtree.get(0, N + 1) / pow2[cnt] << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0