# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1048801 | Whisper | Easter Eggs (info1cup17_eastereggs) | C++17 | 1 ms | 344 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;
using ll = long long;
int findEgg (int _N, vector<pair<int, int>> bridges){
int N = _N;
vector<vector<int>> G(N + 5);
for (pair<int, int>&x : bridges){
int u = x.first, v = x.second;
G[u].emplace_back(v);
G[v].emplace_back(u);
}
vector<int> minDist(N + 5), rev(N + 5);
queue<int> q;
q.emplace(1);
minDist[1] = 1; rev[1] = 1;
int cnt = 1;
while(q.size()){
int u = q.front(); q.pop();
for (int &v : G[u]){
if (!minDist[v]){
q.emplace(v);
minDist[v] = ++cnt;
rev[minDist[v]] = v;
}
}
}
int l = 1, r = N;
auto check = [&](int x) -> bool{
vector<int> node;
for (int i = 1; i <= N; ++i) if(minDist[i] <= x){
node.emplace_back(x);
}
return query(node);
};
// int ans = 0;
// while (l <= r){
// int m = (l + r) >> 1;
// if(check(m)) ans = m, r = m - 1;
// else l = m + 1;
// }
return 0;
}
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... |