# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
498734 | ahmedfouadnew | Easter Eggs (info1cup17_eastereggs) | C++17 | 27 ms | 368 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"
//#include "grader.cpp"
#define pb push_back
#define f first
#define s second
using namespace std;
vector<int>adj[606];
int n;
vector<int>vv;
void dfs(int u,int p)
{
vv.pb(u);
for(int v:adj[u])
{
if(v==p) continue;
dfs(v,u);
vv.pb(u);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int i=0;i<=N;i++)
{
adj[i].clear();
}
vv.clear();
n=N;
for(int i=0;i<bridges.size();i++)
{
adj[bridges[i].f].pb(bridges[i].s);
adj[bridges[i].s].pb(bridges[i].f);
}
dfs(1,0);
reverse(vv.begin(),vv.end());
int s=0,e=vv.size()-1;
while(s<e)
{
int mid=s+(e-s)/2;
set<int>st;
for(int i=s;i<=e;i++)
{
st.insert(vv[i]);
}
if(st.size()==1) return vv[s];
st.clear();
for(int ii=s;ii<=mid;ii++)
st.insert(vv[ii]);
vector<int>qr(st.begin(),st.end());
if(query(qr))
{
e=mid;
}
else
{
s=mid+1;
}
}
return vv[s];
}
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... |