# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97697 | 2019-02-17T18:09:29 Z | KLPP | Easter Eggs (info1cup17_eastereggs) | C++14 | 3 ms | 560 KB |
#include <bits/stdc++.h> #include "grader.h" using namespace std; typedef pair<int,int> pii; vector<int> nei[1000]; vector<int> order; bool b[1000]; void DFS(int u){ order.push_back(u); for(int i=0;i<nei[u].size();i++){ int v=nei[u][i]; if(!b[v]){ b[v]=true; DFS(v); } } } int findEgg (int N, vector < pair < int, int > > bridges) { int n=N; for(int i=0;i<bridges.size();i++){ nei[bridges[i].first-1].push_back(bridges[i].second-1); nei[bridges[i].second-1].push_back(bridges[i].first-1); } for(int i=0;i<n;i++)b[i]=false; b[0]=true; DFS(0); /*for(int i=0;i<n;i++){ vector<int> v; v.push_back(i+1); if(query(v))return i+1; }*/ //for(int i=0;i<n;i++)cout<<dist[i].second<<endl; int lo=0; int hi=n; while(hi-lo>1){ int mid=(hi+lo)/2; vector<int> v; for(int i=0;i<mid;i++)v.push_back(order[i]+1); if(query(v)){ hi=mid; }else lo=mid; } /*for(int i=0;i<n;i++){ vector<int> v; v.push_back(i+1); if(query(v))return i+1; }*/ return lo+1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 480 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 560 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |