Submission #5310983

---

Source Code Expand

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

int main() {
    int n;
    cin >> n;
    map<long long, long long> mp;
    for (int i = 0; i < n; ++i) {
        long long s, c;
        cin >> s >> c;
        auto itr = mp.lower_bound(s);
        long long fir = s, now = s;
        if (itr != mp.begin()) {
            auto tmp = itr;
            --tmp;
            if (tmp->second > fir) {
                fir = tmp->first;
                now = tmp->second;
                mp.erase(tmp);
            }
        }
        while (itr != mp.end()) {
            long long dist = itr->first - now;
            if (dist < c) {
                c -= dist;
                now = itr->second;
                mp.erase(itr++);
            }
            else break;
        }
        now += c;
        cout << now - 1 << '\n';
        mp[fir] = now;
    }
    return 0;
}

Submission Info

Judge Result