# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
345978 | ahmet | Easter Eggs (info1cup17_eastereggs) | C++14 | 242 ms | 131076 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"
using namespace std;
#define ref(a,b,c) for(int (a)=(b);(a)<=(c);++(a))
#define rep(a,b) for(int (a)=0;(a)<(b);++(a))
#define ll long long
#define pb push_back
#define mp make_pair
vector <int> v[550];
vector <int> euler;
void dfs(int node,int par){
euler.pb(node);
for(int i=0;i<v[node].size();++i){
int nxt=v[node][i];
if(nxt==par)continue;
dfs(nxt,node);
euler.pb(node);
}
return;
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int i=0;i<N-1;++i){
int x=bridges[i].first;
int y=bridges[i].second;
v[x].pb(y);
v[y].pb(x);
}
dfs(1,0);
int l=0,r=euler.size()-1;
while(l!=r){
int mid=(l+r)/2;
set <int> s;
vector <int > tmp;
for(int i=l;i<=mid;++i)s.insert(euler[i]);
set <int> ::iterator it=s.begin();
for(it=s.begin();it!=s.end();++it)tmp.pb(*it);
if(query(tmp))r=mid;
else l=mid+1;
}
return euler[l];
}
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... |