Submission #1129379

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129379		kirakosyan	Jobs (BOI24_jobs)	C++20	0 / 100	53 ms	9140 KiB

Main

#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<random>
#include<cmath>
#include<stack>
#include<map>
#include <iomanip>
#include <queue>
#include <set>
using namespace std;
using ll = long long;
using ull = unsigned long long;
ll mod = 1e9 + 7;
ll pv(ll a, ll b) {
	if (b == 0)return 1;
	ll res = (pv(a, b / 2));
	if (b % 2) {
		return (((res * res) % mod) * (a % mod)) % mod;
	}
	else {
		return (res * res) % mod;
	}
}
ll gcd(ll a, ll b) {
	while (b) {
		a %= b;
		swap(a, b);
	}
	return a;
}
void solve() {
    ll n,s1; cin >> n >> s1;
    vector<ll>s(n),p(n);
    for(ll i=0;i<n;i++){
        cin >> s[i] >> p[i];
    }
    vector<ll>v;
    ll sum=0,ans=0;
    for(ll i=0;i<n;i++){
        if(p[i]!=0){
            sum+=s[i];
           v.push_back(s[i]); 
        }
        else{
            ll sum=0,mx=0,mn=1e18;
            for(ll j=0;j<v.size();j++){
                sum+=v[j];
                mn=min(mn,sum);
                if(s1+mn>=0){
                    mx=max(mx,sum);
                }
            }
            ans+=mx;
            v.clear();
            v.push_back(s[i]);
            sum=s[i];
        }
    }
    if(v.size()){
            ll sum=0,mx=0,mn=1e18;
            for(ll j=0;j<v.size();j++){
                sum+=v[j];
                mn=min(mn,sum);
                if(s1+mn>=0){
                    mx=max(mx,sum);
                }
            }
            ans+=mx;
    }
    cout<<ans<<endl;
	
	

}

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll _ = 1;
// 	cin >> _;
	while (_--) {
		solve();
	}
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 29
• Subtask 5: 0 / 31