結果

問題 No.1826 Fruits Collecting
ユーザー maspymaspy
提出日時 2022-06-08 23:29:44
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 225 ms / 2,000 ms
コード長 18,140 bytes
コンパイル時間 2,822 ms
コンパイル使用メモリ 221,236 KB
実行使用メモリ 61,936 KB
最終ジャッジ日時 2024-09-21 05:16:42
合計ジャッジ時間 10,989 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 3 ms
6,944 KB
testcase_02 AC 3 ms
6,944 KB
testcase_03 AC 3 ms
6,944 KB
testcase_04 AC 3 ms
6,944 KB
testcase_05 AC 81 ms
28,916 KB
testcase_06 AC 146 ms
43,504 KB
testcase_07 AC 91 ms
32,712 KB
testcase_08 AC 10 ms
8,072 KB
testcase_09 AC 131 ms
42,864 KB
testcase_10 AC 92 ms
31,256 KB
testcase_11 AC 90 ms
30,280 KB
testcase_12 AC 34 ms
15,188 KB
testcase_13 AC 17 ms
9,704 KB
testcase_14 AC 27 ms
12,800 KB
testcase_15 AC 217 ms
61,808 KB
testcase_16 AC 225 ms
61,800 KB
testcase_17 AC 219 ms
61,676 KB
testcase_18 AC 220 ms
61,836 KB
testcase_19 AC 220 ms
61,804 KB
testcase_20 AC 218 ms
61,936 KB
testcase_21 AC 221 ms
61,936 KB
testcase_22 AC 224 ms
61,676 KB
testcase_23 AC 217 ms
61,936 KB
testcase_24 AC 220 ms
61,808 KB
testcase_25 AC 2 ms
5,376 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 2 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 1 ms
5,376 KB
testcase_30 AC 25 ms
10,296 KB
testcase_31 AC 49 ms
16,364 KB
testcase_32 AC 52 ms
20,296 KB
testcase_33 AC 184 ms
52,632 KB
testcase_34 AC 155 ms
46,064 KB
testcase_35 AC 35 ms
14,996 KB
testcase_36 AC 178 ms
52,064 KB
testcase_37 AC 104 ms
42,404 KB
testcase_38 AC 73 ms
31,936 KB
testcase_39 AC 97 ms
30,004 KB
testcase_40 AC 122 ms
36,908 KB
testcase_41 AC 28 ms
11,580 KB
testcase_42 AC 6 ms
5,376 KB
testcase_43 AC 2 ms
5,376 KB
testcase_44 AC 2 ms
5,376 KB
testcase_45 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "/home/maspy/compro/library/my_template.hpp"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;

template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))

// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) \
  overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)

#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second

#define stoi stoll

template <typename T>
T SUM(vector<T> &A) {
  T sum = T(0);
  for (auto &&a: A) sum += a;
  return sum;
}

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T, typename U>
T ceil(T x, U y) {
  return (x > 0 ? (x + y - 1) / y : x / y);
}

template <typename T, typename U>
T floor(T x, U y) {
  return (x > 0 ? x / y : (x - y + 1) / y);
}

template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
  T q = floor(x, y);
  return {q, x - q * y};
}

ll binary_search(function<bool(ll)> check, ll ok, ll ng) {
  assert(check(ok));
  while (abs(ok - ng) > 1) {
    auto x = (ng + ok) / 2;
    if (check(x))
      ok = x;
    else
      ng = x;
  }
  return ok;
}

template <class T, class S>
inline bool chmax(T &a, const S &b) {
  return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
  return (a > b ? a = b, 1 : 0);
}

vi s_to_vi(const string &S, char first_char) {
  vi A(S.size());
  FOR(i, S.size()) { A[i] = S[i] - first_char; }
  return A;
}

template <typename T>
vector<T> cumsum(vector<T> &A, int off = 1) {
  int N = A.size();
  vector<T> B(N + 1);
  FOR(i, N) { B[i + 1] = B[i] + A[i]; }
  if (off == 0) B.erase(B.begin());
  return B;
}

template <typename CNT, typename T>
vc<CNT> bincount(const vc<T> &A, int size) {
  vc<CNT> C(size);
  for (auto &&x: A) { ++C[x]; }
  return C;
}

template <typename T>
vector<int> argsort(const vector<T> &A) {
  // stable
  vector<int> ids(A.size());
  iota(all(ids), 0);
  sort(all(ids),
       [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });
  return ids;
}

// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
  int n = len(A);
  assert(len(I) == n);
  vc<T> B(n);
  FOR(i, n) B[i] = A[I[i]];
  return B;
}
#line 1 "/home/maspy/compro/library/other/io.hpp"
// based on yosupo's fastio
#include <unistd.h>

namespace detail {
template <typename T, decltype(&T::is_modint) = &T::is_modint>
std::true_type check_value(int);
template <typename T>
std::false_type check_value(long);
} // namespace detail

template <typename T>
struct is_modint : decltype(detail::check_value<T>(0)) {};
template <typename T>
using is_modint_t = enable_if_t<is_modint<T>::value>;
template <typename T>
using is_not_modint_t = enable_if_t<!is_modint<T>::value>;

struct Scanner {
  FILE *fp;
  char line[(1 << 15) + 1];
  size_t st = 0, ed = 0;
  void reread() {
    memmove(line, line + st, ed - st);
    ed -= st;
    st = 0;
    ed += fread(line + ed, 1, (1 << 15) - ed, fp);
    line[ed] = '\0';
  }
  bool succ() {
    while (true) {
      if (st == ed) {
        reread();
        if (st == ed) return false;
      }
      while (st != ed && isspace(line[st])) st++;
      if (st != ed) break;
    }
    if (ed - st <= 50) {
      bool sep = false;
      for (size_t i = st; i < ed; i++) {
        if (isspace(line[i])) {
          sep = true;
          break;
        }
      }
      if (!sep) reread();
    }
    return true;
  }
  template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
  bool read_single(T &ref) {
    if (!succ()) return false;
    while (true) {
      size_t sz = 0;
      while (st + sz < ed && !isspace(line[st + sz])) sz++;
      ref.append(line + st, sz);
      st += sz;
      if (!sz || st != ed) break;
      reread();
    }
    return true;
  }
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
  bool read_single(T &ref) {
    if (!succ()) return false;
    bool neg = false;
    if (line[st] == '-') {
      neg = true;
      st++;
    }
    ref = T(0);
    while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }
    if (neg) ref = -ref;
    return true;
  }
  template <class T, is_modint_t<T> * = nullptr>
  bool read_single(T &ref) {
    long long val = 0;
    bool f = read_single(val);
    ref = T(val);
    return f;
  }
  bool read_single(double &ref) {
    string s;
    if (!read_single(s)) return false;
    ref = std::stod(s);
    return true;
  }
  bool read_single(char &ref) {
    string s;
    if (!read_single(s) || s.size() != 1) return false;
    ref = s[0];
    return true;
  }
  template <class T>
  bool read_single(vector<T> &ref) {
    for (auto &d: ref) {
      if (!read_single(d)) return false;
    }
    return true;
  }
  template <class T, class U>
  bool read_single(pair<T, U> &p) {
    return (read_single(p.first) && read_single(p.second));
  }
  template <class A, class B, class C>
  bool read_single(tuple<A, B, C> &p) {
    return (read_single(get<0>(p)) && read_single(get<1>(p))
            && read_single(get<2>(p)));
  }
  template <class A, class B, class C, class D>
  bool read_single(tuple<A, B, C, D> &p) {
    return (read_single(get<0>(p)) && read_single(get<1>(p))
            && read_single(get<2>(p)) && read_single(get<3>(p)));
  }
  void read() {}
  template <class H, class... T>
  void read(H &h, T &... t) {
    bool f = read_single(h);
    assert(f);
    read(t...);
  }
  Scanner(FILE *fp) : fp(fp) {}
};

struct Printer {
  Printer(FILE *_fp) : fp(_fp) {}
  ~Printer() { flush(); }

  static constexpr size_t SIZE = 1 << 15;
  FILE *fp;
  char line[SIZE], small[50];
  size_t pos = 0;
  void flush() {
    fwrite(line, 1, pos, fp);
    pos = 0;
  }
  void write(const char &val) {
    if (pos == SIZE) flush();
    line[pos++] = val;
  }
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
  void write(T val) {
    if (pos > (1 << 15) - 50) flush();
    if (val == 0) {
      write('0');
      return;
    }
    if (val < 0) {
      write('-');
      val = -val; // todo min
    }
    size_t len = 0;
    while (val) {
      small[len++] = char(0x30 | (val % 10));
      val /= 10;
    }
    for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }
    pos += len;
  }
  void write(const string &s) {
    for (char c: s) write(c);
  }
  void write(const char *s) {
    size_t len = strlen(s);
    for (size_t i = 0; i < len; i++) write(s[i]);
  }
  void write(const double &x) {
    ostringstream oss;
    oss << setprecision(15) << x;
    string s = oss.str();
    write(s);
  }
  void write(const long double &x) {
    ostringstream oss;
    oss << setprecision(15) << x;
    string s = oss.str();
    write(s);
  }
  template <class T, is_modint_t<T> * = nullptr>
  void write(T &ref) {
    write(ref.val);
  }
  template <class T>
  void write(const vector<T> &val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
      if (i) write(' ');
      write(val[i]);
    }
  }
  template <class T, class U>
  void write(const pair<T, U> &val) {
    write(val.first);
    write(' ');
    write(val.second);
  }
  template <class A, class B, class C>
  void write(const tuple<A, B, C> &val) {
    auto &[a, b, c] = val;
    write(a), write(' '), write(b), write(' '), write(c);
  }
  template <class A, class B, class C, class D>
  void write(const tuple<A, B, C, D> &val) {
    auto &[a, b, c, d] = val;
    write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);
  }
  template <class A, class B, class C, class D, class E>
  void write(const tuple<A, B, C, D, E> &val) {
    auto &[a, b, c, d, e] = val;
    write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);
  }
  template <class A, class B, class C, class D, class E, class F>
  void write(const tuple<A, B, C, D, E, F> &val) {
    auto &[a, b, c, d, e, f] = val;
    write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);
  }
  template <class T, size_t S>
  void write(const array<T, S> &val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
      if (i) write(' ');
      write(val[i]);
    }
  }
  void write(i128 val) {
    string s;
    bool negative = 0;
    if(val < 0){
      negative = 1;
      val = -val;
    }
    while (val) {
      s += '0' + int(val % 10);
      val /= 10;
    }
    if(negative) s += "-";
    reverse(all(s));
    if (len(s) == 0) s = "0";
    write(s);
  }
};

Scanner scanner = Scanner(stdin);
Printer printer = Printer(stdout);

void flush() { printer.flush(); }
void print() { printer.write('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
  printer.write(head);
  if (sizeof...(Tail)) printer.write(' ');
  print(forward<Tail>(tail)...);
}

void read() {}
template <class Head, class... Tail>
void read(Head &head, Tail &... tail) {
  scanner.read(head);
  read(tail...);
}

#define INT(...)   \
  int __VA_ARGS__; \
  read(__VA_ARGS__)
#define LL(...)   \
  ll __VA_ARGS__; \
  read(__VA_ARGS__)
#define STR(...)      \
  string __VA_ARGS__; \
  read(__VA_ARGS__)
#define CHAR(...)      \
  char __VA_ARGS__; \
  read(__VA_ARGS__)
#define DBL(...)      \
  double __VA_ARGS__; \
  read(__VA_ARGS__)

#define VEC(type, name, size) \
  vector<type> name(size);    \
  read(name)
#define VV(type, name, h, w)                     \
  vector<vector<type>> name(h, vector<type>(w)); \
  read(name)

void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 2 "/home/maspy/compro/library/ds/dynamic_segtree.hpp"

/*
コンストラクタに渡すもの
・L, R：最大の範囲（root node の表す範囲）
・function<X(ll,ll)> defulat_fn(l,r)：初期値での [l,r) 積の計算
*/
template <class Monoid, int NODES = 5'000'000>
struct Dynamic_SegTree {
  using X = typename Monoid::value_type;

  struct Node {
    X x;
    Node *l, *r;
    Node() {}
    Node(const X &x) : x(x), l(nullptr), r(nullptr) {}
  };

  Node *pool;
  int pid;
  ll L, R;
  Node *root;
  function<X(ll, ll)> default_fn;

  Dynamic_SegTree(ll L, ll R)
      : Dynamic_SegTree(L, R, [](ll L, ll R){return Monoid::unit();}) {}

  Dynamic_SegTree(ll L, ll R, function<X(ll, ll)> f)
      : pid(0), L(L), R(R), default_fn(f) {
    pool = new Node[NODES];
    root = new_node(L, R);
  }

  void reset() {
    pid = 0;
    root = new_node(L, R);
  }

  void set(ll i, const X &x) {
    assert(L <= i && i < R);
    set_rec(root, L, R, i, x);
  }

  void multiply(ll i, const X &x) {
    assert(L <= i && i < R);
    multiply_rec(root, L, R, i, x);
  }

  X prod(ll l, ll r) {
    assert(L <= l && l <= r && r <= R);
    return prod_rec(root, L, R, l, r);
  }

  X prod_all() { return root->x; }

  void debug() {
    auto dfs = [&](auto &dfs, Node *n, ll l, ll r) -> void {
      print("lr", l, r, "x", n->x, "a", n->a);
      ll m = (l + r) / 2;
      if (n->l) dfs(dfs, n->l, l, m);
      if (n->r) dfs(dfs, n->r, m, r);
    };
    dfs(dfs, root, L, R);
  }

  template <class F>
  ll max_right(const F &check, ll s) {
    assert(L <= s && s <= R && check(Monoid::unit()));
    X p = Monoid::unit();
    return max_right_rec(root, L, R, check, s, p);
  }

  template <class F>
  ll min_left(const F &check, ll t) {
    assert(L <= t && t <= R && check(Monoid::unit()));
    X p = Monoid::unit();
    return min_left_rec(root, L, R, check, t, p);
  }

private:
  Node *new_node(ll node_l, ll node_r) {
    pool[pid].x = default_fn(node_l, node_r);
    pool[pid].l = pool[pid].r = nullptr;
    return &(pool[pid++]);
  }

  void set_rec(Node *n, ll node_l, ll node_r, ll idx, const X &x) {
    if (node_r - node_l == 1) {
      n->x = x;
      return;
    }
    ll node_m = (node_l + node_r) / 2;

    if (idx < node_m) {
      if (!(n->l)) n->l = new_node(node_l, node_m);
      set_rec(n->l, node_l, node_m, idx, x);
    } else {
      if (!(n->r)) n->r = new_node(node_m, node_r);
      set_rec(n->r, node_m, node_r, idx, x);
    }
    X xl = (n->l ? (n->l)->x : Monoid::unit());
    X xr = (n->r ? (n->r)->x : Monoid::unit());
    n->x = Monoid::op(xl, xr);
  }

  void multiply_rec(Node *n, ll node_l, ll node_r, ll idx, const X &x) {
    if (node_r - node_l == 1) {
      n->x = Monoid::op(n->x, x);
      return;
    }
    ll node_m = (node_l + node_r) / 2;

    if (idx < node_m) {
      if (!(n->l)) n->l = new_node(node_l, node_m);
      multiply_rec(n->l, node_l, node_m, idx, x);
    } else {
      if (!(n->r)) n->r = new_node(node_m, node_r);
      multiply_rec(n->r, node_m, node_r, idx, x);
    }
    X xl = (n->l ? (n->l)->x : Monoid::unit());
    X xr = (n->r ? (n->r)->x : Monoid::unit());
    n->x = Monoid::op(xl, xr);
  }

  X prod_rec(Node *n, ll node_l, ll node_r, ll l, ll r) {
    chmax(l, node_l);
    chmin(r, node_r);
    if (l >= r) return Monoid::unit();
    if (l == node_l && r == node_r) return n->x;
    ll node_m = (node_l + node_r) / 2;
    X xl = (n->l ? prod_rec(n->l, node_l, node_m, l, r) : Monoid::unit());
    X xr = (n->r ? prod_rec(n->r, node_m, node_r, l, r) : Monoid::unit());
    return Monoid::op(xl, xr);
  }

  template <typename F>
  ll max_right_rec(Node *n, ll node_l, ll node_r, const F &check, ll s, X &p) {
    if (node_r <= s) return R;
    if (s <= node_l) {
      X x = Monoid::op(p, n->x);
      if (check(x)) {
        p = x;
        return R;
      }
    }
    if (node_r - node_l == 1) return node_l;
    ll node_m = (node_l + node_r) / 2;
    if (!(n->l)) n->l = new_node(node_l, node_m);
    ll res = max_right_rec(n->l, node_l, node_m, check, s, p);
    if (res != R) return res;
    if (!(n->r)) n->r = new_node(node_m, node_r);
    return max_right_rec(n->r, node_m, node_r, check, s, p);
  }

  template <typename F>
  ll min_left_rec(Node *n, ll node_l, ll node_r, const F &check, ll t, X &p) {
    if (t <= node_l) return L;
    if (node_r <= t) {
      X x = Monoid::op(n->x, p);
      if (check(x)) {
        p = x;
        return L;
      }
    }
    if (node_r - node_l == 1) return node_r;
    ll node_m = (node_l + node_r) / 2;
    if (!(n->r)) n->r = new_node(node_m, node_r);
    ll res = min_left_rec(n->r, node_m, node_r, check, t, p);
    if (res != L) return res;
    if (!(n->l)) n->l = new_node(node_l, node_m);
    return min_left_rec(n->l, node_l, node_m, check, t, p);
  }
};
#line 2 "/home/maspy/compro/library/alg/monoid_max.hpp"
template <class X>
struct Monoid_Max {
  using value_type = X;
  static constexpr X op(const X &x, const X &y) noexcept { return max(x, y); }
  static constexpr X unit() { return numeric_limits<X>::lowest(); }
  static constexpr bool commute = true;
};
#line 5 "main.cpp"

void solve() {
  LL(N);
  vi X, Y, V;
  FOR(N) {
    LL(t, x, v);
    X.eb(t - x), Y.eb(t + x), V.eb(v);
  }

  auto I = argsort(X);
  X = rearrange(X, I), Y = rearrange(Y, I), V = rearrange(V, I);

  ll LIM = 1LL << 32;
  Dynamic_SegTree<Monoid_Max<ll>> seg(-LIM, LIM);
  seg.set(0, 0);

  FOR(i, N) {
    ll x = X[i], y = Y[i], v = V[i];
    if (x < 0) continue;
    ll t = seg.prod(-LIM, y + 1) + v;
    seg.multiply(y, t);
  }
  print(seg.prod_all());
}

signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);

  ll T = 1;
  // LL(T);
  FOR(T) solve();

  return 0;
}
0