DMOJ · 2spooky4me

2spooky4me

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

2spooky4meSorting & searchingSweep lineC++31 lines
Solution055of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Sweep line

The official problem title is 2spooky4me. Its interval spookiness additions and count-below-threshold query match the code's coordinate-compressed sweep.

Sorting & searching

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

cood_compress.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main()
    {
        ios::sync_with_stdio(0);
        cin.tie(0);
        int n, l, s;
        cin >> n >> l >> s;
        vector<pair<long long, long long>> v;
        for (int i = 0, a, b, c; i < n; i++)
        {
            cin >> a >> b >> c;
            v.emplace_back(a, c);
            v.emplace_back(b + 1, -c);
        }
        v.emplace_back(1, 0);
        v.emplace_back(l + 1, 0);
        sort(v.begin(), v.end());
        int cur = 0, prev = 1, ans = 0;
        for (auto &e : v)
        {
            long long pos = e.first;
            if (cur < s && pos > prev)
                ans += pos - prev;
            cur += e.second;
            prev = pos;
        }
        cout << ans << "\n";
    }
        

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.