# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
756312 | 2023-06-11T13:31:18 Z | anaduguleanu | Easter Eggs (info1cup17_eastereggs) | C++14 | 214 ms | 131072 KB |
#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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 464 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 214 ms | 131072 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 211 ms | 131072 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |