Submission #851977

#	Time	Username	Problem	Language	Result	Execution time	Memory
851977		AtabayRajabli	Easter Eggs (info1cup17_eastereggs)	C++11	100 / 100	12 ms	1228 KiB

eastereggs

#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

vector<vector<int>> g;
vector<int> order;

void dfs(int v, int prev)
{
    order.push_back(v);

    for(int i : g[v])
    {
        if(i == prev)continue;

        dfs(i, v);
    }
}
int findEgg (int n, vector < pair < int, int > > bridges)
{
    g.clear();
    order.clear();

    g.resize(n+1);

    for(auto it : bridges)
    {
        int u = it.first, v = it.second;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    order.push_back(0);
    dfs(1, 0);

    int l = 1, r = n;
    while(l < r)
    {
        int mid = (l + r) / 2;

        if(query(vector<int> (order.begin()+1, order.begin() + 1 + mid)))
            r = mid;
        else
            l = mid + 1;
    }
    return order[l];
}

• Subtask 1: 40 / 40
• Subtask 2: 40 / 40
• Subtask 3: 20 / 20