# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162695 | cnn008 | Easter Eggs (info1cup17_eastereggs) | C++20 | 296 ms | 196608 KiB |
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> g[515],e;
void dfs(int u, int p){
e.push_back(u);
for(auto v:g[u]) if(v!=p) dfs(v,u);
}
int findEgg(int n, vector <pair <int,int> > bridges){
for(auto [u,v]:bridges){
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1,0);
int l=0,r=n-1,ans=0;
while(l<=r){
int mid=(l+r)>>1;
vector <int> cur;
for(int i=0; i<mid; i++) cur.push_back(e[i]);
if(query(cur)) ans=mid,r=mid-1;
else l=mid+1;
}
return e[ans];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |