DMOJ · grind

Hardcore Grinding

This C++ solution uses sweep line for DMOJ grind Hardcore Grinding. Read the reasoning, inspect the code, or try your own test case below.

grindData structuresSweep lineC++25 lines
Solution108of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Sweep line

Hardcore Grinding intervals and minimum simultaneous-machine calculation match the sweep/partition logic.

Data structures

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

hardcore_grinding.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        int n;
        cin >> n;
        vector<pair<int, int>> v;
        for(int i = 0; i < n; i++){
            int begin, end;
            cin >> begin >> end;
            v.emplace_back(begin, end);
        }
        priority_queue<int, vector<int>, greater<int>> pq;
        for(auto[s, f] : v){
            if(!pq.empty() && pq.top() <= s){
                pq.pop();
            }
            pq.push(f);
        }
        cout << pq.size() << '\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.