# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
918116 | Sputnik123 | Easter Eggs (info1cup17_eastereggs) | C++14 | 0 ms | 0 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 "grader.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> e;
vector <int> adj[700];
void dfs(int node,int par)
{
for(int i:adj[node])
{
if(i==par) continue;
dfs(i,node);
}
}
int findegg(int n,vector<pair<int,int>> bridges)
{
e.clear();
for(int i=0;i<n;i++)
adj[i].clear();
for(pair <int,int> p: bridges)
{
adj[p.first].push_back(p.second);
adj[p.second].push_back(p.first);
}
dfs(1,1);
int l=0,e=r.size()-1;
while (l < r)
{
int mid = (l + r) >> 1;
vector<int> nw;
for (int i = 0; i <= mid; i++) nw.push_back(e[i]);
if (query(nw)) r = mid;
else l = mid + 1;
}
return e[l];
}