Submission #1109238

#	Time	Username	Problem	Language	Result	Execution time	Memory
1109238		the_coding_pooh	Easter Eggs (info1cup17_eastereggs)	C++14	0 / 100	134 ms	131072 KiB

eastereggs

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

#define uwu return

using namespace std;

const int SIZE = 513;

vector <int> graph[SIZE];

#define fs first
#define sc second

void dfs(vector <int>& vertices, int nd, int rt){
    vertices.push_back(nd);
    for(auto i:graph[nd]){
        if(i != rt)
            dfs(vertices, i, nd);
    }
    return;
}

int findEgg (int N, vector <pair<int, int>> bridges){
    for(auto i:bridges){
        graph[i.fs].push_back(i.sc);
        graph[i.sc].push_back(i.fs);
    }
    vector <int> vertices;
    dfs(vertices, 1, 0);
    int L = 0, R = N - 1, M;
    while(L != R){
        vector <int> tmp = vertices;
        M = (L + R) / 2;
        tmp.erase(tmp.begin() + M, tmp.end());
        if(query(tmp))
            R = M;
        else
            L = M + 1;
    }
    return vertices[L];
}

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