제출 #1173354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1173354		iamhereforfun	금 캐기 (IZhO14_divide)	C++20	0 / 100	0 ms	324 KiB

divide

// IamHereForFun //

#include <bits/stdc++.h>

using namespace std;

#define LSOne(S) ((S) & -(S))

const int N = 1e5 + 5;
const int Q = 2e5 + 5;
const int M = 1e6 + 5;
const int LG = 18;
const int P = 31;
const long long INF = 4e18;
const int MOD = 1e9;

class Fenwick
{
    private:
    vector<long long> ft;
    int n;
    public:
    Fenwick(int len)
    {
        n = len;
        ft.assign(n + 1, INF);
    }
    void updFt(int pos, long long val)
    {
        while(pos <= n)
        {
            ft[pos] = min(ft[pos], val);
            pos += LSOne(pos);
        }
    }
    long long getMin(int pos)
    {
        long long ans = INF;
        while(pos > 0)
        {
            ans = min(ans, ft[pos]);
            pos -= LSOne(pos);
        }
        return ans;
    }
};

int n;
long long pref[N], ans = 0;
array<long long, 3> mine[N];
vector<long long> vec;

int getIdx(long long a)
{
    return lower_bound(vec.begin(), vec.end(), a) - vec.begin() + 1;
}

void prtSolve()
{
    cin >> n;
    for (int x = 0; x < n; x++)
    {
        cin >> mine[x][0] >> mine[x][1] >> mine[x][2];
        if(mine[x][2] >= 1) ans = max(ans, mine[x][1]);
    }
    sort(mine, mine + n);
    pref[0] = mine[0][2];
    for (int x = 1; x < n; x++)
    {
        pref[x] = pref[x - 1] + mine[x][2];
    }
    for(int x = 0; x < n; x++) 
    {
        vec.push_back(pref[x] - mine[x][0]);
    }
    vec.push_back(0);
    sort(vec.begin(), vec.end());
    vec.erase(unique(vec.begin(), vec.end()), vec.end());
    Fenwick ft(vec.size());
    long long sum = 0;
    ft.updFt(getIdx(0), 0);
    for(int x = 0; x < n; x++)
    {
        sum += mine[x][1];
        ans = max(ans, sum - ft.getMin(getIdx(pref[x] - mine[x][0])));
        ft.updFt(getIdx(pref[x] - mine[x][0]), sum);
    }
    cout << ans;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    for (int x = 1; x <= t; x++)
    {
        prtSolve();
    }
    return 0;
}

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