結果
| 問題 |
No.1826 Fruits Collecting
|
| コンテスト | |
| ユーザー |
 riano
|
| 提出日時 | 2022-01-28 22:01:29 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 214 ms / 2,000 ms |
| コード長 | 6,025 bytes |
| コンパイル時間 | 2,418 ms |
| コンパイル使用メモリ | 185,916 KB |
| 実行使用メモリ | 22,272 KB |
| 最終ジャッジ日時 | 2024-12-30 06:49:22 |
| 合計ジャッジ時間 | 8,571 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 43 |
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:211:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
211 | auto[ss,tt,id] = s[i];
| ^
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--)
#define vll(n,i) vector<long long>(n,i)
#define v2ll(n,m,i) vector<vector<long long>>(n,vll(m,i))
#define v3ll(n,m,k,i) vector<vector<vector<long long>>>(n,v2ll(m,k,i))
#define v4ll(n,m,k,l,i) vector<vector<vector<vector<long long>>>>(n,v3ll(m,k,l,i))
#define all(v) v.begin(),v.end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
#define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr)
//Graph
struct graph {
long long N;
vector<vector<tuple<long long,long long,int>>> G;
vector<long long> par_v;
vector<long long> par_e;
int edge_count = 0;
graph(long long n) {
N = n;
G = vector<vector<tuple<long long,long long,int>>>(N);
par_v = vector<long long>(N,-1);
par_e = vector<long long>(N,-1);
}
void unite(long long a,long long b,long long cost = 1,bool directed = false){
G[a].emplace_back(b,cost,edge_count);
if(!directed) G[b].emplace_back(a,cost,edge_count);
edge_count++;
}
};
const ll mod = 998244353;
template<uint64_t mod>
struct modint{
uint64_t val;
constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){}
constexpr modint operator-() const noexcept{
return modint(*this)=mod-val;
}
constexpr modint operator+(const modint rhs) const noexcept{
return modint(*this)+=rhs;
}
constexpr modint operator-(const modint rhs) const noexcept{
return modint(*this)-=rhs;
}
constexpr modint operator*(const modint rhs) const noexcept{
return modint(*this)*=rhs;
}
constexpr modint operator/(const modint rhs) const noexcept{
return modint(*this)/=rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept{
val+=rhs.val;
val-=((val>=mod)?mod:0);
return (*this);
}
constexpr modint &operator-=(const modint rhs) noexcept{
val+=((val<rhs.val)?mod:0);
val-=rhs.val;
return (*this);
}
constexpr modint &operator*=(const modint rhs) noexcept{
val=val*rhs.val%mod;
return (*this);
}
constexpr modint &operator/=(modint rhs) noexcept{
uint64_t ex=mod-2;
modint now=1;
while(ex){
now*=((ex&1)?rhs:1);
rhs*=rhs,ex>>=1;
}
return (*this)*=now;
}
modint & operator++(){
val++;
if (val == mod) val = 0;
return *this;
}
modint operator++(int){
modint<mod> res = *this;
++*this;
return res;
}
constexpr bool operator==(const modint rhs) noexcept{
return val==rhs.val;
}
constexpr bool operator!=(const modint rhs) noexcept{
return val!=rhs.val;
}
friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{
return os<<(x.val);
}
friend constexpr istream &operator>>(istream& is,modint& x) noexcept{
uint64_t t;
is>>t,x=t;
return is;
}
};
typedef modint<mod> mint;
mint pw(long long a,long long b,long long m = mod){
if(a%m==0) return mint(0);
if(b==0) return mint(1);
else if(b%2==0){
long long x = pw(a,b/2,m).val;
return mint(x*x);
}
else{
long long x = pw(a,b-1,m).val;
return mint(a*x);
}
}
mint modinv(long long a, long long m = mod) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
return mint(u);
}
#define vm(n,i) vector<mint>(n,i)
#define v2m(n,m,i) vector<vector<mint>>(n,vm(m,i))
#define v3m(n,m,k,i) vector<vector<vector<mint>>>(n,v2m(m,k,i))
#define v4m(n,m,k,l,i) vector<vector<vector<vector<mint>>>>(n,v3m(m,k,l,i))
void out(vector<ll> &v){
for(ll x:v) cout << x << " ";
cout << "\n"; return;
}
//segment tree
//1-indexed all
class segtree {
public:
ll n;
vector<ll> A;
segtree(ll k){
n = 1;
while(n<k){ n *= 2; }
A=vector<ll>(2*n,-2e18);
}
//a[i]をにする
void replace(ll i,ll x){
int index = n-1+i;
A[index] = x;
while(index>1){
index /= 2;
A[index] = max(A[2*index],A[2*index+1]);
}
}
//a[i]+a[i+1]+…+a[j]を求める
ll sum(ll i,ll j){
return rangesum(i,j,1,1,n);
}
// a,b求める区間 k区間番号 c,d区間の始終点(k=1,c=1,d=nで入力する)
ll rangesum(ll a,ll b,ll k,ll c,ll d){
//単位元の設定
ll el = -2e18;
if(d<a||b<c){
return el;
}
else if(a<=c&&d<=b){
return A[k];
}
else{
//2区間に分割して演算を行う
ll p = max(rangesum(a,b,k*2,c,(c+d)/2),rangesum(a,b,k*2+1,(c+d)/2+1,d));
return p;
}
}
};
int main() {
riano_; ll ans = 0;
ll N,M,K,T; cin >> N;
//main関数内で
segtree seq(N+2);
//などと宣言し seq.replace(i,x);
//のように使う 1-indexed 注意!!!!!!
ll t[N+1],x[N+1],v[N+1];
vector<Tp> s,r;
s.emplace_back(0,0,0);
r.emplace_back(0,0,0);
rep(i,N){
cin >> t[i+1] >> x[i+1] >> v[i+1];
s.emplace_back(t[i+1]-x[i+1],t[i+1],i+1);
r.emplace_back(t[i+1]+x[i+1],t[i+1],i+1);
}
sort(all(s)); sort(all(r));
int rn[N+1];
rep(i,N+1){
rn[get<2>(r[i])] = i+1;
}
rep(i,N+1){
auto[ss,tt,id] = s[i];
if(id==0){
seq.replace(rn[0],0); continue;
}
ll rr = rn[id];
// cout << ss << " " << id << " " << rr << endl;
// cout << seq.sum(1,rr) << endl;
seq.replace(rr,seq.sum(1,rr)+v[id]);
}
ans = seq.sum(1,N+1);
cout << ans << endl;
}