# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
640167 | 2022-09-13T18:55:26 Z | tvladm2009 | Easter Eggs (info1cup17_eastereggs) | C++14 | 22 ms | 484 KB |
#include <bits/stdc++.h> #include "grader.h" using ll = long long; const int MAX_N = 512; std::vector<int> g[MAX_N + 1], v; void dfs(int u, int p = -1) { v.push_back(u); for (int v : g[u]) { if (v != p) { dfs(v, u); } } } int bsearch() { int l = 0, r = v.size() - 1, sol = -1; while (r - l > 1) { int mid = (l + r) / 2; std::vector<int> tmp; for (int i = 0; i <= mid; i++) { tmp.push_back(v[i]); } if (query(tmp)) { r = mid; sol = mid; } else { l = mid; } } return v[l + 1]; } int findEgg(int n, std::vector<std::pair<int, int>> bridges) { for (int i = 1; i <= n; i++) { g[i].clear(); } for (auto it : bridges) { g[it.first].push_back(it.second); g[it.second].push_back(it.first); } v.clear(); dfs(1); int answer = bsearch(); return answer; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 464 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 328 KB | Number of queries: 8 |
2 | Correct | 13 ms | 348 KB | Number of queries: 9 |
3 | Correct | 21 ms | 344 KB | Number of queries: 9 |
4 | Correct | 15 ms | 356 KB | Number of queries: 9 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 336 KB | Number of queries: 9 |
2 | Correct | 19 ms | 348 KB | Number of queries: 9 |
3 | Runtime error | 5 ms | 484 KB | Execution killed with signal 6 |
4 | Halted | 0 ms | 0 KB | - |