結果

問題 No.1826 Fruits Collecting
ユーザー heno239heno239
提出日時 2022-01-28 21:46:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 7,082 bytes
コンパイル時間 2,602 ms
コンパイル使用メモリ 183,856 KB
実行使用メモリ 216,256 KB
最終ジャッジ日時 2024-06-09 14:49:18
合計ジャッジ時間 16,405 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
17,732 KB
testcase_01 AC 11 ms
12,356 KB
testcase_02 AC 11 ms
12,484 KB
testcase_03 AC 14 ms
12,872 KB
testcase_04 AC 8 ms
12,224 KB
testcase_05 AC 1,024 ms
95,884 KB
testcase_06 AC 1,942 ms
165,768 KB
testcase_07 AC 1,205 ms
104,104 KB
testcase_08 AC 73 ms
21,444 KB
testcase_09 AC 1,907 ms
127,584 KB
testcase_10 AC 1,138 ms
100,800 KB
testcase_11 AC 1,082 ms
99,160 KB
testcase_12 AC 335 ms
49,392 KB
testcase_13 AC 138 ms
29,804 KB
testcase_14 AC 246 ms
36,096 KB
testcase_15 TLE -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
testcase_45 -- -
権限があれば一括ダウンロードができます

ソースコード

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;
}

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

struct Seg2T {
private:
	vector<ll> node; int sz;
	vector<int> vy;
	const ll init_c = -INF;
public:
	ll f(ll a, ll b) {
		return max(a, b);
	}
	void add(int y) {
		vy.push_back(y);
	}
	void complete() {
		sort(vy.begin(), vy.end());
		vy.erase(unique(vy.begin(), vy.end()), vy.end());
		sz = vy.size();
		int n = vy.size();
		node.resize(sz,init_c);
	}
	void update(int k, ll c) {
		k = lower_bound(vy.begin(), vy.end(), k) - vy.begin();
		for (int i = k; i < sz; i |= i + 1)node[i] = f(node[i], c);
	}
	ll query(int k) {
		k = lower_bound(all(vy), k) - vy.begin();
		ll res = -INF;
		for (int i = k - 1; i >= 0; i = (i & (i + 1)) - 1)res = f(res, node[i]);
		return res;
	}
};

struct SegT {
private:
	int sz;
	vector<Seg2T> node;
	const ll init_c = -INF;
public:
	ll f(ll a, ll b) {
		return max(a, b);
	}
	SegT(vector<P> v, int n) {
		sz = 1; while (sz < n)sz *= 2; node.resize(sz * 2 - 1);
		rep(i, v.size()) {
			int k = v[i].first, y = v[i].second;
			k += sz - 1;
			node[k].add(y);
			while (k > 0) {
				k = (k - 1) / 2;
				node[k].add(y);
			}
		}
		rep(i, 2 * sz - 1)node[i].complete();
	}
	void update(int x, int y, ll c) {
		x += sz - 1;
		node[x].update(y, c);
		while (x) {
			x = (x - 1) / 2;
			node[x].update(y, c);
		}
	}
	ll query(int a, int b, int x, int y, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = sz;
		if (r <= a || b <= l)return init_c;
		else if (a <= l && r <= b)return node[k].query(y);
		else {
			ll vl = query(a, b, x, y, k * 2 + 1, l, (l + r) / 2);
			ll vr = query(a, b, x, y, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
};
void solve(){
	int n; cin >> n;
	using ar = array<int, 3>;
	vector<ar> v(n);
	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 });
	SegT stle(orile, vx.size()), stri(oriri, vx.size());
	stle.update(loc0, 0, 0);
	stri.update(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 = stle.query(0, x, 0, y + 1);
		y = v[i][0] + v[i][1];
		ll valri = stri.query(x, vx.size(), 0, y + 1);
		val = max(valle, valri) + v[i][2];
		chmax(ans, val);
		y = v[i][0] - v[i][1];
		stle.update(x, y, val);
		y = v[i][0] + v[i][1];
		stri.update(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