제출 #890394

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890394		vjudge1	금 캐기 (IZhO14_divide)	C++17	100 / 100	67 ms	18516 KiB

divide

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

//#pragma GCC optimization("g", on)
//#pragma GCC optimization("03")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("inline")
//#pragma GCC optimize("-fgcse,-fgcse-lm")
//#pragma GCC optimize("-ftree-pre,-ftree-vrp")
//#pragma GCC optimize("-ffast-math")
//#pragma GCC optimize("-fipa-sra")
//#pragma GCC optimize("-fpeephole2")
//#pragma GCC optimize("-fsched-spec")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")

#define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define br break;
#define sp " "
#define en "\n"
#define pb push_back
#define sz size()
#define bg begin()
#define ed end()
#define in insert
#define ss second
#define ff first
#define setp(a) cout << fixed; cout << setprecision(a);
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef double db;
typedef tree<
    long long,
    null_type,
    less_equal<long long>,
    rb_tree_tag,
    tree_order_statistics_node_update> orset;

void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
ll bp(ll x, ll y, ll z) { ll res = 1; while (y) { if (y & 1) { res = (res * x) % z; y--; } x = (x * x) % z; y >>= 1; } return res; }
// C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }

const ll N = 2e5 + 11;
const ll inf = 1e9 + 7;
ll tt = 1;
ll x[N], g[N], d[N];
ll p[N], pr[N];
pll a[N];
ll t[N * 4];
ll b[N];

void upd(ll v, ll tl, ll tr, ll pos, ll x) {
	if (tl == tr) {
		t[v] = x;
		return;
	}
	ll tm = (tl + tr) / 2;
	if (pos <= tm) upd(v * 2, tl, tm, pos, x);
	else upd(v * 2 + 1, tm + 1, tr, pos, x);
	t[v] = max(t[v * 2], t[v * 2 + 1]);
}

ll get(ll v, ll tl, ll tr, ll l, ll r) {
	if (r < tl || tr < l || r < l) return 0;
	if (l <= tl && tr <= r) return t[v];
	ll tm = (tl + tr) / 2;
	return max(get(v * 2, tl, tm, l, r), get(v * 2 + 1, tm + 1, tr, l, r));
}

void solve() {
	ll n; cin >> n;
	for (int i = 1;i <= n;i++) cin >> x[i] >> g[i] >> d[i];
	ll ans = 0;
	for (int i = 1;i <= n;i++) {
		p[i] = p[i - 1] + d[i];
		a[i] = {x[i] - p[i], i};
		pr[i] = pr[i - 1] + g[i];
	}
	sort(a + 1, a + n + 1);
	for (int i = 1;i <= n;i++) {
//		cout << a[i].ff << sp << a[i].ss << sp << i << en;
		b[a[i].ss] = i;
		upd(1, 1, n, i, a[i].ss);
	}
	for (int i = 1;i <= n;i++) {
		ll h = x[i] - p[i - 1];
		pll tm = {h + 1, 0};
		ll pos = lower_bound(a + 1, a + n + 1, tm) - a;
		pos--;
		ll r = get(1, 1, n, 1, pos);
//		cout << pos << sp << r << sp << pr[r] << sp << i << en;
		ans = max(ans, pr[r] - pr[i - 1]);
		upd(1, 1, n, b[i], 0);
	}
	cout << ans << en;
}
   
int main() {      
    aboba    
//    freopen("cownomics");
//    precalc();
//    cin >> tt;
    for (int i = 1;i <= tt;i++) {
		solve();
    }
}

컴파일 시 표준 에러 (stderr) 메시지

divide.cpp: In function 'void freopen(std::string)':
divide.cpp:46:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
divide.cpp:46:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 52 / 52