DMOJ · seed3

Battle Positions

This C++ solution uses simulation for DMOJ seed3 Battle Positions. Read the reasoning, inspect the code, or try your own test case below.

seed3Implementation & simulationSimulationC++19 lines
Solution027of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Battle Positions matches range troop additions over I positions and counting positions below the required troop level.

Implementation & simulation

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

battle_positions.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    int I, N, J, cnt = 0;
    int main(){
        ios::sync_with_stdio(0); cin.tie(0);
        cin >> I >> N >> J;
        vector<int> v(I + 1), psa(I + 1);
        for(int i = 0; i < J; i++){
            int x, y, z;
            cin >> x >> y >> z;
            v[x] += z; v[y + 1] -= z;
        }
        for(int i = 1; i < v.size(); i++){
            psa[i] = psa[i - 1] + v[i];
            if(psa[i] >= N) cnt++;
        }
        cout << I - cnt << '\n';
        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.