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)
{
map < int, bool > mp;
for(auto it : edges)
mp[it.first] = 1, mp[it.second] = 1;
for(auto it : mp)
{
int X = it.first;
vector < int > V;
V.push_back(X);
if(query(V))
return X;
}
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... |