#include <iostream>
#include <vector>
#include "grader.h"
using namespace std;
int findEgg(int N, vector<pair<int, int>> bridges) {
for (int i = 1; i <= N - 1; i++) {
if (query({ i }) == 1) return i;
}
return N;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
304 KB |
Number of queries: 15 |
2 |
Incorrect |
3 ms |
296 KB |
Number of queries: 15 |
3 |
Incorrect |
3 ms |
248 KB |
Number of queries: 15 |
4 |
Incorrect |
3 ms |
248 KB |
Number of queries: 15 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
4 ms |
376 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
4 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |