# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
918257 | vjudge1 | Easter Eggs (info1cup17_eastereggs) | C++17 | 27 ms | 5928 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"
#define ll int
#define vl vector<ll>
#define fi first
#define se second
#define pb push_back
//salam bu 100% menim yeni tahirin kod
using namespace std;
const int sz = 2e5+5;
vl adj[sz];
vl et;
void dfs(ll node, ll p){
et.pb(node);
for(auto edge: adj[node]){
if(edge == p){continue;}
dfs(edge, node);
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
ll i, j;
for(i=0;i<sz;i++){
adj[i].clear();
}
et.clear();
for(i=0;i<bridges.size();i++){
adj[bridges[i].fi].push_back(bridges[i].se);
adj[bridges[i].se].push_back(bridges[i].fi);
}
dfs(1, 0);
ll lo = 0, hi = N-1, mid, best = 0;
while(lo < hi){
mid = (lo + hi) >> 1;
vl t;
for(i = 0; i<=mid; i++){
t.pb(et[i]);
}
if(query(t)){
hi = mid;
}
else{
lo = mid + 1;
}
}
return et[lo];
}
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... |