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

提出ソース

結果

問題	No.1826 Fruits Collecting
ユーザー	haruki_K
提出日時	2022-01-28 22:23:52
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	121 ms / 2,000 ms
コード長	10,576 bytes
コンパイル時間	2,552 ms
コンパイル使用メモリ	220,588 KB
実行使用メモリ	12,456 KB
最終ジャッジ日時	2023-08-28 20:29:31
合計ジャッジ時間	7,541 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	2 ms 4,376 KB
testcase_02	AC	3 ms 4,376 KB
testcase_03	AC	3 ms 4,376 KB
testcase_04	AC	2 ms 4,380 KB
testcase_05	AC	49 ms 5,464 KB
testcase_06	AC	79 ms 7,204 KB
testcase_07	AC	55 ms 5,648 KB
testcase_08	AC	7 ms 4,380 KB
testcase_09	AC	76 ms 6,736 KB
testcase_10	AC	53 ms 5,648 KB
testcase_11	AC	51 ms 5,656 KB
testcase_12	AC	21 ms 4,380 KB
testcase_13	AC	12 ms 4,384 KB
testcase_14	AC	17 ms 4,380 KB
testcase_15	AC	118 ms 8,796 KB
testcase_16	AC	118 ms 9,092 KB
testcase_17	AC	118 ms 8,784 KB
testcase_18	AC	119 ms 8,908 KB
testcase_19	AC	121 ms 9,012 KB
testcase_20	AC	118 ms 9,448 KB
testcase_21	AC	118 ms 8,816 KB
testcase_22	AC	118 ms 8,848 KB
testcase_23	AC	118 ms 9,128 KB
testcase_24	AC	119 ms 8,780 KB
testcase_25	AC	2 ms 4,376 KB
testcase_26	AC	1 ms 4,380 KB
testcase_27	AC	1 ms 4,380 KB
testcase_28	AC	2 ms 4,376 KB
testcase_29	AC	1 ms 4,376 KB
testcase_30	AC	23 ms 4,380 KB
testcase_31	AC	43 ms 4,476 KB
testcase_32	AC	35 ms 5,648 KB
testcase_33	AC	115 ms 11,828 KB
testcase_34	AC	96 ms 9,584 KB
testcase_35	AC	23 ms 4,728 KB
testcase_36	AC	112 ms 12,456 KB
testcase_37	AC	66 ms 9,084 KB
testcase_38	AC	47 ms 8,736 KB
testcase_39	AC	90 ms 10,108 KB
testcase_40	AC	115 ms 11,848 KB
testcase_41	AC	26 ms 4,684 KB
testcase_42	AC	5 ms 4,380 KB
testcase_43	AC	2 ms 4,380 KB
testcase_44	AC	2 ms 4,376 KB
testcase_45	AC	2 ms 4,380 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr ll div_ceil(ll x, ll y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
bool next_product(vector<int> &v, int m) {
    repR (i, v.size()) if (++v[i] < m) return true; else v[i] = 0;
    return false;
}
bool next_product(vector<int> &v, vector<int> const& s) {
    repR (i, v.size()) if (++v[i] < s[i]) return true; else v[i] = 0;
    return false;
}
template <class vec> int sort_unique(vec &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
    return v.size();
}
template <class V> auto prefix_sum(V const& a) {
    vector<typename V::value_type> s;
    s.reserve(a.size() + 1);
    s.push_back(0);
    for (auto const& x : a) s.emplace_back(s.back() + x);
    return s;
}
template <class V> auto suffix_sum(V const& a) {
    vector<typename V::value_type> s(a.size() + 1);
    int pos = a.size();
    for (auto it = a.rbegin(); it != a.rend(); ++it, --pos) {
        s[pos-1] = *it + s[pos];
    }
    return s;
}
// <<<
// >>> coordinate compression

template <class T> struct Compress {
    vector<T> v;
    bool ok = 0;
    template <class... Ts> Compress(Ts const&... xs) { add(xs...); init(); }
    void add(T const& x) { ok = 0; v.push_back(x); }
    template <class V> void add(V const& u) { ok = false; copy(all(u), back_inserter(v)); }
    template <class... Ts> void add(Ts const&... xs) { (add(xs), ...); }
    void init() { sort(all(v)); v.erase(unique(all(v)), v.end()); ok = true; }
    int size() const { return v.size(); }
    T operator[](int i) const { assert(ok); return v[i]; }
    int find(T const& x) const { assert(ok); auto it = lower_bound(all(v), x); assert(*it == x); return it-v.begin(); }
    void set(T& x) const { x = find(x); }
    template <class V> void set(V& u) const { for (auto &x : u) x = find(x); }
    template <class... Ts> void set(Ts&... xs) const { (set(xs), ...); }
};

// <<<
// >>> segment tree

template <class Handler> struct Segtree : Handler {
    using Value = typename Handler::Value;
    using Handler::unit_value;  // () -> Value
    using Handler::merge; // (Value, Value) -> Value

    vector<Value> v;
    int n;

    Segtree() {}
    template <class... T> Segtree(T&&... x) { init(forward<T>(x)...); }

    template <class F, class = decltype(declval<F>()(0))>
    void init(int n, F gen)  {
        assert(n >= 0);
        this->n = n;
        v.resize(2*n, unit_value());
        for (int i = 0; i < n; i++) v[n+i] = gen(i);
        for (int i = n-1; i >= 1; i--) v[i] = merge(v[i<<1], v[i<<1|1]);
    }
    void init(int n) { init(n, [&](int) { return unit_value(); }); }
    void init(int n, Value const& x) { init(n, [&](int) { return x; }); }
    void init(vector<Value> const& v) { init(v.size(), [&](int i) { return v[i]; }); }
    int size() const { return n; }

    void set(int i, Value const& x) {
        assert(0 <= i); assert(i < size());
        i += n; v[i] = x;
        while (i >>= 1) v[i] = merge(v[i<<1], v[i<<1|1]);
    }
    Value operator[](int i) const { return get(i); }
    Value get(int i) const {
        assert(0 <= i); assert(i < size());
        return v[n + i];
    }
    // [l, r)
    Value get(int l, int r) const {
        assert(0 <= l); assert(l <= r); assert(r <= size());
        Value x = unit_value(), y = unit_value();
        for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if (l&1) x = merge(x, v[l++]);
            if (r&1) y = merge(v[--r], y);
        }
        return merge(x, y);
    }
    Value get_all() const { return get(0, size()); }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l); assert(l <= size());
        assert(f(unit_value()));
        l += n;
        const int r = size() << 1;
        Value x = unit_value();
        while (true) {
            if (l == r) return size();
            int k = __builtin_ctz(l | 1 << __lg(r - l));
            auto y = merge(x, v[l >> k]);
            if (not f(y)) { l >>= k; break; }
            x = y, l += 1 << k;
        }
        while (l < size()) {
            auto y = merge(x, v[l <<= 1]);
            if (f(y)) x = y, l++;
        }
        return l - size();
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r); assert(r <= size());
        assert(f(unit_value()));
        r += n;
        const int l = size();
        Value x = unit_value();
        while (true) {
            if (l == r) return 0;
            int k = __builtin_ctz(r | 1 << __lg(r - l));
            auto y = merge(v[(r >> k) - 1], x);
            if (not f(y)) { r >>= k; --r; break; }
            x = y, r -= 1 << k;
        }
        while (r < size()) {
            r = r << 1 | 1;
            auto y = merge(v[r], x);
            if (f(y)) x = y, r--;
        }
        return r + 1 - size();
    }
    vector<Value> dat() const {
        vector<Value> ret(size());
        for (int i = 0; i < size(); i++) ret[i] = get(i);
        return ret;
    }
};

// <<<

struct Max {
    using Value = int;
    constexpr static Value unit_value() { return -INF; }
    constexpr static Value merge(Value const& x, Value const& y) {
        return max(x, y);
    }
};

int32_t main() {
    int n; cin >> n;
    vector<tuple<int, int, int>> xyv;
    rep (i, n) {
        int t, x, v; cin >> t >> x >> v;
        int X = t+x, Y = t-x;
        if (X >= 0 and Y >= 0) {
            xyv.eb(X, Y, v);
        }
    }
    xyv.eb(0, 0, 0);
    sort(all(xyv));

    Compress<int> Z;
    for (auto [x, y, v] : xyv) Z.add(y);
    Z.init();
    for (auto &[x, y, v] : xyv) Z.set(y);
    dump(Z.v);
    dump(xyv);

    Segtree<Max> seg(Z.size());
    seg.set(0, 0);
    for (auto [x, y, v] : xyv) {
        int val = seg.get(0, y+1) + v;
        seg.set(y, max(seg[y], val));
    }

    cout << seg.get_all() << '\n';
}

yukicoder

結果

テストケース

ソースコード