結果
問題 | No.1826 Fruits Collecting |
ユーザー | tokusakurai |
提出日時 | 2022-01-28 22:22:47 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 186 ms / 2,000 ms |
コード長 | 6,519 bytes |
コンパイル時間 | 3,132 ms |
コンパイル使用メモリ | 213,072 KB |
実行使用メモリ | 22,044 KB |
最終ジャッジ日時 | 2023-08-28 20:28:01 |
合計ジャッジ時間 | 9,405 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 3 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 70 ms
9,872 KB |
testcase_06 | AC | 119 ms
14,880 KB |
testcase_07 | AC | 83 ms
10,628 KB |
testcase_08 | AC | 9 ms
4,376 KB |
testcase_09 | AC | 123 ms
13,024 KB |
testcase_10 | AC | 79 ms
10,344 KB |
testcase_11 | AC | 76 ms
10,128 KB |
testcase_12 | AC | 30 ms
6,028 KB |
testcase_13 | AC | 15 ms
4,684 KB |
testcase_14 | AC | 23 ms
5,208 KB |
testcase_15 | AC | 182 ms
19,480 KB |
testcase_16 | AC | 181 ms
19,564 KB |
testcase_17 | AC | 183 ms
19,884 KB |
testcase_18 | AC | 186 ms
21,016 KB |
testcase_19 | AC | 184 ms
19,820 KB |
testcase_20 | AC | 185 ms
20,128 KB |
testcase_21 | AC | 183 ms
22,044 KB |
testcase_22 | AC | 183 ms
20,876 KB |
testcase_23 | AC | 182 ms
21,008 KB |
testcase_24 | AC | 180 ms
20,140 KB |
testcase_25 | AC | 1 ms
4,376 KB |
testcase_26 | AC | 2 ms
4,380 KB |
testcase_27 | AC | 2 ms
4,380 KB |
testcase_28 | AC | 2 ms
4,376 KB |
testcase_29 | AC | 1 ms
4,376 KB |
testcase_30 | AC | 37 ms
6,692 KB |
testcase_31 | AC | 76 ms
10,304 KB |
testcase_32 | AC | 36 ms
6,640 KB |
testcase_33 | AC | 122 ms
14,936 KB |
testcase_34 | AC | 103 ms
11,888 KB |
testcase_35 | AC | 24 ms
5,140 KB |
testcase_36 | AC | 121 ms
15,020 KB |
testcase_37 | AC | 84 ms
11,448 KB |
testcase_38 | AC | 58 ms
9,700 KB |
testcase_39 | AC | 115 ms
14,940 KB |
testcase_40 | AC | 148 ms
17,080 KB |
testcase_41 | AC | 32 ms
6,276 KB |
testcase_42 | AC | 6 ms
4,376 KB |
testcase_43 | AC | 2 ms
4,384 KB |
testcase_44 | AC | 1 ms
4,376 KB |
testcase_45 | AC | 2 ms
4,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep2(i, x, n) for (int i = x; i <= n; i++) #define rep3(i, x, n) for (int i = x; i >= n; i--) #define each(e, v) for (auto &e : v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; const int inf = (1 << 30) - 1; const ll INF = (1LL << 60) - 1; const int MOD = 1000000007; // const int MOD = 998244353; template <typename Monoid> struct Segment_Tree { using F = function<Monoid(Monoid, Monoid)>; int n; vector<Monoid> seg; const F f; const Monoid e1; // f(f(a,b),c) = f(a,f(b,c)), f(e1,a) = f(a,e1) = a Segment_Tree(const vector<Monoid> &v, const F &f, const Monoid &e1) : f(f), e1(e1) { int m = v.size(); n = 1; while (n < m) n <<= 1; seg.assign(2 * n, e1); copy(begin(v), end(v), seg.begin() + n); for (int i = n - 1; i > 0; i--) seg[i] = f(seg[2 * i], seg[2 * i + 1]); } Segment_Tree(int m, const Monoid &x, const F &f, const Monoid &e1) : f(f), e1(e1) { n = 1; while (n < m) n <<= 1; seg.assign(2 * n, e1); vector<Monoid> v(m, x); copy(begin(v), end(v), begin(seg) + n); for (int i = n - 1; i > 0; i--) seg[i] = f(seg[2 * i], seg[2 * i + 1]); } void change(int i, const Monoid &x, bool update = true) { if (update) { seg[i + n] = x; } else { seg[i + n] = f(seg[i + n], x); } i += n; while (i >>= 1) { seg[i] = f(seg[2 * i], seg[2 * i + 1]); } } Monoid query(int l, int r) const { Monoid L = e1, R = e1; l += n, r += n; while (l < r) { if (l & 1) L = f(L, seg[l++]); if (r & 1) R = f(seg[--r], R); l >>= 1, r >>= 1; } return f(L, R); } Monoid operator[](int i) const { return seg[n + i]; } template <typename C> int find_subtree(int i, const C &check, const Monoid &x, Monoid &M, int type) const { while (i < n) { Monoid nxt = type ? f(seg[2 * i + type], M) : f(M, seg[2 * i + type]); if (check(nxt, x)) { i = 2 * i + type; } else { M = nxt; i = 2 * i + (type ^ 1); } } return i - n; } template <typename C> int find_first(int l, const C &check, const Monoid &x) const { // check((区間 [l,r] での演算結果), x) を満たす最小の r Monoid L = e1; int a = l + n, b = n + n; while (a < b) { if (a & 1) { Monoid nxt = f(L, seg[a]); if (check(nxt, x)) return find_subtree(a, check, x, L, 0); L = nxt, a++; } a >>= 1, b >>= 1; } return n; } template <typename C> int find_last(int r, const C &check, const Monoid &x) const { // check((区間 [l,r) での演算結果), x) を満たす最大の l Monoid R = e1; int a = n, b = r + n; while (a < b) { if ((b & 1) || a == 1) { Monoid nxt = f(seg[--b], R); if (check(nxt, x)) return find_subtree(b, check, x, R, 1); R = nxt; } a >>= 1, b >>= 1; } return -1; } }; int main() { int N; cin >> N; vector<ll> T(N), X(N), V(N); rep(i, N) cin >> T[i] >> X[i] >> V[i]; T.eb(0), X.eb(0), V.eb(0); vector<ll> A(N + 1), B(N + 1); rep(i, N + 1) A[i] = T[i] - X[i], B[i] = T[i] + X[i]; vector<int> u(N + 1); iota(all(u), 0); sort(all(u), [&](int i, int j) { if (A[i] != A[j]) return A[i] < A[j]; return B[i] < B[j]; }); vector<int> v(N + 1); iota(all(v), 0); sort(all(v), [&](int i, int j) { if (B[i] != B[j]) return B[i] < B[j]; return A[i] < A[j]; }); vector<int> id(N + 1); rep(i, N + 1) id[v[i]] = i; auto f = [](ll a, ll b) { return max(a, b); }; Segment_Tree<ll> seg(N + 1, -INF, f, -INF); each(e, u) { ll x = seg.query(0, id[e]); if (e == N) chmax(x, 0LL); seg.change(id[e], x + V[e]); } cout << seg.query(0, N + 1) << '\n'; }