oj.uz

Submission #854794

# Submission time Handle Problem Language Result Execution time Memory
854794 2023-09-29T01:55:04 Z NeroZein Divide and conquer (IZhO14_divide) C++17
100 / 100
 26 ms 6832 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<int> x(n + 1), g(n + 1), d(n + 1); 
  for (int i = 1; i <= n; ++i) {
    cin >> x[i] >> g[i] >> d[i];
  }
  vector<long long> pg(n + 1); 
  for (int i = 1; i <= n; ++i) {
    pg[i] = pg[i - 1] + g[i]; 
  }
  vector<long long> ps(n + 1); 
  for (int i = 1; i <= n; ++i) {
    ps[i] = ps[i - 1] + d[i]; 
  }
  vector<long long> suf(n + 1); 
  suf[n] = x[n] - ps[n];
  for (int i = n - 1; i > 0; --i) {
    suf[i] = min(suf[i + 1], x[i] - ps[i]); 
  }
  long long ans = 0; 
  for (int i = 1; i <= n; ++i) {
    long long key = x[i] - ps[i - 1];
    int l = i, r = n;
    while (l < r) {
      int mid = (l + r + 1) >> 1;
      if (suf[mid] <= key) {
        l = mid;
      } else {
        r = mid - 1; 
      }
    }
    ans = max(ans, pg[l] - pg[i - 1]); 
  }
  cout << ans << '\n'; 
  return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 480 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 480 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 12 ms 2080 KB Output is correct
29 Correct 13 ms 3420 KB Output is correct
30 Correct 26 ms 6832 KB Output is correct
31 Correct 22 ms 5724 KB Output is correct
32 Correct 20 ms 5720 KB Output is correct
33 Correct 19 ms 5468 KB Output is correct
34 Correct 21 ms 5468 KB Output is correct
35 Correct 23 ms 5976 KB Output is correct
36 Correct 23 ms 6224 KB Output is correct