# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096881 | 2024-10-05T10:34:46 Z | 0pt1mus23 | Easter Eggs (info1cup17_eastereggs) | C++14 | 196 ms | 131072 KB |
#include <bits/stdc++.h> #include "grader.h" using namespace std; const int sze = 600; vector<int> graph[sze]; vector<int> path; void dfs(int node,int par=-1){ path.push_back(node); for(auto v:graph[node]){ if(v==par){ continue; } dfs(v,node); } } int findEgg (int n, vector<pair<int,int>> edges){ int ans=1; for(auto [k,v]:edges){ graph[k].push_back(v); graph[v].push_back(k); } dfs(1); int l =0; int r = n-1; vector<int> lst; while(l<=r){ int mid = (l+r)/2; lst.clear(); for(int i=0;i<=mid;i++){ lst.push_back(path[i]); } if(query(lst)){ ans=lst.back(); r = mid-1; } else{ l = mid+1; } } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 196 ms | 131072 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 161 ms | 131072 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 147 ms | 131072 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |