# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146001 | sonya | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <vector>
#include <queue>
#include <grader.h>
using namespace std;
vector<int> t;
int used[513];
int mid;
vector<int> v[513];
int check_(int x){
vector<int> p;
for(int i = 0; i <= x; i++){
p.push_back(t[i]);
}
return query(p);
}
void dfs(int beg){
used[beg] = 1;
t.push_back(beg);
for(int i = 0; i < v[beg].size(); i++){
int nb = v[beg][i];
if(!used[nb]){
dfs(nb);
}
}
}