oj.uz

Submission #990147

# Submission time Handle Problem Language Result Execution time Memory
990147 2024-05-29T17:07:33 Z tch1cherin Divide and conquer (IZhO14_divide) C++17
100 / 100
 51 ms 11348 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N;
  cin >> N;
  vector<int> x(N), g(N), d(N);
  for (int i = 0; i < N; i++) {
    cin >> x[i] >> g[i] >> d[i];
  }
  vector<long long> pref_d(N + 1), pref_g(N + 1);
  for (int i = 0; i < N; i++) {
    pref_d[i + 1] = pref_d[i] + d[i];
    pref_g[i + 1] = pref_g[i] + g[i];
  }
  set<pair<long long, long long>> S;
  long long answer = 0;
  for (int i = 0; i < N; i++) {
    auto it = S.lower_bound({pref_d[i] - x[i], numeric_limits<int>::max()});
    bool good = true;
    if (it != S.begin()) {
      if (prev(it)->second < pref_g[i]) {
        good = false;
      }
    }
    if (good) {
      while (it != S.end() && it->second >= pref_g[i]) {
        it = S.erase(it);
      }
      S.insert({pref_d[i] - x[i], pref_g[i]});
    }
    it = S.lower_bound({pref_d[i + 1] - x[i], numeric_limits<int>::max()});
    assert(it != S.begin());
    answer = max(answer, pref_g[i + 1] - prev(it)->second);
  }
  cout << answer << "\n";
}

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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 372 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 372 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 0 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 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 860 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 372 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 0 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 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 11 ms 1824 KB Output is correct
29 Correct 10 ms 3092 KB Output is correct
30 Correct 22 ms 5848 KB Output is correct
31 Correct 17 ms 4816 KB Output is correct
32 Correct 17 ms 4956 KB Output is correct
33 Correct 16 ms 4700 KB Output is correct
34 Correct 38 ms 7764 KB Output is correct
35 Correct 51 ms 11348 KB Output is correct
36 Correct 51 ms 11344 KB Output is correct