Submission #340679

#	Time	Username	Problem	Language	Result	Execution time	Memory
340679		talant117408	Divide and conquer (IZhO14_divide)	C++17	100 / 100	45 ms	6784 KiB

divide

/*
    Code written by Talant I.D.
*/
  
#include <bits/stdc++.h>
  
using namespace std;
  
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 2e5+7;

struct node{
    ll pos, gold, energy;
};

ll n, smax[N];
ll ans, sgold[N], senergy[N];
node mine[N];
pll mines[N];

int main(){
    do_not_disturb
    
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> mine[i].pos >> mine[i].gold >> mine[i].energy;
        sgold[i] = sgold[i-1]+mine[i].gold;
        senergy[i] = senergy[i-1]+mine[i].energy;
        
        mines[i] = mp(senergy[i]-mine[i].pos, i);
    }
    
    sort(mines+1, mines+n+1);
    
    for(int i = n; i; i--){
        smax[i] = max(smax[i+1], mines[i].second);
    }
    
    for(int i = 1; i <= n; i++){
        int low = lb(mines+1, mines+1+n, mp(senergy[i-1]-mine[i].pos, 0ll))-mines;
        ans = max(ans, sgold[smax[low]]-sgold[i-1]);
    }
    cout << ans;
    
    return 0;
}

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