#549652 (C++17) No.1222 -101

提出ソース

結果

問題	No.1222 -101
ユーザー	👑 emthrm
提出日時	2020-09-07 21:45:28
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,387 bytes
コンパイル時間	3,667 ms
コンパイル使用メモリ	212,020 KB
実行使用メモリ	18,180 KB
最終ジャッジ日時	2023-08-19 17:13:16
合計ジャッジ時間	7,603 ms
ジャッジサーバーID （参考情報）	judge15 / judge12

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	2 ms 4,380 KB
testcase_02	AC	1 ms 4,380 KB
testcase_03	AC	2 ms 4,376 KB
testcase_04	AC	2 ms 4,376 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	1 ms 4,376 KB
testcase_07	AC	2 ms 4,380 KB
testcase_08	AC	2 ms 4,376 KB
testcase_09	AC	2 ms 4,376 KB
testcase_10	WA	-
testcase_11	AC	128 ms 16,628 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	1 ms 4,380 KB
testcase_23	AC	1 ms 4,376 KB
testcase_24	AC	2 ms 4,376 KB
testcase_25	AC	2 ms 4,376 KB
testcase_26	WA	-
testcase_27	AC	2 ms 4,380 KB
testcase_28	AC	2 ms 4,376 KB
testcase_29	WA	-
testcase_30	WA	-
testcase_31	AC	2 ms 4,380 KB
testcase_32	WA	-
testcase_33	WA	-
testcase_34	AC	148 ms 15,412 KB
testcase_35	AC	143 ms 15,544 KB
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int mod = MOD;
struct ModInt {
  unsigned val;
  ModInt(): val(0) {}
  ModInt(ll x) : val(x >= 0 ? x % mod : x % mod + mod) {}
  ModInt pow(ll exponent) const {
    ModInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  ModInt &operator+=(const ModInt &x) { if((val += x.val) >= mod) val -= mod; return *this; }
  ModInt &operator-=(const ModInt &x) { if((val += mod - x.val) >= mod) val -= mod; return *this; }
  ModInt &operator*=(const ModInt &x) { val = static_cast<unsigned long long>(val) * x.val % mod; return *this; }
  ModInt &operator/=(const ModInt &x) {
    // assert(__gcd(static_cast<int>(x.val), mod) == 1);
    unsigned a = x.val, b = mod; int u = 1, v = 0;
    while (b) {
      unsigned tmp = a / b;
      swap(a -= tmp * b, b);
      swap(u -= tmp * v, v);
    }
    return *this *= u;
  }
  bool operator==(const ModInt &x) const { return val == x.val; }
  bool operator!=(const ModInt &x) const { return val != x.val; }
  bool operator<(const ModInt &x) const { return val < x.val; }
  bool operator<=(const ModInt &x) const { return val <= x.val; }
  bool operator>(const ModInt &x) const { return val > x.val; }
  bool operator>=(const ModInt &x) const { return val >= x.val; }
  ModInt &operator++() { if (++val == mod) val = 0; return *this; }
  ModInt operator++(int) { ModInt res = *this; ++*this; return res; }
  ModInt &operator--() { val = (val == 0 ? mod : val) - 1; return *this; }
  ModInt operator--(int) { ModInt res = *this; --*this; return res; }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { return ModInt(val ? mod - val : 0); }
  ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
  ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
  ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
  ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
  friend ostream &operator<<(ostream &os, const ModInt &x) { return os << x.val; }
  friend istream &operator>>(istream &is, ModInt &x) { ll val; is >> val; x = ModInt(val); return is; }
};
ModInt abs(const ModInt &x) { return x; }
struct Combinatorics {
  int val; // "val!" and "mod" must be disjoint.
  vector<ModInt> fact, fact_inv, inv;
  Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
    fact[0] = 1;
    FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i;
    fact_inv[val] = ModInt(1) / fact[val];
    for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
    FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i];
  }
  ModInt nCk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val && k <= val);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) const {
    if (n < 0 || k < 0) return ModInt(0);
    return k == 0 ? ModInt(1) : nCk(n + k - 1, k);
  }
};

int main() {
  int n, m; cin >> n >> m;
  vector<int> l(m), p(m);
  vector left(n, -1), imos(n, 0);
  REP(i, m) {
    int r; cin >> l[i] >> r >> p[i]; --l[i]; --r;
    left[r] = i;
    if (p[i] != 0) {
      ++imos[l[i]];
      if (r + 1 < n) --imos[r + 1];
    }
  }
  ModInt dp1 = 1;
  set<int> st;
  REP(i, n) st.emplace(i);
  REP(i, n) {
    if (left[i] != -1 && p[left[i]] != 0) {
      int num = 0;
      for (auto it = st.lower_bound(l[left[i]]); it != st.end() && *it <= i; it = st.erase(it)) ++num;
      dp1 *= ModInt(2).pow(num - 1);
    }
  }
  FOR(i, 1, n) imos[i] += imos[i - 1];
  vector dp2(n, ModInt(0)), cum(n, ModInt(0));
  vector<int> zero{-1};
  int rm = -1;
  REP(i, n) {
    if (imos[i] == 0) {
      int last = zero.empty() ? -1 : zero.back();
      auto it = lower_bound(ALL(zero), rm);
      if (it == zero.end()) {
        cout << 0 << '\n';
        return 0;
      }
      dp2[i] = (last == -1 ? 1 : cum[last]) - (*it == -1 ? 0 : *prev(it) == -1 ? 1 : cum[*prev(it)]);
      cum[i] = (last == -1 ? 1 : cum[i - 1]) * 2 + dp2[i];
      zero.emplace_back(i);
    }
    if (left[i] != -1 && p[left[i]] == 0) chmax(rm, l[left[i]]);
  }
  ModInt ans = 0;
  int fr = 0;
  for (int i = n - 1; i >= rm && i >= 0; --i) {
    ans += ModInt(2).pow(fr) * dp2[i];
    fr += imos[i] == 0;
  }
  if (rm == -1) ans += ModInt(2).pow(fr);
  ans *= dp1;
  cout << ans << '\n';
  return 0;
}

yukicoder

結果

テストケース

ソースコード