# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096879 | 0pt1mus23 | Easter Eggs (info1cup17_eastereggs) | C++14 | 193 ms | 131072 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 sze = 1e5;
vector<int> graph[sze];
vector<int> path;
void dfs(int node,int par=-1){
path.push_back(node);
for(auto v:graph[node]){
if(v==par){
continue;
}
dfs(v,node);
}
}
int findEgg (int n, vector<pair<int,int>> edges){
int ans=1;
for(auto [k,v]:edges){
graph[k].push_back(v);
graph[v].push_back(k);
}
dfs(1);
int l =0;
int r = n-1;
while(l<=r){
int mid = (l+r)/2;
vector<int> lst;
for(int i=0;i<=mid;i++){
lst.push_back(path[i]);
}
if(query(lst)){
ans=lst.back();
r = mid-1;
}
else{
l = mid+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... |