oj.uz

Submission #503539

# Submission time Handle Problem Language Result Execution time Memory
503539 2022-01-08T10:26:35 Z armashka Divide and conquer (IZhO14_divide) C++17
100 / 100
 115 ms 9104 KB 
#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

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

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 332 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 6 ms 700 KB Output is correct
24 Correct 5 ms 716 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 6 ms 700 KB Output is correct
24 Correct 5 ms 716 KB Output is correct
25 Correct 4 ms 608 KB Output is correct
26 Correct 7 ms 1004 KB Output is correct
27 Correct 9 ms 1100 KB Output is correct
28 Correct 44 ms 4292 KB Output is correct
29 Correct 53 ms 4520 KB Output is correct
30 Correct 115 ms 9104 KB Output is correct
31 Correct 79 ms 8012 KB Output is correct
32 Correct 101 ms 8060 KB Output is correct
33 Correct 90 ms 7916 KB Output is correct
34 Correct 82 ms 7848 KB Output is correct
35 Correct 98 ms 8364 KB Output is correct
36 Correct 103 ms 8464 KB Output is correct