제출 #796200

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
796200	2023-07-28 07:44:15	Dan4Life	Two Dishes (JOI19_dishes)	C++17	10 / 100	423 ms	64816 KiB

dishes

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = (int)2e3+10;
const int LINF = (int)2e18;
int n, m;
int dp[mxN][mxN];
int a[2][mxN], s[2][mxN], p[2][mxN], pr[2][mxN];
int32_t main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  cin >> n >> m;
  for(int j : {0,1}){
    for(int i = 1; i <= n; i++){
      cin >> a[j][i] >> s[j][i] >> p[j][i];
      pr[j][i]=pr[j][i-1]+a[j][i];
    }
    swap(n,m);
  }
  for(int i = 0; i <= n; i++)
    for(int j = 0; j <= m; j++)
      dp[i][j] = !!(i|j)*-LINF;
  for(int i = 0; i <= n; i++){
    for(int j = 0; j <= m; j++){
      int tim = pr[0][i]+pr[1][j];
      if(i) dp[i][j] = max(dp[i][j],dp[i-1][j]+(tim<=s[0][i])*p[0][i]);
      if(j) dp[i][j] = max(dp[i][j],dp[i][j-1]+(tim<=s[1][j])*p[1][j]);
    }
  }
  cout << dp[n][m] << "\n";
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 3 / 3
• Subtask 3: 7 / 7
• Subtask 4: 0 / 39
• Subtask 5: 0 / 11
• Subtask 6: 0 / 9
• Subtask 7: 0 / 17
• Subtask 8: 0 / 9