oj.uz

답안 #246415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246415 2020-07-09T07:57:31 Z aloo123 금 캐기 (IZhO14_divide) C++14
100 / 100
 83 ms 10872 KB 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> os;
 
 
const ll INF = 1e12;
const ll N =(1e5+5); // TODO : change value as per problem
const ll MOD = 1e9+7;

struct nice
{   
    ll x;
    ll g;
    ll e;
};
nice a[N];
ll gold[N];
ll energy[N];
pll diff[N];
ll pos[N];
bool cmp(nice b, nice c){
    return (b.x < c.x);
}
bool cmp2(pll gg,pll gg2){
    return gg.s < gg2.s;
}
ll t[4*N];
void build(ll node,ll l,ll r){
    if(l == r){
        t[node] = diff[l].f;
    }
    else{
        ll m = (l+r)>>1ll;
        build(node*2,l,m);
        build(node*2+1,m+1,r);
        t[node] = max(t[node*2],t[node*2+1]);
    }
}
ll query(ll node,ll l,ll r,ll st,ll en){
    if(l > en || r < st){
        return 0;
    }
    if(l >= st && r <= en){
        return t[node];
    }
    ll m = (l+r)>>1ll;
    ll p1 = query(node*2,l,m,st,en);
    ll p2 = query(node*2+1,m+1,r,st,en);
    return max(p1,p2);
}

void solve(){
    ll n;
    cin >> n;

    for(int i =1;i<=n;i++){
        cin >> a[i].x >> a[i].g >> a[i].e;
        
    }
    sort(a+1,a+n+1,cmp);
    for(int i =1;i<=n;i++){
        gold[i] = gold[i-1] + a[i].g;
        energy[i] = energy[i-1] + a[i].e;
    }
    for(int i =1;i<=n;i++) diff[i] =mp(i, energy[i] - a[i].x);
    sort(diff+1,diff+n+1,cmp2);
    
    build(1,1,n);
    // cout << "----\n";
    ll ans = 0;
    for(ll l = 1;l<=n;l++){
        ll tote = energy[l-1] - a[l].x;
        ll lo = 1,hi = n;
        ll gg = INF;
        while(hi>=lo){
            ll m = (lo+hi)>>1ll;
            if(diff[m].s >= tote){
                gg = min(gg,m);
                hi = m-1;
            }
            else lo = m+1;
        }
        if(gg == INF) continue;
        ll idx = query(1,1,n,gg,n);
        // cout << l << " " << idx<< endl;
        if(idx != 0) ans = max(ans,gold[idx]-gold[l-1]);
    }
    cout << ans << endl;
}

signed main(){

    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    

 
     ll tt=1;   
     // cin >> tt;
    while(tt--){    
        solve();
    }    
}
/*
Pick a Range [L,R] such that :
	a) The sum of energy levels in the range >= R-L+1
	b) Sum of Gold is maximal Possible 


	
*/

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 8 ms 896 KB Output is correct
24 Correct 8 ms 896 KB Output is correct

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 8 ms 896 KB Output is correct
24 Correct 8 ms 896 KB Output is correct
25 Correct 8 ms 896 KB Output is correct
26 Correct 10 ms 1280 KB Output is correct
27 Correct 11 ms 1408 KB Output is correct
28 Correct 38 ms 4728 KB Output is correct
29 Correct 42 ms 5368 KB Output is correct
30 Correct 83 ms 10872 KB Output is correct
31 Correct 76 ms 9592 KB Output is correct
32 Correct 76 ms 9768 KB Output is correct
33 Correct 72 ms 9464 KB Output is correct
34 Correct 75 ms 9468 KB Output is correct
35 Correct 75 ms 9976 KB Output is correct
36 Correct 80 ms 10232 KB Output is correct