結果

問題 No.1826 Fruits Collecting
ユーザー woodywoodywoodywoody
提出日時 2022-09-23 19:05:57
言語 C++14
(gcc 11.2.0 + boost 1.78.0)
結果
WA  
実行時間 -
コード長 4,089 Byte
コンパイル時間 4,704 ms
使用メモリ 22,672 KB
最終ジャッジ日時 2022-09-23 19:06:20
合計ジャッジ時間 17,353 ms
ジャッジサーバーID
(参考情報)
judge13 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 2 ms
4,904 KB
testcase_01 AC 3 ms
6,948 KB
testcase_02 AC 3 ms
4,904 KB
testcase_03 AC 4 ms
4,904 KB
testcase_04 AC 2 ms
4,904 KB
testcase_05 AC 126 ms
9,124 KB
testcase_06 AC 218 ms
13,276 KB
testcase_07 AC 150 ms
9,920 KB
testcase_08 AC 16 ms
6,952 KB
testcase_09 AC 235 ms
12,400 KB
testcase_10 AC 141 ms
9,792 KB
testcase_11 AC 135 ms
9,520 KB
testcase_12 AC 53 ms
5,800 KB
testcase_13 AC 26 ms
6,952 KB
testcase_14 AC 42 ms
6,948 KB
testcase_15 AC 334 ms
17,620 KB
testcase_16 AC 334 ms
17,632 KB
testcase_17 AC 379 ms
17,500 KB
testcase_18 AC 339 ms
17,576 KB
testcase_19 AC 346 ms
17,632 KB
testcase_20 AC 434 ms
17,760 KB
testcase_21 AC 410 ms
17,696 KB
testcase_22 AC 401 ms
18,012 KB
testcase_23 AC 400 ms
17,648 KB
testcase_24 AC 346 ms
17,596 KB
testcase_25 AC 1 ms
4,904 KB
testcase_26 AC 1 ms
4,904 KB
testcase_27 AC 1 ms
4,900 KB
testcase_28 AC 1 ms
6,948 KB
testcase_29 AC 1 ms
6,948 KB
testcase_30 AC 64 ms
5,512 KB
testcase_31 AC 119 ms
7,636 KB
testcase_32 AC 89 ms
8,804 KB
testcase_33 AC 353 ms
22,672 KB
testcase_34 AC 263 ms
17,900 KB
testcase_35 AC 55 ms
6,632 KB
testcase_36 AC 320 ms
22,568 KB
testcase_37 AC 189 ms
17,172 KB
testcase_38 AC 130 ms
13,612 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 2 ms
4,900 KB
testcase_44 AC 2 ms
6,948 KB
testcase_45 AC 1 ms
4,904 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

// #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define debp(p) cout << p.fi << " " << p.se << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showdeb(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return 0;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return 0;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

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

ll e(){
    return -LINF;
}

struct state{
    ll a,b,v;
 
    state(ll a=0,ll b=0,ll v=0) : a(a),b(b),v(v) {}
 
    bool operator<(state const &ot) const{
        return a < ot.a;
    }
};

void solve(){
    int n; cin>>n;

    vl a(n);
    vl b(n);

    vector<state> vs;
    vs.pb(state(0,0,0));

    map<ll,int> mp;
    mp[0] = 0;

    rep(i,n){
        ll t,x,v; cin>>t>>x>>v;
        ll a = t - x;
        ll b = t + x;

        if (t < abs(x)) continue;

        vs.pb(state(a,b,v));
        mp[b] = 0;
    }

    sort(rng(vs));

    int m = 0;

    fore1(y , mp) y.se = m++;

    segtree<ll,op,e> sg(sz(vs));

    sg.set(0 , 0);

    rep1(i,sz(vs)){
        int idx = mp[vs[i].b];
        ll mx = sg.prod(0,idx+1);
        sg.set(idx , mx+vs[i].v);
    }

    ll ans = sg.all_prod();

    out;


}

int main(){

    solve();

    return 0;
}
0