# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1070964 | raduv | 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 <bits/stdc++.h>
const int MAXN = 512;
using namespace std;
vector<int> adj[MAXN + 1];
vector<int> islands;
bitset <MAXN + 1> frecv;
void dfs(int node){
frecv[node] = 1;
islands.push_back(node);
for(auto n : adj[node] ){
if(!frecv[n])
dfs(n);
}
}
int findEgg(int n, vector<pair<int, int>> bridges){
int i, st, dr, mij;
frecv.reset();
for( i = 0; i <= MAXN; i++ )
adj[i].clear();
islands.clear();
for( auto [u, v] : bridges ){
adj[u].push_back(v);
adj[v].push_back(u);
}
st = 0;
dr = n;
while(dr - st > 1){
mij = (dr + st) / 2;
vector <int> qry;
for( i = 0; i < mij; i++ ){
qry.push_back(islands[i]);
}
if(query(qry))
dr = mij;
else
st = mij;
}
return st;
}