# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1139535 | Agageldi | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 600005
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
ll a[N], t,answer, vis[N];
vector <int> v[N];
int query(vector <int> islands) {
bool ans;
for(auto i : islands) {
cout << i << ' ';
}
cout << endl;
cin >> ans;
return ans;
}
void solve(int x) {
if(answer) return;
vis[x] = 1;
vector <int> b;
b.pb(x);
int find = query(b);
if(find) {
answer = x;
return;
}
for(auto i : v[x]){
if(vis[i]) continue;
solve(i);
}
b.clear();
}
int findEgg(int n, vector<pair<int,int>> bridges) {
for(auto i : bridges) {
v[i.ff].pb(i.ss);
v[i.ss].pb(i.ff);
}
answer = 0;
solve(1);
return answer;
}