#770106 (C++23) No.1975 Zigzag Sequence

提出ソース

結果

問題	No.1975 Zigzag Sequence
ユーザー	kkishi
提出日時	2022-06-11 00:07:07
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	189 ms / 2,000 ms
コード長	14,736 bytes
コンパイル時間	3,226 ms
コンパイル使用メモリ	269,592 KB
実行使用メモリ	6,408 KB
最終ジャッジ日時	2024-09-21 07:14:59
合計ジャッジ時間	7,499 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	17 ms 5,376 KB
testcase_04	AC	8 ms 5,376 KB
testcase_05	AC	148 ms 5,376 KB
testcase_06	AC	105 ms 5,376 KB
testcase_07	AC	19 ms 5,376 KB
testcase_08	AC	92 ms 5,376 KB
testcase_09	AC	145 ms 5,488 KB
testcase_10	AC	103 ms 5,376 KB
testcase_11	AC	115 ms 5,376 KB
testcase_12	AC	27 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	2 ms 5,376 KB
testcase_18	AC	56 ms 5,380 KB
testcase_19	AC	56 ms 5,376 KB
testcase_20	AC	103 ms 5,376 KB
testcase_21	AC	104 ms 5,376 KB
testcase_22	AC	144 ms 6,272 KB
testcase_23	AC	141 ms 6,408 KB
testcase_24	AC	149 ms 6,400 KB
testcase_25	AC	154 ms 6,268 KB
testcase_26	AC	161 ms 5,380 KB
testcase_27	AC	189 ms 5,892 KB
testcase_28	AC	146 ms 6,280 KB
testcase_29	AC	143 ms 6,284 KB
testcase_30	AC	144 ms 6,272 KB
testcase_31	AC	142 ms 6,268 KB
testcase_32	AC	58 ms 5,376 KB
testcase_33	AC	59 ms 5,376 KB
testcase_34	AC	156 ms 5,628 KB
testcase_35	AC	159 ms 5,516 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>

template <typename T>
class SegmentTree {
 public:
  using Operation = std::function<T(T, T)>;
  SegmentTree(int size, Operation operation, T identity = T())
      : operation_(operation), identity_(identity) {
    int two = 1;
    while (two < size) {
      two <<= 1;
    }
    v_.resize(two * 2 - 1, identity_);
  }
  void Set(int i, T v) {
    int index = Leaf(i);
    while (true) {
      v_[index] = v;
      if (index == 0) break;
      v = operation_(v, v_[index + (IsRight(index) ? -1 : 1)]);
      index = Parent(index);
    }
  }
  T Get(int i) const { return Aggregate(i, i + 1); }
  T Aggregate(int begin, int end) const {
    int l = Leaf(begin), r = Leaf(end);
    T v = identity_;
    while (l < r) {
      if (IsRight(l)) {
        v = operation_(v, v_[l]);
        ++l;
      }
      l = Parent(l);
      if (IsRight(r)) {
        v = operation_(v, v_[r - 1]);
      }
      r = Parent(r);
    }
    return v;
  }

 private:
  int Leaf(int i) const { return i + (v_.size() >> 1); }
  bool IsRight(int i) const { return !(i & 1); }
  int Parent(int i) const { return (i - 1) >> 1; }
  const Operation operation_;
  const T identity_;
  std::vector<T> v_;
};

template <typename T>
class AddSegmentTree : public SegmentTree<T> {
 public:
  AddSegmentTree(int n) : SegmentTree<T>(n, [](T a, T b) { return a + b; }) {}
};

struct Compressor {
  Compressor(const std::vector<int64_t>& v) : coord(v) {
    std::sort(coord.begin(), coord.end());
    coord.erase(std::unique(coord.begin(), coord.end()), coord.end());
  }
  int64_t operator()(int64_t x) const {
    return std::lower_bound(coord.begin(), coord.end(), x) - coord.begin();
  }
  std::vector<int64_t> coord;
};
#ifndef MODINT_H_
#define MODINT_H_

#ifndef DASSERT_H_
#define DASSERT_H_

#if DEBUG
#define dassert(x) assert(x)
#else
#define dassert(x) ((void)0)
#endif

#endif  // DASSERT_H_

namespace {
using i32 = int32_t;
using i64 = int64_t;
}  // namespace

#define BIN_OPS(F) F(+) F(-) F(*) F(/)
#define CMP_OPS(F) F(!=) F(<) F(<=) F(==) F(>) F(>=)

template <i32 Mod = 1000000007>
class ModInt {
 public:
  ModInt() : n_(0) {}
  ModInt(i64 n) : n_(n % Mod) {
    if (n_ < 0) {
      // In C++, (-n)%m == -(n%m).
      n_ += Mod;
    }
  }
  ModInt& operator+=(const ModInt& m) {
    n_ += m.n_;
    if (n_ >= Mod) {
      n_ -= Mod;
    }
    return *this;
  }
  ModInt& operator++() { return (*this) += 1; }
  ModInt& operator-=(const ModInt& m) {
    n_ -= m.n_;
    if (n_ < 0) {
      n_ += Mod;
    }
    return *this;
  }
  ModInt& operator--() { return (*this) -= 1; }
  ModInt& operator*=(const ModInt& m) {
    n_ = i64(n_) * m.n_ % Mod;
    return *this;
  }
  ModInt& operator/=(const ModInt& m) {
    *this *= m.Inv();
    return *this;
  }
#define DEFINE(op) \
  ModInt operator op(const ModInt& m) const { return ModInt(*this) op## = m; }
  BIN_OPS(DEFINE)
#undef DEFINE
#define DEFINE(op) \
  bool operator op(const ModInt& m) const { return n_ op m.n_; }
  CMP_OPS(DEFINE)
#undef DEFINE
  ModInt operator-() const { return ModInt(-n_); }
  ModInt Pow(i64 n) const {
    if (n < 0) {
      return Inv().Pow(-n);
    }
    // a * b ^ n = answer.
    ModInt a = 1, b = *this;
    while (n != 0) {
      if (n & 1) {
        a *= b;
      }
      n /= 2;
      b *= b;
    }
    return a;
  }
  ModInt Inv() const {
    dassert(n_ != 0);
    if (n_ > kMaxCacheSize) {
      // Compute the inverse based on Fermat's little theorem. Note that this
      // only works when n_ and Mod are relatively prime. The theorem says that
      // n_^(Mod-1) = 1 (mod Mod). So we can compute n_^(Mod-2).
      return Pow(Mod - 2);
    }
    for (i64 i = inv_.size(); i <= n_; ++i) {
      inv_.push_back(i <= 1 ? i : (Mod / i * -inv_[Mod % i]));
    }
    return inv_[n_];
  }
  i64 value() const { return n_; }

  static ModInt Fact(i64 n) {
    dassert(0 <= n && n <= kMaxCacheSize);
    for (i64 i = fact_.size(); i <= n; ++i) {
      fact_.push_back(i == 0 ? 1 : fact_.back() * i);
    }
    return fact_[n];
  }
  static ModInt InvFact(i64 n) {
    dassert(0 <= n && n <= kMaxCacheSize);
    for (i64 i = inv_fact_.size(); i <= n; ++i) {
      inv_fact_.push_back(i == 0 ? 1 : inv_fact_.back() / i);
    }
    return inv_fact_[n];
  }
  static ModInt Comb(i64 n, i64 k) {
    if (!Valid(n, k)) return 0;
    return Perm(n, k) * InvFact(k);
  }
  static ModInt CombSlow(i64 n, i64 k) {
    if (!Valid(n, k)) return 0;
    return PermSlow(n, k) * InvFact(k);
  }
  static ModInt Perm(i64 n, i64 k) {
    if (!Valid(n, k)) return 0;
    dassert(n <= kMaxCacheSize &&
            "n is too large. If k is small, consider using PermSlow.");
    return Fact(n) * InvFact(n - k);
  }
  static ModInt PermSlow(i64 n, i64 k) {
    if (!Valid(n, k)) return 0;
    ModInt p = 1;
    for (i64 i = 0; i < k; ++i) {
      p *= (n - i);
    }
    return p;
  }

 private:
  static bool Valid(i64 n, i64 k) { return 0 <= n && 0 <= k && k <= n; }

  i32 n_;
  inline static std::vector<ModInt> fact_;
  inline static std::vector<ModInt> inv_fact_;
  inline static std::vector<ModInt> inv_;
  static const i64 kMaxCacheSize = 10000000;
};

#define DEFINE(op)                                            \
  template <i32 Mod, typename T>                              \
  ModInt<Mod> operator op(const T& t, const ModInt<Mod>& m) { \
    return ModInt<Mod>(t) op m;                               \
  }
BIN_OPS(DEFINE)
CMP_OPS(DEFINE)
#undef DEFINE

template <i32 Mod>
std::ostream& operator<<(std::ostream& out, const ModInt<Mod>& m) {
  out << m.value();
  return out;
}

#endif  // MODINT_H_

#ifndef CONSTANTS_H_
#define CONSTANTS_H_

// big = 2305843009213693951 = 2^61-1 ~= 2.3*10^18
const int64_t big = std::numeric_limits<int64_t>::max() / 4;

#endif  // CONSTANTS_H_
#ifndef DEBUG_H_
#define DEBUG_H_

#ifndef TYPE_TRAITS_H_
#define TYPE_TRAITS_H_

template <typename T, typename = void>
struct is_dereferenceable : std::false_type {};
template <typename T>
struct is_dereferenceable<T, std::void_t<decltype(*std::declval<T>())>>
    : std::true_type {};

template <typename T, typename = void>
struct is_iterable : std::false_type {};
template <typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
                                  decltype(std::end(std::declval<T>()))>>
    : std::true_type {};

template <typename T, typename = void>
struct is_applicable : std::false_type {};
template <typename T>
struct is_applicable<T, std::void_t<decltype(std::tuple_size<T>::value)>>
    : std::true_type {};

#endif  // TYPE_TRAITS_H

template <typename T, typename... Ts>
void debug(std::ostream& os, const T& value, const Ts&... args);
template <typename T>
void debug(std::ostream& os, const T& v) {
  if constexpr (std::is_same<int64_t, std::decay_t<T>>::value) {
    if (v == big) {
      os << "big";
    } else {
      os << v;
    }
  } else if constexpr (std::is_same<char*, std::decay_t<T>>::value ||
                       std::is_same<std::string, T>::value) {
    os << v;
  } else if constexpr (is_dereferenceable<T>::value) {
    os << "{";
    if (v) {
      debug(os, *v);
    } else {
      os << "nil";
    }
    os << "}";
  } else if constexpr (is_iterable<T>::value) {
    os << "{";
    for (auto it = std::begin(v); it != std::end(v); ++it) {
      if (it != std::begin(v)) os << ", ";
      debug(os, *it);
    }
    os << "}";
  } else if constexpr (is_applicable<T>::value) {
    os << "{";
    std::apply([&os](const auto&... args) { debug(os, args...); }, v);
    os << "}";
  } else {
    os << v;
  }
}
template <typename T, typename... Ts>
void debug(std::ostream& os, const T& value, const Ts&... args) {
  debug(os, value);
  os << ", ";
  debug(os, args...);
}
#if DEBUG
#define dbg(...)                             \
  do {                                       \
    std::cerr << #__VA_ARGS__ << ": ";       \
    debug(std::cerr, __VA_ARGS__);           \
    std::cerr << " (L" << __LINE__ << ")\n"; \
  } while (0)
#else
#define dbg(...)
#endif

#endif  // DEBUG_H_
#ifndef FIX_H_
#define FIX_H_

template <class F>
struct FixPoint {
  F f;
  template <class... Args>
  decltype(auto) operator()(Args&&... args) const {
    return f(std::ref(*this), std::forward<Args>(args)...);
  }
};
template <class F>
FixPoint<std::decay_t<F>> Fix(F&& f) {
  return {std::forward<F>(f)};
}

#endif  // FIX_H_
#ifndef IO_H_
#define IO_H

void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
  std::cin >> value;
  read_from_cin(args...);
}
#define rd(type, ...) \
  type __VA_ARGS__;   \
  read_from_cin(__VA_ARGS__);
#define ints(...) rd(int, __VA_ARGS__);
#define strings(...) rd(string, __VA_ARGS__);

const char *yes_str = "Yes", *no_str = "No";

template <typename T>
void write_to_cout(const T& value) {
  if constexpr (std::is_same<T, bool>::value) {
    std::cout << (value ? yes_str : no_str);
  } else if constexpr (is_iterable<T>::value &&
                       !std::is_same<T, std::string>::value) {
    for (auto it = std::begin(value); it != std::end(value); ++it) {
      if (it != std::begin(value)) std::cout << " ";
      std::cout << *it;
    }
  } else {
    std::cout << value;
  }
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
  write_to_cout(value);
  std::cout << ' ';
  write_to_cout(args...);
}
#define wt(...)                 \
  do {                          \
    write_to_cout(__VA_ARGS__); \
    cout << '\n';               \
  } while (0)

template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& v) {
  for (T& vi : v) is >> vi;
  return is;
}

template <typename T, typename U>
std::istream& operator>>(std::istream& is, std::pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}

#endif  // IO_H_
#ifndef MACROS_H_
#define MACROS_H_

#define all(x) (x).begin(), (x).end()
#define eb(...) emplace_back(__VA_ARGS__)
#define pb(...) push_back(__VA_ARGS__)

#define dispatch(_1, _2, _3, name, ...) name

#define as_i64(x)                                                          \
  (                                                                        \
      [] {                                                                 \
        static_assert(                                                     \
            std::is_integral<                                              \
                typename std::remove_reference<decltype(x)>::type>::value, \
            "rep macro supports std integral types only");                 \
      },                                                                   \
      static_cast<int64_t>(x))

#define rep3(i, a, b) for (int64_t i = as_i64(a); i < as_i64(b); ++i)
#define rep2(i, n) rep3(i, 0, n)
#define rep1(n) rep2(_loop_variable_, n)
#define rep(...) dispatch(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep3(i, a, b) for (int64_t i = as_i64(b) - 1; i >= as_i64(a); --i)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep1(n) rrep2(_loop_variable_, n)
#define rrep(...) dispatch(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__)

#define each3(k, v, c) for (auto&& [k, v] : c)
#define each2(e, c) for (auto&& e : c)
#define each(...) dispatch(__VA_ARGS__, each3, each2)(__VA_ARGS__)

template <typename T, typename U>
bool chmax(T& a, U b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T, typename U>
bool chmin(T& a, U b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T, typename U>
auto max(T a, U b) {
  return a > b ? a : b;
}

template <typename T, typename U>
auto min(T a, U b) {
  return a < b ? a : b;
}

template <typename T>
auto max(const T& v) {
  return *std::max_element(v.begin(), v.end());
}

template <typename T>
auto min(const T& v) {
  return *std::min_element(v.begin(), v.end());
}

template <typename T>
int64_t sz(const T& v) {
  return std::size(v);
}

template <typename T>
int64_t popcount(T i) {
  return std::bitset<std::numeric_limits<T>::digits>(i).count();
}

template <typename T>
bool hasbit(T s, int i) {
  return std::bitset<std::numeric_limits<T>::digits>(s)[i];
}

template <typename T, typename U>
auto div_floor(T n, U d) {
  if (d < 0) {
    n = -n;
    d = -d;
  }
  if (n < 0) {
    return -((-n + d - 1) / d);
  }
  return n / d;
};

template <typename T, typename U>
auto div_ceil(T n, U d) {
  if (d < 0) {
    n = -n;
    d = -d;
  }
  if (n < 0) {
    return -(-n / d);
  }
  return (n + d - 1) / d;
}

template <typename T>
bool even(T x) {
  return x % 2 == 0;
}

std::array<std::pair<int64_t, int64_t>, 4> adjacent(int64_t i, int64_t j) {
  return {{{i + 1, j}, {i, j + 1}, {i - 1, j}, {i, j - 1}}};
}

bool inside(int64_t i, int64_t j, int64_t I, int64_t J) {
  return 0 <= i && i < I && 0 <= j && j < J;
}

template <typename T>
void sort(T& v) {
  return std::sort(v.begin(), v.end());
}

template <typename T, typename Compare>
void sort(T& v, Compare comp) {
  return std::sort(v.begin(), v.end(), comp);
}

template <typename T>
void reverse(T& v) {
  return std::reverse(v.begin(), v.end());
}

template <typename T>
typename T::value_type accumulate(const T& v) {
  return std::accumulate(v.begin(), v.end(), typename T::value_type());
}

using i64 = int64_t;
using i32 = int32_t;

template <typename T>
using low_priority_queue =
    std::priority_queue<T, std::vector<T>, std::greater<T>>;

template <typename T>
using V = std::vector<T>;
template <typename T>
using VV = V<V<T>>;

#endif  // MACROS_H_

void Main();

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  std::cout << std::fixed << std::setprecision(20);
  Main();
  return 0;
}

using namespace std;

#define int i64

using mint = ModInt<>;

void Main() {
  ints(n);
  V<int> a(n);
  cin >> a;
  Compressor c(a);
  int N = sz(c.coord);
  mint ans = 0;
  {
    V<mint> p(n);
    {
      AddSegmentTree<mint> t(N);
      rep(i, n) {
        int ci = c(a[i]);
        p[i] = t.Aggregate(0, ci);
        t.Set(ci, t.Get(ci) + mint(2).Pow(i));
      }
    }
    {
      AddSegmentTree<mint> t(N);
      rrep(i, n) {
        int ci = c(a[i]);
        p[i] *= t.Aggregate(0, ci);
        t.Set(ci, t.Get(ci) + mint(2).Pow(n - 1 - i));
      }
    }
    ans += accumulate(p);
  }
  {
    V<mint> p(n);
    {
      AddSegmentTree<mint> t(N);
      rep(i, n) {
        int ci = c(a[i]);
        p[i] = t.Aggregate(ci + 1, N);
        t.Set(ci, t.Get(ci) + mint(2).Pow(i));
      }
    }
    {
      AddSegmentTree<mint> t(N);
      rrep(i, n) {
        int ci = c(a[i]);
        p[i] *= t.Aggregate(ci + 1, N);
        t.Set(ci, t.Get(ci) + mint(2).Pow(n - 1 - i));
      }
    }
    ans += accumulate(p);
  }
  wt(ans);
}

yukicoder

結果

テストケース

ソースコード