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>
#include "grader.h"
using namespace std;
using ll = long long;
#define F first
#define S second
int findEgg (int n, vector < pair < int, int > > z){
ll ans = -1;
for (int i = 1; i <= n; ++i){
ll k = query({i});
if (k == 1){
ans = i;
break;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |