# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176649 | HaciyevAlik | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
const int mx=600;
vector<int> g[mx];
vector<int> top;
void dfs(int u,int p) {
for(int v:g[u]) {
if(v!=p) dfs(v,u);
}
top.push_back(u);
}
int findEgg(int N,vector<pair<int,int>> bridges){
top.clear();
for(int i=0;i<mx;++i) g[i].clear();
for(int i=0;i<N-1;++i) {
int u=bridges[i].first,v=bridges[i].second;
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1,0);
reverse(top.begin(),top.end());
int l=1,r=N;
while(l<r) {
int mid=(l+r)/2;
vector<int> temp;
for(int i=1;i<=mid;++i) {
temp.push_back(top[i-1]);
}
if(query(temp)) {
r=mid;
} else {
l=mid+1;
}
}
return a[l];
}