#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <queue>
#include "grader.h"
using namespace std;
int findEgg(int N, vector <pair<int,int>> aristas) {
for (int i = 1; i < N; i++) {
vector<int> vec = {i};
if(query(vec))
return i;
}
return N;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
2 ms |
364 KB |
Number of queries: 15 |
2 |
Partially correct |
2 ms |
364 KB |
Number of queries: 15 |
3 |
Partially correct |
2 ms |
364 KB |
Number of queries: 15 |
4 |
Partially correct |
2 ms |
364 KB |
Number of queries: 15 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
512 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
492 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |