Submission #918886

#TimeUsernameProblemLanguageResultExecution timeMemory
918886MoonnEaster Eggs (info1cup17_eastereggs)C++17
0 / 100
1 ms456 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...