# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1155935 | itaykarny | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<math.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pair<ll, ll>>;
using vvpll = vector<vpll>;
/*
int query(vector<int> t) {
for (auto i : t) {
if (i == 1) {
return 1;
}
}
return 0;
}
*/
vector<bool> vis;
vector<int> node;