結果

問題 No.1826 Fruits Collecting
ユーザー oteraotera
提出日時 2022-01-29 00:43:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,610 bytes
コンパイル時間 2,481 ms
コンパイル使用メモリ 225,352 KB
実行使用メモリ 29,248 KB
最終ジャッジ日時 2024-06-09 18:18:27
合計ジャッジ時間 9,670 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 4 ms
5,376 KB
testcase_02 AC 4 ms
5,376 KB
testcase_03 AC 6 ms
5,376 KB
testcase_04 AC 4 ms
5,376 KB
testcase_05 AC 117 ms
14,160 KB
testcase_06 AC 175 ms
21,808 KB
testcase_07 AC 116 ms
15,596 KB
testcase_08 AC 12 ms
5,376 KB
testcase_09 AC 162 ms
19,504 KB
testcase_10 AC 104 ms
15,128 KB
testcase_11 AC 104 ms
14,804 KB
testcase_12 AC 38 ms
8,228 KB
testcase_13 AC 18 ms
5,632 KB
testcase_14 AC 30 ms
6,784 KB
testcase_15 AC 281 ms
29,116 KB
testcase_16 AC 290 ms
29,248 KB
testcase_17 AC 271 ms
29,112 KB
testcase_18 AC 269 ms
29,168 KB
testcase_19 AC 272 ms
29,248 KB
testcase_20 AC 276 ms
29,200 KB
testcase_21 AC 273 ms
29,192 KB
testcase_22 AC 269 ms
29,172 KB
testcase_23 AC 269 ms
29,112 KB
testcase_24 AC 274 ms
29,104 KB
testcase_25 AC 2 ms
5,376 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 1 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 1 ms
5,376 KB
testcase_30 AC 48 ms
9,228 KB
testcase_31 AC 94 ms
14,840 KB
testcase_32 AC 52 ms
9,048 KB
testcase_33 AC 194 ms
22,368 KB
testcase_34 AC 160 ms
17,932 KB
testcase_35 AC 32 ms
6,912 KB
testcase_36 AC 186 ms
22,064 KB
testcase_37 AC 128 ms
17,252 KB
testcase_38 AC 88 ms
13,680 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 2 ms
5,376 KB
testcase_44 AC 1 ms
5,376 KB
testcase_45 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/**
 *    author:  otera
 *    created: 29.01.2022 00:02:30 
**/
#include<bits/stdc++.h>
#include<atcoder/segtree>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
#define repa(i, n) for(int i = 0; i < n; ++ i)
#define repb(i, a, b) for(int i = a; i < b; ++ i)
#define repc(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)
#define rep1a(i, n) for(int i = 0; i <= n; ++ i)
#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)
#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)
#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>=1;i--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define pb push_back
#define eb emplace_back
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#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 Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define si(c) (int)(c).size()
inline ll popcnt(ull a){ return __builtin_popcountll(a); }
#define tpow(n) (1LL<<(n))
#define unless(A) if(!(A))
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
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 pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> void scan(T& a){ cin >> a; }
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ cout << ' '; }
template<class T> void print(const T& a){ cout << a; }
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }
int out(){ cout << '\n'; return 0; }
template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...)
#define dump(...)
#endif

#define int long long

const ll INF = 1LL<<60;

ll op(ll a, ll b) {
    return max(a, b);
}

ll e() {
    return -INF;
}

void solve() {
    INT(n);
    vc<ll> t(n), x(n), v(n);
    map<LP, ll> mp;
    vc<ll> as;
    rep(i, n) {
        in(t[i], x[i], v[i]);
        if(mp.count(LP{t[i], x[i]})) {
            int id = mp[LP{t[i], v[i]}];
            v[id] += v[i];
            t[i] = x[i] = v[i] = 0;
        } else {
            mp[LP{t[i], x[i]}] = i;
        }
        as.eb(x[i] - t[i]);
    }
    as.eb(0);
    Uniq(as);
    int sz = si(as);
    vc<ll> vs(sz, -INF);
    int pos0 = lb(as, 0);
    vs[pos0] = 0;
    atcoder::segtree<ll, op, e> seg(vs);
    vc<int> ids(n);
    iota(all(ids), 0);
    sort(all(ids), [&](int j, int i) {
        if(x[j] + t[j] == x[i] + t[i]) return x[j] - t[j] > x[i] - x[i];
        return x[j] + t[j] < x[i] + t[i];
    });
    rep(i, n) {
        int id = ids[i];
        if(abs(x[id]) > t[id]) continue;
        int pos = lb(as, x[id] - t[id]);
        debug(pos, v[id], seg.prod(pos, sz));
        seg.set(pos, max(seg.get(pos), seg.prod(pos, sz) + v[id]));
    }
    ll ans = seg.all_prod();
    out(ans);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // cout << fixed << setprecision(20);
    // INT(t); rep(i, t)solve();
    solve();
    return 0;
}
0