제출 #579448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
579448		Lucpp	Two Dishes (JOI19_dishes)	C++17	10 / 100	10086 ms	24868 KiB

dishes

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int MAX = 2e5+2;

ll A[2][MAX], T[2][MAX], P[2][MAX], dp[MAX];
int B[2][MAX];

int main(){
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < 2; i++){
        A[i][0] = P[i][0] = 0;
        for(int j = 1; j <= (i==0?n:m); j++){
            cin >> A[i][j] >> T[i][j] >> P[i][j];
            A[i][j] += A[i][j-1];
        }
    }
    
    for(int i = 0; i < 2; i++){
        B[i][0] = 0;
        int x = (i==0?m:n);
        for(int j = 1; j <= (i==0?n:m); j++){
            if(A[i][j] > T[i][j]) B[i][j] = -1;
            else if(A[i][j]+A[1-i][x] <= T[i][j]) B[i][j] = x;
            else B[i][j] = (int)(upper_bound(A[1-i], A[1-i]+x, T[i][j]-A[i][j])-A[1-i]-1);
        }
    }
    n++;
    B[0][n] = m;
    P[0][n] = 0;

    dp[0] = 0;
    for(int i = 1; i <= n; i++){
        dp[i] = -INF;
        for(int j = 0; j < i; j++){
            if(B[0][j] <= B[0][i]){
                ll val = dp[j];
                for(int k = B[0][j]+1; k <= B[0][i]; k++){
                    if(B[1][k] >= j) val += P[1][k];
                }
                for(int k = j+1; k <= i; k++){
                    if(B[0][k] >= B[0][i]) val += P[0][k];
                }
                dp[i] = max(dp[i], val);
            }
        }
    }
    cout << dp[n] << "\n";
}

• 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