#735390 (C++17) No.1826 Fruits Collecting

提出ソース

結果

問題	No.1826 Fruits Collecting
ユーザー	stoq
提出日時	2022-01-28 23:53:49
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	261 ms / 2,000 ms
コード長	5,763 bytes
コンパイル時間	5,308 ms
コンパイル使用メモリ	284,736 KB
実行使用メモリ	20,736 KB
最終ジャッジ日時	2024-06-09 17:26:38
合計ジャッジ時間	11,062 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	4 ms 5,248 KB
testcase_02	AC	4 ms 5,248 KB
testcase_03	AC	5 ms 5,248 KB
testcase_04	AC	4 ms 5,376 KB
testcase_05	AC	123 ms 10,752 KB
testcase_06	AC	219 ms 16,072 KB
testcase_07	AC	179 ms 11,648 KB
testcase_08	AC	13 ms 5,376 KB
testcase_09	AC	188 ms 13,952 KB
testcase_10	AC	100 ms 11,264 KB
testcase_11	AC	99 ms 11,136 KB
testcase_12	AC	38 ms 6,784 KB
testcase_13	AC	20 ms 5,376 KB
testcase_14	AC	28 ms 5,760 KB
testcase_15	AC	259 ms 20,608 KB
testcase_16	AC	247 ms 20,608 KB
testcase_17	AC	255 ms 20,608 KB
testcase_18	AC	258 ms 20,736 KB
testcase_19	AC	256 ms 20,608 KB
testcase_20	AC	251 ms 20,608 KB
testcase_21	AC	261 ms 20,736 KB
testcase_22	AC	247 ms 20,688 KB
testcase_23	AC	247 ms 20,564 KB
testcase_24	AC	250 ms 20,564 KB
testcase_25	AC	2 ms 5,376 KB
testcase_26	AC	1 ms 5,376 KB
testcase_27	AC	2 ms 5,376 KB
testcase_28	AC	1 ms 5,376 KB
testcase_29	AC	1 ms 5,376 KB
testcase_30	AC	50 ms 7,424 KB
testcase_31	AC	96 ms 11,136 KB
testcase_32	AC	45 ms 7,168 KB
testcase_33	AC	167 ms 16,448 KB
testcase_34	AC	135 ms 13,056 KB
testcase_35	AC	30 ms 5,760 KB
testcase_36	AC	159 ms 16,304 KB
testcase_37	AC	89 ms 12,544 KB
testcase_38	AC	63 ms 10,496 KB
testcase_39	AC	100 ms 10,624 KB
testcase_40	AC	132 ms 11,904 KB
testcase_41	AC	25 ms 5,376 KB
testcase_42	AC	4 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

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

ソースコード

raw source code

#define MOD_TYPE 2

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
//#include <atcoder/modint>
//#include <atcoder/lazysegtree>
//#include <atcoder/segtree>

using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#pragma region Macros

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif

using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())

struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
  for (int i = 0; i < v.size(); i++) v[i]--;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

// BiCoef bc(500010);

#pragma endregion

// -------------------------------

using S = ll;
S op(S a, S b) { return max(a, b); }
S e() { return -LINF; }

void solve() {
  int n;
  cin >> n;
  vector<array<int, 3>> v(n);
  rep(i, n) rep(j, 3) cin >> v[i][j];

  rep(i, n) {
    int x = v[i][0] + v[i][1];
    int y = v[i][0] - v[i][1];
    v[i][0] = x;
    v[i][1] = y;
  }
  sort(all(v));
  map<int, int> mp;
  mp[0] = 0;
  rep(i, n) mp[v[i][1]] = 0;
  int z = 0;
  for (auto &&[k, v] : mp) v = z++;
  rep(i, n) v[i][1] = mp[v[i][1]];
  vector<S> tmp(z, -LINF);
  tmp[mp[0]] = 0;
  segtree<S, op, e> seg(tmp);
  rep(i, n) {
    if (v[i][0] < 0) continue;
    ll t = seg.prod(0, v[i][1] + 1) + v[i][2];
    seg.set(v[i][1], t);
  }
  cout << seg.all_prod() << "\n";
}

int main() { solve(); }

yukicoder

結果

テストケース

ソースコード