洛谷P7520 [省选联考 2021 A 卷] 支配
#include<bits/stdc++.h>
#define N 3005
using namespace std;
int n,m,Q,p,q,fa[N+1],fl[N+1][N+1],t[N+1],tfl[N+1][N+1],gfl[N+1];
vector<int>bi[N+1],fbi[N+1],o[N+1];
pair<int,int>q0[100001];
bool comp(int x,int y){return o[x].size()<o[y].size();}
void putin(){
cin>>n>>m>>Q;
for(int i=1;i<=m;i++)cin>>p>>q,bi[p].push_back(q),fbi[q].push_back(p);
for(int i=1;i<=Q;i++)cin>>q0[i].first>>q0[i].second;
}
inline void dfs0(int x,int np){
fl[x][np]=1;
if(x==np)return;
for(int i=0;i<bi[x].size();i++){
int ni=bi[x][i];
if(!fl[ni][np])dfs0(ni,np);
}
}
void ycl(){
dfs0(1,0);
for(int i=1;i<=n;i++)t[i]=i;
for(int i=1;i<=n;i++){
dfs0(1,i);
for(int j=1;j<=n;j++)if(fl[j][0]&&!fl[j][i])o[j].push_back(i);
}
sort(t+1,t+n+1,comp);
for(int i=1;i<=n;i++){
for(int j=0;j<o[i].size();j++){
if(o[o[i][j]].size()==o[i].size()-1){
fa[i]=o[i][j];break;
}
}
}
}
inline void dfs1(int x,int np,int nr){
if(x==nr)return;
tfl[x][np]=1;
for(int i=0;i<fbi[x].size();i++){
int ni=fbi[x][i];
if(!tfl[ni][np])dfs1(ni,np,nr);
}
}
void cal0(){
for(int i=2;i<=n;i++){
dfs1(i,i,fa[i]);
}
for(int i=1;i<=Q;i++){
int nans=0;
for(int j=1;j<=n;j++)if(fl[q0[i].first][fa[j]]&&tfl[q0[i].second][j]&&fa[j]!=1&&fa[j]!=q0[i].first)gfl[j]=1;
for(int j=1;j<=n;j++)if(gfl[fa[t[j]]])gfl[t[j]]=1;
for(int j=1;j<=n;j++)if(gfl[j])nans++,gfl[j]=0;
cout<<nans<<'\n';
}
}
signed main(){
putin();
ycl();
cal0();
return 0;
}