# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259122 | patrikpavic2 | Two Dishes (JOI19_dishes) | C++17 | 232 ms | 49088 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 <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#define PB push_back
using namespace std;
typedef long long ll;
const int N = 2e3 + 50;
const ll INF = 1e18;
ll del[N], mora[N], dp[N][N], S[N], T[N];
int n, m, bio[N][N];
int Q[N], P[N], A[N], B[N];
int SS[N], TT[N];
vector < ll > v, v2;
vector < int > brisi[N];
ll f(int x, int y){
if(x > n || y > m) return -INF;
if(x == n && y == m) return 0;
if(bio[x][y]) return dp[x][y];
dp[x][y] = max(f(x + 1, y) + (SS[x + 1] >= y ? P[x + 1] : 0), f(x, y + 1) + (TT[y + 1] >= x ? Q[y + 1] : 0));
bio[x][y] = 1;
return dp[x][y];
}
int main(){
scanf("%d%d", &n, &m);
for(int i = 1;i <= n;i++)
scanf("%d%lld%d", A + i, S + i, P + i);
for(int i = 1;i <= m;i++)
scanf("%d%lld%d", B + i, T + i, Q + i);
ll cur = 0; v.PB(cur);
for(int i = 1;i <= m;i++)
cur += B[i], v.PB(cur);
cur = 0; v2.PB(cur);
for(int i = 1;i <= n;i++){
cur += A[i]; v2.PB(cur);
if(S[i] < cur)
P[i] = 0, S[i] = cur;
SS[i] = upper_bound(v.begin(), v.end(), S[i] - cur) - v.begin() - 1;
}
cur = 0;
for(int i = 1;i <= m;i++){
cur += B[i];
if(T[i] < cur)
Q[i] = 0, T[i] = cur;
TT[i] = upper_bound(v2.begin(), v2.end(), T[i] - cur) - v2.begin() - 1;
}
printf("%lld\n", f(0, 0));
return 0;
for(int i = 1;i <= m;i++){
del[i] = Q[i], mora[i] = Q[i];
brisi[SS[i]].PB(i);
}
for(int i = 1;i <= n;i++){
del[0] += P[i];
del[TT[i] + 1] = max(del[TT[i] + 1] - P[i], mora[TT[i] + 1]);
for(int j : brisi[i])
mora[j] = -INF;
}
ll ans = 0;
for(int i = 0;i <= m;i++)
ans += del[i];
printf("%lld\n", ans);
}
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... |