提出 #14759165

---

ソースコード 拡げる

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

typedef long long ll;
template <typename T>
    using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <char cmp = '<'>
    bool icmp(ll a, ll b){ if(cmp=='>') return a > b; else return a < b;}
namespace enhanced_pair{
    typedef pair<ll,ll> pll;
    ostream& operator << (ostream& o, const pll a){
        o<<a.first<<" "<<a.second;
        return o;
    }
    istream& operator >> (istream& i, pll& p){
        i>>p.first>>p.second;
        return i;
    }
    template <char cmp1 = '<', char cmp2 = '<'>
        bool pcmp(pll a, pll b){ return icmp<cmp1> (a.first,b.first) || (a.first==b.first && icmp<cmp2> (a.second,b.second));}
} using namespace enhanced_pair;
const size_t NMAX = 200009;
const ll MOD = 1e9+7;
ll lastbit(ll num){
    return num & -num;
}
ll binPow(ll num, ll p, ll mod = MOD){
    if(!p) return 1;
    ll aux = binPow(num,p/2);
    return aux*aux%mod*(p%2?num:1)%mod;
}

void tc()
{

}
ll sum[NMAX],s=0;
int main()
{
    ll n,m,t=0,cnt=0,x;
    cin>>n>>m>>t;
    for(ll i=0;i<n;i++){
        cin>>x;
        sum[i]=(i?sum[i-1]:0)+x;
        if(sum[i]<=t)
            cnt=max(cnt,i+1);

    }
    for(ll i=0;i<m;i++){
        cin>>x;
        if(s<=t) cnt=max(cnt,i);
        s+=x;
        if(s<=t){
            ll total=i+(upper_bound(sum,sum+n,t-s)-sum)+1;
            cnt=max(cnt,total);
        }
    }
    cout<<cnt;
    return 0;
}

提出情報

ジャッジ結果