Submission #496655

#	Time	Username	Problem	Language	Result	Execution time	Memory
496655		reo111	Money (IZhO17_money)	C++14	0 / 100	1 ms	288 KiB

money

//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//Ofast, avx, avx2, fma
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

#include <bits/stdc++.h>

/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;*/

#define F first
#define S second
#define pb push_back

#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define bpc(a) __builtin_popcount(a)
#define bpcll(a) __builtin_popcountll(a)
#define wtc(a) cerr << (#a) << " = " << a << '\n'
#define setprec(a) cout.precision(a)
#define base ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define file(a) freopen(a".in", "r", stdin); freopen(a".out", "w", stdout);

#define GET4_(a, b, c, d, ...) d
#define FOR_(i, a, b) for (int i = a; i < b; ++i)
#define FOR1(a) FOR_(i, 0, a)
#define FOR2(i, a) FOR_(i, 0, a)
#define FOR3(i, a, b) FOR_(i, a, b)
#define FORC_(...) GET4_(__VA_ARGS__, FOR3, FOR2, FOR1)
#define FOR(...) FORC_(__VA_ARGS__)(__VA_ARGS__)
#define TRV(i, a) for(auto &i : a)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
template <class T> using VC = vector<T>;
/*template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//insert(), find_by_order(), order_of_key(), find(), erase(find())*/
template <class T, class V> using PR = pair<T, V>;

template <class T> bool mns(T &a, T b) {return (a > b ? a = b, 1 : 0);}
template <class T> bool mxs(T &a, T b) {return (a < b ? a = b, 1 : 0);}

pii DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
const int INF = 1e9 + 1e7 + 7;
const int MOD = 998244353;//1e9 + 7;
const ll INFLL = 1e18 + 1e16 + 7ll;
const int N = 1e5 + 5;
const int SS = 5e5 + 5; //rank


void Main();
void precalc();

int main() {
    //base//d
    //precalc();
    //setprec(10);
    int T = 1;
    //cin >> T;
    FOR(i, 1, T + 1) {
        //cout << "Case #" << i << ": ";
        Main();
    }
    return 0;
}

int n;
PR<int, pii> a[N];
ll pe[N], pg[N];

ll get(int l, int r) {
    if (!l) return pe[r];
    return pe[r] - pe[l - 1];
}

ll get1(int l, int r) {
    if (!l) return pg[r];
    return pg[r] - pg[l - 1];
}

void Main() {
    cin >> n;
    FOR(n) {
        cin >> a[i].F >> a[i].S.F >> a[i].S.S;
        if (!i) pe[i] = a[i].S.S, pg[i] = a[i].S.F;
        else pe[i] = pe[i - 1] + a[i].S.S, pg[i] = pg[i - 1] + a[i].S.F;
    }
    sort(a + 0, a + n);
    int fs = 0;
    ll cg = a[0].S.F, ce = a[0].S.S;
    ll ans = 0;
    FOR(i, 1, n) {
        //cout << i << ' ';
        if (ce + a[i].S.S >= a[i].F - a[fs].F) {
            mxs(ans, cg + a[i].S.F);
        } else {
            int l = 0, r = i, m, j;
            while (l <= r) {
                m = (l + r) / 2;
                //cout << m << ' ' << get(m, i) << endl;
                if (get(m, i) >= a[i].F - a[m].F) {
                    j = m;
                    r = m - 1;
                } else {
                    l = m + 1;
                }
            }
            //cout << j << ' ' << i << endl;
            mxs(ans, get1(j, i));
            //cout << "lol";
            fs = j;
        }
        ce += a[i].S.S;
        cg += a[i].S.F;
    }
    cout << ans;
}

Compilation message (stderr)

money.cpp: In function 'void Main()':
money.cpp:90:25: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
   90 |     return pg[r] - pg[l - 1];
      |                       ~~^~~
money.cpp:109:34: note: 'j' was declared here
  109 |             int l = 0, r = i, m, j;
      |                                  ^

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55