Submission #269758

#	Time	Username	Problem	Language	Result	Execution time	Memory
269758		Atill83	Easter Eggs (info1cup17_eastereggs)	C++14	100 / 100	27 ms	384 KiB

eastereggs

#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

vector<int> adj[550];
int tin[550];
int tim = 0;

void dfs(int v, int par){
    tin[v] = tim++;
    for(int j: adj[v]){
        if(j != par){
            dfs(j, v);
        }
    }
}


int findEgg (int N, vector < pair < int, int > > bridges)
{
    for(int i = 1; i <= N; i++){
        adj[i].clear();
        tin[i] = -1;
    }

    for(int i = 0; i < N - 1; i++){
        int u = bridges[i].first, v = bridges[i].second;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    tim = 0;
    dfs(1, -1);


    int l = 0, r = N - 1;

    while(l < r){
        int m = (l + r) / 2;
        vector<int> srg;
        for(int i = 1; i <= N; i++){
            if(tin[i] <= m){
                srg.push_back(i);
            }
        }
        if(query(srg)){
            r = m;
        }else{
            l = m + 1;
        }
    }


    for(int j = 1; j <= N; j++){
        if(tin[j] == l){
            return j;
        }
    }


}

Compilation message (stderr)

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:61:1: warning: control reaches end of non-void function [-Wreturn-type]
   61 | }
      | ^

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