#include "game.h" #include <bits/stdc++.h> #define pb push_back #define fst first #define snd second #define fore(i,a,b) for(int i=a,pao=b;i<pao;++i) #define SZ(x) ((int)x.size()) #define ALL(x) x.begin(),x.end() #define mset(a,v) memset((a),(v),sizeof(a)) #define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0) using namespace std; typedef long long ll; #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; template <typename T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; const int MAXN=1505; int N; bool alc[MAXN]; vector<int>adj[MAXN]; void dfs(int u,pair<int,int>ban){ alc[u]=1; for(auto v:adj[u]){ if(ban==pair<int,int>{v,u}||ban==pair<int,int>{u,v})continue; if(!alc[v]){ dfs(v,ban); } } } void initialize(int n) { N=n; fore(i,0,n)fore(j,0,n){ if(i!=j){ adj[i].push_back(j); } } } //quiero formar un arbol int hasEdge(int u, int v) { mset(alc,0); dfs(0,{u,v}); fore(i,0,N){ if(!alc[i])return 1; } return 0; }