# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
412402 | aris12345678 | Easter Eggs (info1cup17_eastereggs) | C++14 | 1 ms | 456 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int mxN = 515;
int query(vector<int>);
int findEgg(int n, vector<pair<int, int> > bridges) {
int st = 1, en = n, md, ans;
while(st <= en) {
md = (st+en)/2;
vector<int> left, right;
for(int i = st; i <= md; i++)
left.push_back(i);
for(int i = md+1; i <= en; i++)
right.push_back(i);
if(query(left)) {
if(left.size() == 1)
ans = left[0];
en = md-1;
} else {
if(right.size() == 1)
ans = right[0];
st = md+1;
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |