Codeforces · 2185D

OutOfMemoryError

This C++ solution uses simulation for Codeforces 2185D OutOfMemoryError. Read the reasoning, inspect the code, or try your own test case below.

2185DArrays & prefix sumsSimulationC++43 lines
Solution156of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

OutOfMemoryError resets the whole array after any update exceeds h; the lazy reset-epoch implementation matches.

Arrays & prefix sums

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

D_OutOfMemoryError.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    void solve() {
         int n, m, h; cin >> n >> m >> h;
         vector<int> old(n), cur(n), upd(n);
         for (int i = 0; i < n; i++) {
            int x; cin >> x;
            old[i] = x; cur[i] = x;
         }
         vector<pair<int,int>> op;
         for (int i = 0; i < m; i++) {
            int pos, val; cin >> pos >> val;
            pos--;
            op.emplace_back(pos, val);
         }
        int update = 1;
        for (auto[pos, val] : op) {
            if (upd[pos] != update) {
                upd[pos] = update;
                cur[pos] = old[pos];
            }
            if (cur[pos] + val > h) {
                update++;
            } else {
                cur[pos] += val;
            }
        }
        for (int i = 0; i < cur.size(); i++) {
            if (upd[i] != update) cout << old[i] << " \n"[i == cur.size() - 1];
            else cout << cur[i] << " \n"[i == cur.size() - 1];
        }
    }
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int t; cin >> t;
        while (t--) {
            solve();
        }
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.