# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
514745 | amukkalir | Easter Eggs (info1cup17_eastereggs) | C++17 | 26 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.
//in repentance and rest is your strenght, in quietness and trust is your salvation
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
#define pb push_back
const int nax = 512;
vector<int> adj[nax+5];
int f[nax+5];
bool vis[nax+5];
int cr = 1;
void bfs() {
queue<int> q;
q.push(1);
while(!q.empty()) {
int u = q.front(); q.pop();
vis[u] = true;
f[cr++] = u;
for(int v : adj[u]) {
if(!vis[v]) q.push(v);
}
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int i=1; i<=N; i++) {
adj[i].clear();
f[i] = 0;
vis[i] = false;
}
cr = 1;
for(int i=0; i<bridges.size(); i++) {
int u = bridges[i].first;
int v = bridges[i].second;
adj[u].pb(v);
adj[v].pb(u);
}
bfs();
int lo = 1, hi = N;
int ans = 0;
while(lo <= hi) {
if(hi == lo+1) {
if(query({f[lo]})) ans = lo;
else ans = hi;
break;
}
int mid = (lo+hi)/2;
vector<int> vec;
for(int i=1; i<=mid; i++) vec.pb(f[i]);
if(query(vec)) {
ans = mid;
hi = mid-1;
} else {
lo = mid+1;
}
}
return f[ans];
}
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... |