Submission #503539

#	Time	Username	Problem	Language	Result	Execution time	Memory
503539		armashka	Divide and conquer (IZhO14_divide)	C++17	100 / 100	115 ms	9104 KiB

divide

#include <bits/stdc++.h>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 2e6 + 10;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }                                   
bool even(ll n) { return (n % 2 == 0); }            

struct node {
  ll x, g, e;
} a[N];
ll n, t[N * 4], pr1[N], pr2[N];

void build(ll v = 1, ll tl = 1, ll tr = n) {
  if (tl == tr) {
    t[v] = pr2[tl] - a[tl].x;
    return;
  }
  ll tm = (tl + tr) / 2;
  build(v + v, tl, tm);
  build(v + v + 1, tm + 1, tr);
  t[v] = max(t[v + v], t[v + v + 1]);
}

ll get(ll x, ll l, ll r, ll v = 1, ll tl = 1, ll tr = n) {
  if (r < tl || tr < l) return -1;
  if (t[v] < x) return -1;
  if (tl == tr) return tl;
  ll tm = (tl + tr) / 2;
  ll ans = get(x, l, r, v + v + 1, tm + 1, tr);
  if (ans == -1) ans = get(x, l, r, v + v, tl, tm);
  return ans;  
}

const void solve(/*Armashka*/) {
  cin >> n;
  for (int i = 1; i <= n; ++ i) cin >> a[i].x >> a[i].g >> a[i].e;
  for (int i = 1; i <= n; ++ i) {
    pr1[i] = pr1[i - 1] + a[i].g;
    pr2[i] = pr2[i - 1] + a[i].e;
  }
  build();
  ll ans = 0;
  for (int i = 1; i <= n; ++ i) {
    ll j = get(pr2[i] - a[i].x - a[i].e, i, n);
    //cout << i << " " << j << "\n";
    ans = max(ans, pr1[j] - pr1[i - 1]);
  }
  cout << ans << "\n";
}
            
signed main() {
    //fast;
    //freopen("rmq.in", "r", stdin);
    //freopen("rmq.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {                                                             
        solve();
    }
}
// Uaqyt, otedi, ketedi, mulde bilinbei ulger
// Kunder seni kutpeidi, susyz ospeidi gulder

Compilation message (stderr)

divide.cpp:3: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    3 | #pragma comment(linker, "/stack:200000000")
      |

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