版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。
https://cn.vjudge.net/problem/Gym-101853B
要判断x是否素数优化;
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e6+9;
const int maxm=3e6+9;
const int mod=1e9+7;
struct E
{
int to,nex,cap,flow;
}edge[maxm];
int head[maxn];
int tot;
int gap[maxn],dep[maxn],cur[maxn];
int n;
void init()
{
tot=0;
mem(head,-1);
}
void addedge(int u,int v,int w,int rw=0)
{
edge[tot].to=v;
edge[tot].cap=w;
edge[tot].flow=0;
edge[tot].nex=head[u];
head[u]=tot++;
edge[tot].to=u;
edge[tot].cap=rw;
edge[tot].flow=0;
edge[tot].nex=head[v];
head[v]=tot++;
}
int Q[maxn];
void bfs(int st,int ed)
{
//mem(dep,-1);
//mem(gap,0);
for(int i=0;i<=n+1;i++) dep[i]=-1,gap[i]=0;
gap[0]=1;
int fr=0,re=0;
dep[ed]=0;
Q[re++]=ed;
while(fr!=re)
{
int u=Q[fr++];
for(int i=head[u];i!=-1;i=edge[i].nex)
{
int v=edge[i].to;
if(dep[v]!=-1) continue;
Q[re++]=v;
dep[v]=dep[u]+1;
gap[dep[v]]++;
}
}
}
int S[maxn];
int sap(int st,int ed,int n)
{
bfs(st,ed);
//memcpy(cur,head,sizeof(head));
for(int i=0;i<tot;i++) cur[i]=head[i];
int top=0;
int u=st;
int ans=0;
while(dep[st]<n)
{
if(u==ed)
{
int Min=INF;
int inser;
for(int i=0;i<top;i++)
{
if(Min>edge[S[i]].cap-edge[S[i]].flow)
{
Min=edge[S[i]].cap-edge[S[i]].flow;
inser=i;
}
}
for(int i=0;i<top;i++)
{
edge[S[i]].flow+=Min;
edge[S[i]^1].flow-=Min;
}
ans+=Min;
top=inser;
u=edge[S[top]^1].to;
continue;
}
bool flag=false;
int v;
for(int i=cur[u];i!=-1;i=edge[i].nex)
{
v=edge[i].to;
if(edge[i].cap-edge[i].flow&&dep[v]+1==dep[u])
{
flag=true;
cur[u]=i;
break;
}
}
if(flag)
{
S[top++]=cur[u];
u=v;
continue;
}
int Min=n;
for(int i=head[u];i!=-1;i=edge[i].nex)
{
if(edge[i].cap-edge[i].flow&&dep[edge[i].to]<Min)
{
Min=dep[edge[i].to];
cur[u]=i;
}
}
gap[dep[u]]--;
if(!gap[dep[u]]) return ans;
dep[u]=Min+1;
gap[dep[u]]++;
if(u!=st) u=edge[S[--top]^1].to;
}
return ans;
}
int a[maxn];
bool b[maxn];
int cnt;
int prime[maxn];
bool vis[maxn];
int idp[maxn];
void get_p()
{
mem(vis,0);
vis[0]=vis[1]=1;
for(int i=2;i<maxn;i++)
{
if(!vis[i])
{
prime[cnt++]=i;
idp[i]=cnt-1;
for(int j=i+i;j<maxn;j+=i) vis[j]=1;
}
}
}
vector<int>k[maxn];
void ch(int x,int pos)
{
if(x==1) return ;
if(!vis[x])
{
k[idp[x]].pb(pos);
return ;
}
for(int i=0;i<cnt;i++)
{
if(x<prime[i]) return ;
if(x%prime[i]==0)
{
k[i].pb(pos);
while(x%prime[i]==0) x/=prime[i];
}
}
}
void solve(int x,int pos)
{
if(x==1) return ;
if(!vis[x])
{
for(int i=0;i<k[idp[x]].size();i++)
{
addedge(pos,k[idp[x]][i],1);
}
return ;
}
for(int i=0;i<cnt;i++)
{
if(x<prime[i]) return ;
if(x%prime[i]==0)
{
for(int j=0;j<k[i].size();j++)
{
addedge(pos,k[i][j],1);
}
while(x%prime[i]==0)
{
x/=prime[i];
}
}
}
}
int main()
{
FAST_IO;
//freopen("input.txt","r",stdin);
get_p();
int T;
//sfi(T);
cin>>T;
while(T--)
{
cin>>n;
int s=0,t=n+1;
init();
for(int i=0;i<cnt;i++) k[i].clear();
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
char s[3];
cin>>s;
if(s[0]=='M')
b[i]=0;
else b[i]=1;
}
for(int i=1;i<=n;i++)
{
if(b[i]==1)
ch(a[i],i);
}
for(int i=1;i<=n;i++)
{
if(b[i]==0)
{
solve(a[i],i);
}
}
for(int i=1;i<=n;i++)
{
if(b[i]==0) addedge(s,i,1);
else addedge(i,t,1);
}
int ans=sap(s,t,n+2);
cout<<n-ans<<endl;
}
return 0;
}