| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 439478 | Yazan_Alattar | 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 <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
#define endl "\n"
#define F first
#define S second
#define pb push_back
typedef long long ll;
const int M = 530;
const int mod = 1e9+7;
vector <int> adj[M], path;
void dfs(int node, int p)
{
path.pb(node);
for(auto i : adj[node]){
if(i == p) continue;
dfs(i, node);
}
return;
}
int findEgg(int n, vector < pair <int,int> > bridges)
{
for(auto i : bridges){
adj[i.F].pb(i.S);
adj[i.S].pb(i.F);
}
dfs(1, 0);
int l = 0, r = n;
while(l < r){
int mid = (l + r) / 2;
vector <int> v;
for(int i = 0; i < mid; ++i) v.pb(path[i]);
if(query(v)) r = mid;
else l = mid + 1;
}
return l;
}
