# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
872054 | MON | Easter Eggs (info1cup17_eastereggs) | C++14 | 12 ms | 476 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<iostream>
#include<vector>
using namespace std;
int query(vector<int> islands);
vector<int> vecini[513]; vector<int> v = {0};
void dfs(int a,int p = -1)
{
v.emplace_back(a);
for(auto &it : vecini[a])
if(it != p) dfs(it,a);
}
vector<int> get(int p)
{
vector<int> g;
for(int i = 1; i <= p ; i++) g.emplace_back(v[i]);
return g;
}
int findEgg(int N, vector<pair<int,int>> bridges)
{
for(int i = 1; i <= 512; i++) vecini[i].clear(); v.clear(); v.emplace_back(0);
for(auto &it : bridges) vecini[it.first].emplace_back(it.second),vecini[it.second].emplace_back(it.first);
dfs(1); int n = N;
int pas = 1, ans = 0; while(pas <= n) pas <<= 1;
for(; pas ; pas >>= 1)
if(ans + pas < n) ans += pas * (1 ^ query(get(ans+pas)));
return v[ans + 1];
}
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... |