# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332563 | codemaster111 | Easter Eggs (info1cup17_eastereggs) | C++14 | 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 <bits/stdc++.h>
#include "grader.h"
using namespace std;
#define pb push_back
#define f first
#define s second
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define trav(i, x) for(auto& i:x)
const int mx = 550;
vector<int> adj[mx], ans;
void dfs(int i, int p) {
ans.pb(i);
trav(u, adj[i]) {
if (u != p)
dfs(u);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
FOR(i, 0, mx)
adj[i].clear();
trav(ii, bridges)
adj[ii.f].pb(ii.s), adj[ii.s].pb(ii.f);
dfs(1, 0);
//2^9=512
// bin search on search vector for ans
int lo = 0, hi = ans.size()-1;
while (lo < hi) {
int mid = (lo+hi)/2;
vector<int> cur(ans.begin(), ans.begin()+mid);
if (query(cur))
hi = mid;
else
lo = mid+1;
}
}