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 <cassert>
#include <algorithm>
#include "grader.h"
using namespace std;
int findEgg(int N, vector < pair < int, int > > bridges);
int query(vector < int > islands);
int findEgg(int n, vector<pair<int,int>>bridges){
assert(n<=16);
vector<int>v;
for(int i=1; i<=n; i++){
v.push_back(i);
}
random_shuffle(v.begin(), v.end());
for(int i=0; i<n; i++){
if(query({v[i]}))
return v[i];
}
return -1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |