Submission #756313

#	Time	Username	Problem	Language	Result	Execution time	Memory
756313		anaduguleanu	Easter Eggs (info1cup17_eastereggs)	C++14	87 / 100	16 ms	364 KiB

eastereggs

#include <bits/stdc++.h>
#include "grader.h"
#define MAX 512
using namespace std;
vector <int> graph[MAX + 10];
vector <int> nodes;
void dfs(int node, int parent)
{
    nodes.push_back(node);
    for (auto next : graph[node])
        if (next != parent)
            dfs(next, node);
}
int check(int pos)
{
    vector <int> nodesQuery;
    for (int i = 1; i <= pos; i++)
        nodesQuery.push_back(nodes[i]);
    return query(nodesQuery);
}
int findEgg (int N, vector <pair <int, int>> bridges)
{
    for (int i = 1; i <= N; i++)
        graph[i].clear();
    nodes.clear();
    for (auto it : bridges)
    {
        graph[it.first].push_back(it.second);
        graph[it.second].push_back(it.first);
    }
    nodes.push_back(0);
    dfs(1, -1);
    int left = 1;
    int right = nodes.size() - 1;
    int ans;
    while (left <= right)
    {
        int mid = (left + right) / 2;
        if (check(mid) == 1)
        {
            right = mid - 1;
            ans = mid;
        }
        else
            left = mid + 1;
    }
    return nodes[ans];
}

Compilation message (stderr)

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:47:21: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   47 |     return nodes[ans];
      |                     ^

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