DMOJ · seed2

Uneven Sand

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

seed2Sorting & searchingBinary searchC++24 lines
Solution231of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Binary search

Uneven Sand matches the interactive FLOATS/SINKS/OK protocol and binary search.

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

uneven_sand.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        long long hi = 2 * 1e9, low = 1;
        while(low <= hi){
            long long mid = low + (hi - low) / 2;
            cout << mid << endl;
            string inst;
            cin >> inst;
            if(inst == "FLOATS"){
                hi = mid - 1;
            }
            else if (inst == "SINKS"){
                low = mid + 1;
            } else {
                exit(0);
            }
        }
        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.