| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 362000 | keta_tsimakuridze | 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 <bits/stdc++.h>
//#include "grader.h"
#define f first
#define s second
using namespace std;
const int N=505;
int sz[N],par[N],fix[N],n,Egg[N],cnt,ind[N],timer,ans;
vector<int>v,V[N];
bool query(vector<int> v){
for(int i=0;i<v.size();i++){
if(Egg[v[i]]) return 1;
}
return 0;
}
int dfs(int u,int p){
timer++;
ind[timer]=u;
for(int i=0;i<V[u].size();i++){
if(V[u][i]==p) continue;
dfs(V[u][i],u);
}
}
int findEgg (int n1, vector < pair < int, int > > b)
{
n=n1;
for(int i=1;i<=n;i++)V[i].clear();
for(int i=0;i<b.size();i++){
V[b[i].f].push_back(b[i].s);
V[b[i].s].push_back(b[i].f);
}
dfs(1,0);
ans=ind[n];
int l=1,r=n-1;
while(l<=r){
int mid=(l+r)/2;
v.clear();
for(int i=1;i<=mid;i++){
v.push_back(ind[i]);
}
if(query(v)){
ans=ind[mid];
r=mid-1;
}
else l=mid+1;
}
return ans;
}
