# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
974892 | 2024-05-04T06:29:10 Z | AliHasanli | Easter Eggs (info1cup17_eastereggs) | C++17 | 230 ms | 131072 KB |
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int>dfsorder; vector<int>g[600]; void dfs(int source,int p) { dfsorder.push_back(source); for(int i=0;i<g[source].size();i++) if(g[source][i]!=p)dfs(g[source][i],source); } int findEgg (int N,vector<pair<int,int> >bridges) { for(int i=0;i<N-1;i++) { g[bridges[i].first].push_back(bridges[i].second); g[bridges[i].second].push_back(bridges[i].first); } dfs(1,0); int l=1,r=N; int ans=0,mid; while(l<=r) { mid=(l+r)/2; if(query(vector<int>(dfsorder.begin(),dfsorder.begin()+mid))) r=mid-1,ans=mid; else l=mid+1; } return dfsorder[ans]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 456 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 230 ms | 131072 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 184 ms | 131072 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |