#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 |
1 |
Partially correct |
1 ms |
344 KB |
Number of queries: 16 |
2 |
Partially correct |
1 ms |
344 KB |
Number of queries: 16 |
3 |
Partially correct |
1 ms |
344 KB |
Number of queries: 16 |
4 |
Partially correct |
1 ms |
344 KB |
Number of queries: 16 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
444 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
444 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |