| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1336978 | michael12 | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include "grader.h"
#include<bits/stdc++.h>
#define endl '\n'
#define ff first
#define ss second
using namespace std;
constexpr int oo = 1e18;
const int maxn = 5e5 + 5;
vector<int> s;
vector<int> adj[maxn];
vector<int> all;
void dfs(int u, int p){
all.push_back(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 = 0; i < bridges.size(); i++){
adj[bridges[i].ff].push_back(bridges[i].ss);
adj[bridges[i].ss].push_back(bridges[i].ff);
}
dfs(1, - 1);
vector<int> st;
for(int i = 0; i < all.size(); i++){
st.push_back(all[i]);
if(query(st)){
return all[i];
}
}
}
