| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 522171 | blue | Easter Eggs (info1cup17_eastereggs) | C++17 | 1 ms | 456 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 <vector>
#include "grader.h"
using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;
const int mx = 512;
vi edge[1+mx];
// vi ord(1, 0);
void dfs(int u, int p)
{
// ord.push_back(u);
for(int v : edge[u])
{
if(v != p)
dfs(v, u);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(pii b: bridges)
{
edge[b.first].push_back(b.second);
edge[b.second].push_back(b.first);
}
dfs(1, 0);
// int lo = 1, hi = N;
// while(lo != hi)
// {
// int mid = (lo+hi)/2;
// vi qr;
// for(int i = 1; i <= mid; i++)
// qr.push_back(ord[i]);
// if(query(qr))
// hi = mid;
// else
// lo = mid+1;
// }
// return ord[lo];
}
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... | ||||
