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 <bits/stdc++.h>
#include "grader.h"
using namespace std;
int findEgg (int N, vector <pair<int,int>> bridges)
{
if (query({bridges[0].first, bridges[0].second}) == 1){
if (query({bridges[0].first}) == 1){
return bridges[0].first;
} else{
return bridges[0].second;
}
} else{
for (int i = 1; i<=N-1; i++){
if (i == bridges[0].first || i == bridges[0].second) continue;
if (query({i}) == 1){
return i;
}
}
}
return N;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |