| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 456397 | ntabc05101 | Go (COCI16_go) | C++14 | 1 ms | 460 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
#define taskname ""
int main() {
  if (fopen(taskname".inp", "r")) {
    freopen(taskname".inp", "r", stdin);
    freopen(taskname".out", "w", stdout);
  }
  cin.tie(0)->sync_with_stdio(0);
  int n, k, m; cin >> n >> k >> m;
  array<int, 3> a[m];
  for (int i = 1; i <= m; i++) {
    cin >> a[i][0] >> a[i][1] >> a[i][2];
  }
  a[0] = {k, 0, 0};
  sort(a + 1, a + m + 1, [&](auto const& x, auto const& y) {
    return x[1] + x[2] < y[1] + y[2];
  });
  int dp[m + 1][2001];
  for (int i = 0; i <= m; i++) {
    for (int j = 0; j <= 2000; j++) {
      dp[i][j] = -mod;
    }
  }
  dp[0][0] = 0;
  int res = 0;
  for (int i = 1; i <= m; i++) {
    for (int j = 0; j < i; j++) {
      int z = abs(a[i][0] - a[j][0]) + 1;
      for (int k = z; k <= a[i][2]; k++) {
        dp[i][k] = max(dp[i][k], dp[j][k - z] + a[i][1]);
        res = max(res, dp[i][k]);
      }
    }
  }
  cout << res << endl;
  return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
