# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
266296 | dolphingarlic | Two Dishes (JOI19_dishes) | C++14 | 10029 ms | 26360 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>
typedef long long ll;
using namespace std;
ll a[200001], b[200001], s[200001], t[200001], p[200001], q[200001];
ll dp[2][200001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> s[i] >> p[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= m; i++) {
cin >> b[i] >> t[i] >> q[i];
b[i] += b[i - 1];
}
for (int i = 1; i <= m; i++) dp[0][i] = dp[0][i - 1] + q[i] * (b[i] <= t[i]);
for (int i = 1; i <= n; i++) {
dp[i & 1][0] = dp[i - 1 & 1][0] + p[i] * (a[i] <= s[i]);
for (int j = 1; j <= m; j++) {
dp[i & 1][j] = max(dp[i - 1 & 1][j] + p[i] * (a[i] + b[j] <= s[i]),
dp[i & 1][j - 1] + q[j] * (a[i] + b[j] <= t[j]));
}
}
cout << dp[n & 1][m];
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |