oj.uz

Submission #990138

# Submission time Handle Problem Language Result Execution time Memory
990138 2024-05-29T16:45:20 Z tch1cherin Divide and conquer (IZhO14_divide) C++17
48 / 100
 1000 ms 1936 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];
  }
  long long answer = 0;
  for (int i = 0; i < N; i++) {
    long long sum_g = 0, sum_d = 0;
    for (int j = i; j < N; j++) {
      sum_g += g[j];
      sum_d += d[j];
      if (sum_d >= x[j] - x[i]) {
        answer = max(answer, sum_g);
      }
    }
  }
  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 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 344 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 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 344 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 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 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 1 ms 488 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 3 ms 492 KB Output is correct
23 Correct 13 ms 604 KB Output is correct
24 Correct 14 ms 604 KB Output is correct

Subtask #3
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 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 344 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 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 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 1 ms 488 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 3 ms 492 KB Output is correct
23 Correct 13 ms 604 KB Output is correct
24 Correct 14 ms 604 KB Output is correct
25 Correct 15 ms 348 KB Output is correct
26 Correct 57 ms 604 KB Output is correct
27 Correct 62 ms 736 KB Output is correct
28 Execution timed out 1024 ms 1936 KB Time limit exceeded
29 Halted 0 ms 0 KB -