Submission #1216524

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216524		Ahmed_Kaaniche	Two Dishes (JOI19_dishes)	C++20	3 / 100	10090 ms	28480 KiB

dishes

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fi first
#define se second
#define pb push_back
#define endl "\n"
ll n, m;
vector<pair<ll, pair<ll, ll>>> arr1;
vector<pair<ll, pair<ll, ll>>> arr2;


ll solve(ll a, ll b, ll t) {
    ll ans1 = 0, ans2 = 0;
    
    if (a < n) {
        if (t + arr1[a].fi <= arr1[a].se.fi)
            ans1 += arr1[a].se.se;
        ans1 += solve(a + 1, b, t + arr1[a].fi);
    }
    if (b < m) {
        if (t + arr2[b].fi <= arr2[b].se.fi)
            ans2 += arr2[b].se.se;
        ans2 += solve(a , b+1, t + arr2[b].fi);
    }
    
    return max(ans1,ans2);
}


int main() {
    //the booster of input and output
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    
    //the body
    cin >> n >> m;
    arr1.resize(n);
    arr2.resize(m);
    
    for (ll i = 0; i < n; ++i) {
        cin >> arr1[i].fi >> arr1[i].se.fi >> arr1[i].se.se;
    }
    for (ll i = 0; i < m; ++i) {
        cin >> arr2[i].fi >> arr2[i].se.fi >> arr2[i].se.se;
    }
    
    cout << solve(0,0,0) << endl;
    
    return 0;
}

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