#include <vector>
#include "grader.h"
using namespace std;
typedef pair < int, int > PII;
int findEgg (int n, vector < PII > edges)
{
for(int i = 1; i <= n; ++i)
{
vector < int > V;
V.push_back(i);
if(query(V))
return i;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
2 ms |
256 KB |
Number of queries: 16 |
2 |
Partially correct |
2 ms |
256 KB |
Number of queries: 16 |
3 |
Partially correct |
2 ms |
256 KB |
Number of queries: 16 |
4 |
Partially correct |
2 ms |
256 KB |
Number of queries: 16 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
508 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |