제출 #708222

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
708222		alvingogo	Two Dishes (JOI19_dishes)	C++14	10 / 100	708 ms	1048576 KiB

dishes

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;

signed main(){
    AquA;
    int n,m;
    cin >> n >> m;
    vector<vector<int> > dp(n+1,vector<int>(m+1,-1));
    vector<int> a(n+1),b(m+1),s(n+1),t(m+1),p(n+1),q(m+1);
    for(int j=1;j<=n;j++){
        cin >> a[j] >> s[j] >> p[j];
        a[j]+=a[j-1];
    }
    for(int j=1;j<=m;j++){
        cin >> b[j] >> t[j] >> q[j];
        b[j]+=b[j-1];
    }
    dp[0][0]=0;
    for(int i=0;i<=n;i++){
        for(int j=0;j<=m;j++){
            if(i){
                dp[i][j]=max(dp[i][j],dp[i-1][j]+((a[i]+b[j])<=s[i]));
            }
            if(j){
                dp[i][j]=max(dp[i][j],dp[i][j-1]+((a[i]+b[j])<=t[j]));
            }
        }
    }
    cout << dp[n][m] << "\n";
    return 0;
}

• 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