Submission #756312

#TimeUsernameProblemLanguageResultExecution timeMemory
756312anaduguleanuEaster Eggs (info1cup17_eastereggs)C++14
0 / 100
214 ms131072 KiB
#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 (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:44:21: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |     return nodes[ans];
      |                     ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...