| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 446603 | blue | Easter Eggs (info1cup17_eastereggs) | C++17 | 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 <iostream>
#include <vector>
#include "grader.h"
using namespace std;
const int maxN = 512;
vector<int> edge[1+maxN];
vector<int> order;
vector<int> visit(1+maxN, 0);
void dfs(int u)
{
if(visit[u]) return;
order.push_back(u);
for(int v: edge[u]) dfs(v);
}
int b_search(int a, int b)
{
if(a == b) return order[a];
else
{
int m = (a+b)/2;
vector<int> Q;
for(int i = 0; i <= m; i++) Q.push_back(order[i]);
if(query(Q)) return b_search(a, m);
else return b_search(m+1, b);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int e = 0; e < N-1; e++)
{
edge[ bridges[e].first ].push_back( bridges[e].second );
edge[ bridges[e].second ].push_back( bridges[e].first );
}
dfs(1);
return b_search(0, N-1);
}
