Submission #851967

#	Time	Username	Problem	Language	Result	Execution time	Memory
851967		AtabayRajabli	Easter Eggs (info1cup17_eastereggs)	C++17	0 / 100	2 ms	504 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, vector<int> &order, vector<vector<int>> &g)
{
    order.push_back(v);

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

        dfs(i, v, order, g);
    }
}

int query(vector < int > islands);

int findEgg(int n, vector<pair<int, int>> bridges)
{
    g.clear();
    order.clear();
    g.resize(n+1);

    for(auto &[u, v] : bridges)
    {
        g[u].push_back(v);
        g[v].push_back(u);
    }

    dfs(1, 0, order, g);

    int l = 0, r = n-1;
    while(l <= r)
    {
        int mid = (l + r) >> 1;

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

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