| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 744341 | MON | Easter Eggs (info1cup17_eastereggs) | C++14 | 1 ms | 464 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<iostream>
#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();
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);
int st = 0,dr = N - 1,ans = -1;
while(st <= dr)
{
int mid = st + (dr - st) / 2;
if(query(vector<int>(e.begin(),e.begin() + mid)))
{
ans = mid;
dr = mid - 1;
}
else st = mid + 1;
}
return e[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... | ||||
