제출 #1170919

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170919		Zbyszek99	Two Dishes (JOI19_dishes)	C++20	10 / 100	138 ms	31940 KiB

dishes

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define vi vector<int>
#define vl vector<long long>
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

ll dp[2001][2001];
ll D[2001][2];
ll T[2001][2];
ll C[2001][2];
ll pref_time[2001][2];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int n,m;
    cin >> n >> m;    
    rep(i,n+1) rep(j,m+1) dp[i][j] = -1e18;
    ll cur_sum = 0;
    rep2(i,1,n)
    {
        cin >> D[i][0] >> T[i][0] >> C[i][0];
        cur_sum += D[i][0];
        pref_time[i][0] = cur_sum;
    }
    cur_sum = 0;
    rep2(i,1,m)
    {
        cin >> D[i][1] >> T[i][1] >> C[i][1];
        cur_sum += D[i][1];
        pref_time[i][1] = cur_sum;
    }
    dp[0][0] = 0;
    rep(i,n+1)
    {
        rep(j,m+1)
        {
            if(i != n)
            {
                dp[i+1][j] = max(dp[i+1][j],dp[i][j] + (pref_time[i+1][0] + pref_time[j][1] <= T[i+1][0] ? C[i+1][0] : 0));
            }
            if(j != m)
            {
                dp[i][j+1] = max(dp[i][j+1],dp[i][j] + (pref_time[i][0] + pref_time[j+1][1] <= T[j+1][1] ? C[j+1][1] : 0));
            }
        }
    }
    cout << dp[n][m] << "\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