oj.uz

Submission #918886

# Submission time Handle Problem Language Result Execution time Memory
918886 2024-01-30T16:22:40 Z Moonn Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
 1 ms 456 KB 
#include <vector>
using namespace std;

int query(vector<int> islands);

int findEgg(int N, vector<pair<int, int>> bridges) {
    // Binary search-like approach
    int left = 1, right = N;
    
    while (left < right) {
        int mid = (left + right) / 2;
        vector<int> queryIslands;
        for (int i = 1; i <= mid; ++i)
            queryIslands.push_back(i);
        
        if (query(queryIslands)) // If egg found in left half
            right = mid;
        else // If egg found in right half
            left = mid + 1;
    }
    
    // At this point, left == right and represents the island where the egg is hidden
    return left;
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 444 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 444 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 456 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -