Submission #1351883

#	Time	Username	Problem	Language	Result	Execution time	Memory
1351883		KALARRY	Easter Eggs (info1cup17_eastereggs)	C++20	80 / 100	6 ms	496 KiB

eastereggs

//chockolateman

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

using namespace std;

int counter,targ;
vector<int> adj[515];
bool status[512];
vector<int> nodes;
bool marked[512];

void dfs(int v,int p)
{
    if(counter==targ)
        return;
    nodes.push_back(v);
    if(status[v])
        marked[v] = true;
    counter += status[v];
    for(auto u : adj[v])
        if(u != p)
            dfs(u,v);
}

int findEgg (int N, vector < pair < int, int > > bridges)
{
    for(auto x : bridges)
    {
        adj[x.first].push_back(x.second);
        adj[x.second].push_back(x.first);
    }
    for(int i = 1 ; i <= N ; i++)
        status[i] = 1;
    counter = 0;
    int S = N;
    while(S > 1)
    {
        int mid = S/2;
        counter = 0;
        targ = mid;
        dfs(1,1);
        int res = query(nodes);
        if(res)
        {
            S = mid;
            for(int i = 1 ; i <= N ; i++)
                if(!marked[i])
                    status[i] = 0;
        }
        else
        {
            S -= mid;
            for(auto v : nodes)
                status[v] = 0;    
        }
        for(auto v : nodes)
            marked[v] = false;
        nodes.clear();
    }
    for(int i = 1 ; i <= N ; i++)
        adj[i].clear();
    for(int i = 1 ; i <= N ; i++)
        if(status[i])
            return i;
}

Compilation message (stderr)

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

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