#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- template class UF { public: vector par,rank,cnt; UF() {par=rank=vector(um,0); cnt=vector(um,1); for(int i=0;irank[y]) return par[x]=y; rank[x]+=rank[x]==rank[y]; return par[y]=x; } }; UF<101010> VC,FC; map,int> F; int nex; int N,M; vector E[505]; void dfs(int from,int to) { if(F.count({from,to})) return; F[{from,to}]=nex; int n=lower_bound(ALL(E[to]),from+N)-E[to].begin(); n--; n=E[to][n]%N; dfs(to,n); } void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>M; FOR(i,N) { E[i].push_back((i+1)%N); E[(i+1)%N].push_back(i); } FOR(i,M) { cin>>x>>y; E[x-1].push_back(y-1); E[y-1].push_back(x-1); } FOR(i,N) { FORR(e,E[i]) { VC(2*i,2*e+1); VC(2*e,2*i+1); } sort(ALL(E[i])); x=E[i].size(); FOR(j,2*x) E[i].push_back(E[i][j]+N); } /* if(VC[0]==VC[1]) { cout<<5<