#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
#define ref(a,b,c) for(int (a)=(b);(a)<=(c);++(a))
#define rep(a,b) for(int (a)=0;(a)<(b);++(a))
#define ll long long
#define pb push_back
#define mp make_pair
vector <int> v[550];
vector <int> euler;
void dfs(int node,int par){
euler.pb(node);
for(int i=0;i<v[node].size();++i){
int nxt=v[node][i];
if(nxt==par)continue;
dfs(nxt,node);
// euler.pb(node);
}
return;
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int i=0;i<N-1;++i){
int x=bridges[i].first;
int y=bridges[i].second;
v[x].pb(y);
v[y].pb(x);
}
dfs(1,0);
int l=0,r=euler.size()-1;
int vis[550];
vector <int> tmp;
while(l<r){
tmp.clear();
memset(vis,0,sizeof(vis));
int mid=(l+r)/2;
for(int i=l;i<=mid;++i){
if(vis[euler[i]]==0){tmp.pb(euler[i]);vis[euler[i]]=1;}
}
if(query(tmp))r=mid;
else l=mid+1;
}
return euler[l];
}
Compilation message
eastereggs.cpp: In function 'void dfs(int, int)':
eastereggs.cpp:13:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
13 | for(int i=0;i<v[node].size();++i){
| ~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2 ms |
748 KB |
Execution killed with signal 6 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
492 KB |
Execution killed with signal 6 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
336 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
