結果

問題 No.1826 Fruits Collecting
ユーザー heno239heno239
提出日時 2022-01-28 22:14:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,660 ms / 2,000 ms
コード長 7,455 bytes
コンパイル時間 2,784 ms
コンパイル使用メモリ 179,348 KB
実行使用メモリ 104,116 KB
最終ジャッジ日時 2024-06-09 15:23:25
合計ジャッジ時間 30,908 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
11,716 KB
testcase_01 AC 11 ms
12,100 KB
testcase_02 AC 10 ms
12,096 KB
testcase_03 AC 11 ms
12,228 KB
testcase_04 AC 8 ms
11,720 KB
testcase_05 AC 512 ms
47,372 KB
testcase_06 AC 990 ms
73,600 KB
testcase_07 AC 603 ms
53,168 KB
testcase_08 AC 41 ms
15,684 KB
testcase_09 AC 874 ms
68,640 KB
testcase_10 AC 573 ms
50,820 KB
testcase_11 AC 551 ms
49,668 KB
testcase_12 AC 176 ms
26,556 KB
testcase_13 AC 73 ms
18,756 KB
testcase_14 AC 125 ms
23,112 KB
testcase_15 AC 1,628 ms
104,116 KB
testcase_16 AC 1,630 ms
103,632 KB
testcase_17 AC 1,610 ms
103,452 KB
testcase_18 AC 1,587 ms
103,524 KB
testcase_19 AC 1,660 ms
103,668 KB
testcase_20 AC 1,598 ms
103,532 KB
testcase_21 AC 1,579 ms
103,388 KB
testcase_22 AC 1,600 ms
103,596 KB
testcase_23 AC 1,580 ms
103,476 KB
testcase_24 AC 1,656 ms
103,500 KB
testcase_25 AC 8 ms
11,588 KB
testcase_26 AC 7 ms
11,716 KB
testcase_27 AC 8 ms
11,584 KB
testcase_28 AC 8 ms
11,712 KB
testcase_29 AC 8 ms
11,592 KB
testcase_30 AC 249 ms
30,652 KB
testcase_31 AC 580 ms
50,264 KB
testcase_32 AC 221 ms
29,824 KB
testcase_33 AC 1,029 ms
74,472 KB
testcase_34 AC 767 ms
62,948 KB
testcase_35 AC 132 ms
23,236 KB
testcase_36 AC 1,016 ms
74,044 KB
testcase_37 AC 100 ms
19,172 KB
testcase_38 AC 77 ms
17,136 KB
testcase_39 AC 536 ms
68,372 KB
testcase_40 AC 689 ms
86,360 KB
testcase_41 AC 133 ms
26,464 KB
testcase_42 AC 21 ms
13,384 KB
testcase_43 AC 8 ms
11,584 KB
testcase_44 AC 7 ms
11,716 KB
testcase_45 AC 8 ms
11,588 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 100005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}

//-----------------------------------------

//2DBIT
//[0,x),[0,y)内の最大値を返す
struct BIT {
private:
	vector<ll> node; int n;
public:
	ll f(ll a, ll b) {
		return max(a, b);
	}
	void init(int n_) {
		n = n_; node.resize(n, -INF);
	}
	//[0,a)
	ll query(int a) {
		ll ret = -INF;
		for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret = f(ret, node[i]);
		return ret;
	}
	void update(int a, ll b) {
		for (int i = a; i < n; i |= i + 1)node[i] = f(node[i], b);
	}
};
struct BIT2 {
private:
	vector<BIT> node; int sz;
	vector<vector<int>> vy;
public:
	ll f(ll a, ll b) {
		return max(a, b);
	}
	BIT2(int n) {
		sz = n; node.resize(n);
		vy.resize(n);
	}
	//先読み。
	void add(int x, int y) {
		for (int i = x; i < sz; i |= i + 1) {
			vy[i].push_back(y);
		}
	}
	//先読みの反映。
	void complete() {
		rep(i, sz) {
			//sort(vy[i].begin(), vy[i].end());
			vector<int> cop = vy[i];
			vy[i].erase(unique(vy[i].begin(), vy[i].end()), vy[i].end());
			int siz = vy[i].size();
			node[i].init(siz);
		}
	}
	ll query(int x, int y) {
		ll ret = -INF;
		for (int i = x - 1; i >= 0; i = (i & (i + 1)) - 1) {
			int idy = lower_bound(vy[i].begin(), vy[i].end(), y) - vy[i].begin();
			ret = f(ret, node[i].query(idy));
		}
		return ret;
	}
	void update(int x, int y, ll k) {
		for (int i = x; i < sz; i |= i + 1) {
			int idy = lower_bound(vy[i].begin(), vy[i].end(), y) - vy[i].begin();
			node[i].update(idy, k);
		}
	}
};

bool comp(P a, P b) {
	if (a.second != b.second)return a.second < b.second;
	return a.first < b.first;
}
void solve() {
	int n; cin >> n;
	using ar = array<int, 3>;
	vector<ar> v(n);
	vector<pair<int, P>> ori(n);
	rep(i, n)cin >> ori[i].first >> ori[i].second.first >> ori[i].second.second;
	sort(all(ori));
	rep(i, n) {
		v[i][0] = ori[i].first;
		v[i][1] = ori[i].second.first;
		v[i][2] = ori[i].second.second;
	}
	//rep(i, n)rep(j, 3)cin >> v[i][j];
	//sort(all(v));
	vector<int> vx;
	rep(i, n) {
		vx.push_back(v[i][1]);
	}
	vx.push_back(0);
	sort(all(vx));
	vx.erase(unique(all(vx)), vx.end());
	vector<P> orile, oriri;
	rep(i, n) {
		int x = v[i][1];
		x = lower_bound(all(vx), x) - vx.begin();
		int y = v[i][0] - v[i][1];
		orile.push_back({ x,y });
		y = v[i][0] + v[i][1];
		oriri.push_back({ x,y });
	}
	int loc0 = lower_bound(all(vx), 0) - vx.begin();
	orile.push_back({ loc0,0 });
	oriri.push_back({ loc0,0 });
	sort(all(orile), comp);
	sort(all(oriri), comp);
	BIT2 btle(vx.size()), btri(vx.size());
	for (P p : orile) {
		btle.add(p.first, p.second);
	}
	for (P p : oriri) {
		btri.add(vx.size() - 1 - p.first, p.second);
	}
	btle.complete(); btri.complete();
	btle.update(loc0, 0, 0);
	btri.update(vx.size() - 1 - loc0, 0, 0);
	ll ans = 0;
	rep(i, n) {
		int x = lower_bound(all(vx), v[i][1]) - vx.begin();
		ll val = -INF;
		int y = v[i][0] - v[i][1];
		ll valle = btle.query(x+1,y+1);
		y = v[i][0] + v[i][1];
		ll valri = btri.query(vx.size()-1-x, y + 1);
		val = max(valle, valri) + v[i][2];
		chmax(ans, val);
		y = v[i][0] - v[i][1];
		btle.update(x, y, val);
		y = v[i][0] + v[i][1];
		btri.update(vx.size()-1-x, y, val);
	}
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0