Submission #1186541

#	Time	Username	Problem	Language	Result	Execution time	Memory
1186541		Ahmed_Kaaniche	Two Dishes (JOI19_dishes)	C++20	5 / 100	106 ms	19016 KiB

dishes

#include <bits/stdc++.h>

using namespace std;
#define endl "\n"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pob pop_back


int main() {
    //the booster of input and output :
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    
    //the body :
    ll n, m;
    cin >> n >> m;
    vector<ll> arr1(n);
    vector<ll> l1(n);
    vector<ll> s1(n);
    vector<ll> arr2(m);
    vector<ll> l2(m);
    vector<ll> s2(m);
    vector<ll> ans1(n,-1);
    vector<ll> pref1(n);
    vector<ll> scr1(n,0);
    vector<ll> ans2(m,-1);
    vector<ll> pref2(m);
    vector<ll> scr2(m,0);
    
    for (int i = 0; i < n; ++i) {
        cin >> arr1[i] >> l1[i] >> s1[i];
        pref1[i] = arr1[i];
        if (i > 0){
            pref1[i] += pref1[i - 1];
            scr1[i] = scr1[i - 1];
        }
        
        if(pref1[i]<=l1[i])
            scr1[i] += s1[i];
    }
    for (int i = 0; i < m; ++i) {
        cin >> arr2[i] >> l2[i] >> s2[i];
        pref2[i] = arr2[i];
        if (i > 0){
            pref2[i] += pref2[i - 1];
            scr2[i] = scr2[i - 1];
        }
    
        if(pref2[i]<=l2[i])
            scr2[i] += s2[i];
    }
    
    for (int i = 0; i < n; ++i) {
        if(pref1[i]>l1[i])
            continue;
        ans1[i]=scr1[i];
        
        ll x=l1[i]-pref1[i];
        auto ptr= upper_bound(pref2.begin(), pref2.end(),x);
        if(ptr==pref2.begin())
            continue;
        ll idx=prev(ptr)-pref2.begin();
        
        ans1[i]+=scr2[idx];
    }
    for (int i = 0; i < m; ++i) {
        if(pref2[i]>l2[i])
            continue;
        ans2[i]=scr2[i];
        
        ll x=l2[i]-pref2[i];
        auto ptr= upper_bound(pref1.begin(), pref1.end(),x);
        if(ptr==pref1.begin())
            continue;
        ll idx=prev(ptr)-pref1.begin();
        
        ans2[i]+=scr1[idx];
    }
    
    ll res=-1;
    for (int i = 0; i < n; ++i) {
//        cout << ans1[i] << ' ';
        res=max(res,ans1[i]);
    }
//    cout << endl;
    for (int i = 0; i < m; ++i) {
//        cout << ans2[i] << ' ';
        res=max(res,ans2[i]);
    }
//    cout << endl;
    
    cout << res << endl;
    
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 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