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 <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;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |