# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67733 | tempytemptemp | Easter Eggs (info1cup17_eastereggs) | C++14 | 3 ms | 704 KiB |
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);
bool pos[n+1];
for(int i=1; i<=n; i++) pos[i]=1;
for(int i=0; i<bridges.size(); i++){
if(!pos[bridges[i].first] && !pos[bridges[i].second])
continue;
if(!pos[bridges[i].first]){
if(query({bridges[i].second}))
return bridges[i].second;
else{
pos[bridges[i].second]=0;
continue;
}
}
else if(!pos[bridges[i].second]){
if(query({bridges[i].first}))
return bridges[i].first;
else{
pos[bridges[i].first]=0;
continue;
}
}
if(query({bridges[i].first, bridges[i].second})){
if(query({bridges[i].first}))
return bridges[i].first;
else
return bridges[i].second;
}
else{
pos[bridges[i].first]=pos[bridges[i].second]=0;
}
}
return -1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |