oj.uz

Submission #589723

# Submission time Handle Problem Language Result Execution time Memory
589723 2022-07-05T07:55:23 Z Mamedov Divide and conquer (IZhO14_divide) C++17
100 / 100
 41 ms 6348 KB 
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define pii pair<int, int>
#define piii pair<pii, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define f first
#define s second
#define oo 1000000001
#define eb emplace_back
#define pb push_back
#define mpr make_pair
#define size(v) (int)v.size()
#define ln '\n'
#define ull unsigned long long
#define ll long long
#define all(v) v.begin(), v.end()

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

struct miningCamp {
  int x, g;
  ll d;
  bool operator < (const miningCamp &camp) const {
    return x < camp.x;
  }
};

void solve() {
  int n;
  cin >> n;
  vector<miningCamp>camps(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> camps[i].x >> camps[i].g >> camps[i].d;
  }
  sort(camps.begin() + 1, camps.end());
  camps[0].d = 0;
  for (int i = 1; i <= n; ++i) {
    camps[i].d += camps[i - 1].d;
  }
  vector<ll>diffMax(n + 1, 0);
  vector<ll>sumGold(n + 1, 0);
  for (int i = n; i >= 1; --i) {
    diffMax[i] = camps[i].d - camps[i].x;
    if (i < n) diffMax[i] = max(diffMax[i], diffMax[i + 1]);
  }
  for (int i = 1; i <= n; ++i) {
    sumGold[i] = sumGold[i - 1] + camps[i].g;
  }
  ll res = 0;
  for (int i = 1; i <= n; ++i) {
    ll val = camps[i - 1].d - camps[i].x;
    int l = i, r = n;
    int mid;
    while (l < r) {
      mid = (l + r + 1) >> 1;
      if (diffMax[mid] >= val) {
        l = mid;
      } else {
        r = mid - 1;
      }
    }
    res = max(res, sumGold[l] - sumGold[i - 1]);
  }
  cout << res << ln;
}
int main() {
  ios_base::sync_with_stdio(false);
  solve();
  return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 2 ms 596 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 3 ms 736 KB Output is correct
27 Correct 3 ms 808 KB Output is correct
28 Correct 16 ms 2900 KB Output is correct
29 Correct 20 ms 3192 KB Output is correct
30 Correct 37 ms 6348 KB Output is correct
31 Correct 41 ms 5080 KB Output is correct
32 Correct 31 ms 5200 KB Output is correct
33 Correct 28 ms 5084 KB Output is correct
34 Correct 30 ms 5068 KB Output is correct
35 Correct 32 ms 5592 KB Output is correct
36 Correct 34 ms 5720 KB Output is correct