| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 744335 | MON | Easter Eggs (info1cup17_eastereggs) | C++14 | 1 ms | 512 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 <vector>
#include<cassert>
#include "grader.h"
using namespace std;
vector<int> e,vecini[513];
void dfs(int a = 1,int p = -1)
{
e.emplace_back(a);
for(auto &it : vecini[a])
if(it != p) dfs(it,a);
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int i = 1; i <= N ; i++) vecini[i].clear();
e.clear(); e.emplace_back(0);
for(auto &it : bridges)
{
vecini[it.first].emplace_back(it.second);
vecini[it.second].emplace_back(it.first);
}
dfs(1,-1);
assert(e.size() == N + 1);
int ans = 0,pas = 1; while(pas <= N) pas *= 2;
for(; pas ; pas >>= 1)
{
if(ans + pas >= N) continue;
if(!query(vector<int>(e.begin() + 1,e.begin() + 1 + (ans + pas)))) ans += pas;
}
return 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... | ||||
