#include "permgame.h"
#include <vector>
#include <utility>
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define F(i,L,R) for (int i = L; i < R; i++)
#define FE(i,L,R) for (int i = L; i <= R; i++)
#define FF(i,L,R) for (int i = L; i > R; i--)
#define FFE(i,L,R) for (int i = L; i >= R; i--)
#define ms(a,x) memset(a,x,sizeof(a))
#define ALL(c) (c).begin(),(c).end()
#define SZ(a) sizeof(a)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
int Alice(int m, int e, std::vector<int> u, std::vector<int> v, int n, std::vector<int> p) {
int cnt = 0;
int primer_i = -1;
for(int i = 0; i < n; i++){
if(p[i] == i) cnt++;
else if(primer_i == -1) primer_i = i;
}
vi g[n];
for(int i = 0; i < e; i++){
g[u[i]].pb(v[i]);
g[v[i]].pb(u[i]);
}
int start_idx = -1;
for(int i = 0; i < m; i++){
if(g[i].size() > 2){
return cnt;
}
if(g[i].size() == 1){
start_idx = i;
}
}
vb vis(n, 0);
vi t(m);
int temp = start_idx, last = -1;
bool conn = 0;
for(int i = 0; i < n; i++){
if(p[i] != i && !vis[i]){
int cur = i;
do{
vis[cur] = 1;
t[temp] = cur;
if(g[temp].size() == 1 && last != -1){
int j = Bob(t);
if(p[t[u[j]]] == t[v[j]] || p[t[v[j]]] == t[u[j]]){
swap(p[t[u[j]]], p[t[v[j]]]);
if(p[t[u[j]]] != t[u[j]]){
temp = u[j];
}else{
temp = v[j];
}
}else{
conn = 1;
if(p[t[u[j]]] == primer_i){
temp = u[j];
}else{
temp = v[j];
}
swap(p[t[u[j]]], p[t[v[j]]]);
}
cur = t[temp];
if(p[t[g[temp][0]]] == t[temp]){
last = g[temp][0];
}else{
last = g[temp][1];
}
}
if(g[temp][0] != last){
last = temp;
temp = g[temp][0];
}else{
last = temp;
temp = g[temp][1];
}
cur = p[cur];
}while(cur != primer_i && (conn || cur != i));
conn = 0;
}
}
return max(n - m + 1, cnt);
}
