結果

問題 No.1826 Fruits Collecting
ユーザー 👑 PCTprobabilityPCTprobability
提出日時 2022-01-28 21:42:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,342 bytes
コンパイル時間 5,138 ms
コンパイル使用メモリ 286,136 KB
実行使用メモリ 41,856 KB
最終ジャッジ日時 2023-08-28 19:32:35
合計ジャッジ時間 15,773 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 3 ms
4,380 KB
testcase_02 AC 3 ms
4,376 KB
testcase_03 AC 3 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 120 ms
15,664 KB
testcase_06 AC 221 ms
24,268 KB
testcase_07 AC 144 ms
17,232 KB
testcase_08 AC 13 ms
4,832 KB
testcase_09 AC 228 ms
22,264 KB
testcase_10 AC 142 ms
16,428 KB
testcase_11 AC 136 ms
16,076 KB
testcase_12 AC 48 ms
8,712 KB
testcase_13 AC 22 ms
5,880 KB
testcase_14 AC 37 ms
7,120 KB
testcase_15 AC 373 ms
32,944 KB
testcase_16 AC 362 ms
32,828 KB
testcase_17 AC 368 ms
33,116 KB
testcase_18 AC 380 ms
33,084 KB
testcase_19 AC 378 ms
32,960 KB
testcase_20 AC 379 ms
33,280 KB
testcase_21 AC 373 ms
33,136 KB
testcase_22 AC 365 ms
32,752 KB
testcase_23 AC 375 ms
33,192 KB
testcase_24 AC 375 ms
33,004 KB
testcase_25 AC 2 ms
4,380 KB
testcase_26 AC 2 ms
4,376 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 2 ms
4,376 KB
testcase_29 AC 1 ms
4,380 KB
testcase_30 AC 43 ms
7,724 KB
testcase_31 AC 91 ms
12,420 KB
testcase_32 AC 120 ms
14,720 KB
testcase_33 AC 495 ms
41,856 KB
testcase_34 AC 395 ms
34,164 KB
testcase_35 AC 71 ms
10,664 KB
testcase_36 AC 487 ms
41,024 KB
testcase_37 AC 286 ms
32,236 KB
testcase_38 AC 186 ms
24,348 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 2 ms
4,380 KB
testcase_44 AC 2 ms
4,380 KB
testcase_45 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int,int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
//typedef string::const_iterator State;
//class ParseError {};
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.000000001);
const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>void print(T a){cout<<a<<endl;}
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}

void cincout() {
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
ll op(ll a,ll b){
  return max(a,b);
}
ll e(){
  return -inf;
}
int main(){
  cincout();
  ll n;
  cin>>n;
  vector<vector<ll>> a;
  map<P,ll> b;
  for(int i=0;i<n;i++){
    ll p,q,r;
    cin>>p>>q>>r;
    if(abs(q)>p) continue;
    b[{p-q,p+q}]+=r;
  }
  for(auto e:b){
    a.pb({e.fi.fi,e.fi.se,e.se});
  }
  a.pb({0,0,0});
  map<ll,ll> p,q;
  for(auto e:a){
    p[e[0]]++;
    q[e[1]]++;
  }
  ll now=0;
  for(auto &e:p){
    e.se=now;
    now++;
  }
  ll now2=0;
  for(auto &e:q){
    e.se=now2;
    now2++;
  }
  for(auto &e:a){
    e[0]=p[e[0]];
    e[1]=q[e[1]];
  }
  sor(a);
  segtree<ll,op,e> dp(n+100);
  dp.set(0,0);
  for(auto e:a){
    if(e[1]) dp.set(e[1],dp.prod(0,e[1])+e[2]);
  }
  cout<<dp.prod(0,n+1)<<endl;
}
0