# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
692453 | MateiKing80 | Easter Eggs (info1cup17_eastereggs) | C++14 | 21 ms | 476 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;
vector<int>v[513];
vector<int>ord;
void dfs (int nod, int tata)
{
ord.push_back(nod);
for (int i=0;i<v[nod].size();i++)
{
if (v[nod][i] == tata)
continue;
dfs(v[nod][i], nod);
}
}
int findEgg(int n, vector < pair < int, int > > bridges)
{
for (int i=0;i<n-1;i++)
{
v[bridges[i].first].push_back(bridges[i].second);
v[bridges[i].second].push_back(bridges[i].first);
}
dfs(1, 0);
int l=1, r=n;
while (l < r)
{
int mid = (l + r) / 2;
vector<int>acm;
for (int i=0; i<mid; i++)
acm.push_back(ord[i]);
if (query(acm))
r = mid;
else
l = mid + 1;
}
int ans = ord[r-1];
for (int i=1; i<=n; i++)
v[i].clear();
ord.clear();
return ans;
}
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... |