Submission #789615

#TimeUsernameProblemLanguageResultExecution timeMemory
789615someoneTwo Dishes (JOI19_dishes)C++14
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> #define int long long using namespace std; struct Point { int x, y, val; }; const int M = 1 << 20, N = 2 * M, T = 12, INF = 1e18 + 42; int maxi[N], tag[N]; void applyOp(int i, int add) { tag[i] += add; maxi[i] += add; } void propage(int i) { applyOp(i*2, tag[i]); applyOp(i*2+1, tag[i]); tag[i] = 0; } int update(int i, int deb, int fin, int l, int r, int add) { if(r <= deb || fin <= l) return -INF; if(l <= deb && fin <= r) { applyOp(i, add); return maxi[i]; } propage(i); int mid = ((deb + fin) >> 1), ans = max(update(i*2, deb, mid, l, r, add), update(i*2+1, mid, fin, l, r, add)); maxi[i] = max(maxi[i*2], maxi[i*2+1]); return ans; } vector<Point> point; int score = 0, ans = 0, sz[2], a[2][M], t[2][M], pt[2][M], pos[2][M]; void solve() { score = ans = 0; point.clear(); for(int i = 0; i < N; i++) tag[i] = 0, maxi[i] = -INF; update(1, 0, M, M-1, M, INF); for(int i = 0; i < 2; i++) for(int j = 1; j <= sz[i]; j++) a[i][j] += a[i][j-1]; a[0][sz[0]+1] = a[1][sz[1]+1] = INF; for(int i = 0; i <= sz[0]; i++) for(int j = 0; j <= sz[1]; j++) dp[i][j] = -INF; dp[0][0] = 0; for(int i = 0; i <= sz[0]; i++) for(int j = 0; j <= sz[1]; j++) { if(a[0][i+1] + a[1][j] <= t[0][i+1]) { dp[i+1][j] = max(dp[i+1][j], dp[i][j] + pt[0][i+1]); } else { dp[i+1][j] = max(dp[i+1][j], dp[i][j]); } if(a[0][i] + a[1][j+1] <= t[1][j+1]) { dp[i][j+1] = max(dp[i][j+1], dp[i][j] + pt[1][j+1]); } else { dp[i][j+1] = max(dp[i][j+1], dp[i][j]); } } for(int i = 0; i < 2; i++) for(int j = 1; j <= sz[i]; j++) pos[i][j] = (int)(upper_bound(a[1-i], a[1-i] + sz[1-i] + 1, t[i][j] - a[i][j]) - a[1-i]) - 1; for(int j = 0; j <= sz[0]; j++) if(pos[0][j] != -1) point.push_back({j, pos[0][j], pt[0][j]}); for(int j = 1; j <= sz[1]; j++) { if(pos[1][j] != -1) { score += pt[1][j]; point.push_back({pos[1][j]+1, j-1, -pt[1][j]}); } } sort(point.begin(), point.end(), [](Point p1, Point p2) { if(p1.x == p2.x) { if(p1.y == p2.y) return p1.val > p2.val; return p1.y > p2.y; } return p1.x > p2.x; }); for(Point p : point) { int val = update(1, 0, M, p.y, M, 0); if(p.x == 0 && p.y == 0) ans = val; int pre = update(1, 0, M, p.y, p.y+1, 0); update(1, 0, M, p.y, p.y+1, val - pre); update(1, 0, M, 0, p.y+1, p.val); } cout << ans + score << '\n'; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> sz[0] >> sz[1]; for(int i = 0; i < 2; i++) for(int j = 1; j <= sz[i]; j++) cin >> a[i][j] >> t[i][j] >> pt[i][j]; solve(); }

Compilation message (stderr)

dishes.cpp: In function 'void solve()':
dishes.cpp:55:13: error: 'dp' was not declared in this scope
   55 |             dp[i][j] = -INF;
      |             ^~
dishes.cpp:56:5: error: 'dp' was not declared in this scope
   56 |     dp[0][0] = 0;
      |     ^~