DMOJ · cco11p4

Reorganization

This C++ solution uses binary search for DMOJ cco11p4 Reorganization. Read the reasoning, inspect the code, or try your own test case below.

cco11p4Implementation & simulationBinary searchC++25 lines
Solution171of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Binary search

Reorganization matches the hierarchy-capacity input and the implementation's feasibility traversal.

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

P_4_Reorganization.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n, r; cin >> n >> r;
        map<int, int> p;
        p[r] = 0;
        for (int i = 1; i < n; i++) {
            cin >> r;
            auto it = p.lower_bound(r);
            if (it == p.begin()) {
                cout << "NO" << '\n';
                return 0;
            }
            --it;
            p[r] = 0;
            p[it->first]++;
            if (p[it->first] == 2) p.erase(it);
        }
        cout << "YES" << '\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.