Submission #1275395

#	Time	Username	Problem	Language	Result	Execution time	Memory
1275395		vibeduck	Jobs (BOI24_jobs)	C++20	0 / 100	50 ms	5244 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()

typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;

const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;

int n, s;
int ans = 0;

struct chain {
    vi v; int ptr;
};

inline void solve() {
    cin >> n >> s;
    vector<chain> vc;
    for (int i = 0; i < n; i++) {
        int x, p;
        cin >> x >> p;
        if (p == 0) {
            chain c;
            c.v = {x};
            c.ptr = 0;
            vc.pb(c);
            continue;
        }
        vc.back().v.pb(x);
    }

    // minimum loss at a point for positive profit
    set<pair<int, pii>> st; // {maxloss, {profit, index}}
    for (int i = 0; i < vc.size(); i++) {
        chain x = vc[i];
        pii tmp = {0, 0}; // {profit, maxloss}
        bool ok = false;
        for (int j = x.ptr; j < x.v.size(); j++) {
            tmp.fi += x.v[j];
            tmp.se = min(tmp.se, tmp.fi);
            x.ptr++;
            if (tmp.fi >= 0) { ok = true; break; } // check this
        }
        if (ok) st.insert({-tmp.se, {tmp.fi, i}});
    }

    while (st.size()) {
        auto cur = *st.begin();
        int ml = cur.fi; int p = cur.se.fi; int i = cur.se.se;
        //cout << ml << " " << p << " " << i << '\n';
        if (ml > s) {
            //cout << "done\n";
            break;
        }

        ans += p;
        // recalculate for that chain
        // vc[i]

        st.erase(cur);
        chain x = vc[i];
        pii tmp = {0, 0};
        bool ok = false;
        for (int j = x.ptr; j < x.v.size(); j++) {
            tmp.fi += x.v[j];
            tmp.se = min(tmp.se, tmp.fi);
            vc[i].ptr++;
            if (tmp.fi >= 0) { ok = true; break; } // check this
        }
        //if (ok) cout << "re-inserted w/ " << -tmp.se << " " << tmp.fi << " " << i << '\n';
       // else cout << "not possible to gain profit anywhere\n";
        if (ok) st.insert({-tmp.se, {tmp.fi, i}});
    }

    cout << ans << '\n';
}

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    //setIO();

    int t = 1;
    if (tc) {
        cin >> t;
    }

    while (t--) {
        solve();
    }
}

Compilation message (stderr)

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:103:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:104:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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