# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
412765 | aris12345678 | Easter Eggs (info1cup17_eastereggs) | C++14 | 2 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.
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
const int mxN = 515;
vector<int> adj[mxN];
int euler[mxN];
void dfs(int u, int p, int cnt = 0) {
euler[cnt++] = u;
for(auto &v : adj[u]) {
if(v == p) continue;
dfs(v, u);
}
}
int findEgg(int n, vector<pair<int, int> > bridges) {
for(int i = 1; i <= n; i++)
adj[i].clear();
for(int i = 1; i < n; i++) {
adj[bridges[i].first].push_back(bridges[i].second);
adj[bridges[i].second].push_back(bridges[i].first);
}
dfs(1, 0);
int st = 1, en = n, md, ans;
while(st <= en) {
md = (st+en)/2;
vector<int> check;
for(int i = st; i <= md; i++)
check.push_back(euler[i]);
if(query(check)) {
en = md-1;
ans = md;
} else {
st = md+1;
}
}
return 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... |