LightOJ_1111.cpp

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define PF push_front
#define P push
#define INC(i,a,b) for (ll i = a; i <= b; i++)
#define DEC(i,b,a) for (ll i = b; i >= a ; i--)
#define inf LLONG_MAX
#define neginf LLONG_MIN
#define mod  1000000007
#define eps 1e-9
typedef ostringstream OS ;
typedef stringstream SS ;
typedef long long ll ;
typedef unsigned long long ull;
typedef pair < ll , ll > PLL ;
typedef pair < char,ll > PCL ;
typedef deque < double > DD ;
typedef deque < PCL > DCL ;
typedef deque < ll > DL ;
typedef deque < PLL > DLL ;
typedef deque < char > DC ;
typedef deque < string > DS ;
typedef vector < double > VD;
typedef vector < PCL > VCL ;
typedef vector < ll > VL;
typedef vector < PLL > VLL ;
typedef vector < char > VC ;
typedef vector < string > VS ;
typedef map < ll ,ll > MLL ;
typedef map < char,ll > MCL;
typedef map < ll,char > MLC;
typedef map < string,ll> MSL;
typedef priority_queue < PLL > PQLL ;
typedef priority_queue < ll > PQL ;
typedef stack < ll > SKL ;
typedef stack < PLL > SKLL ;
typedef queue < ll > QL ;
typedef queue < PLL > QLL ;
typedef set < ll > SL ;
typedef set < PLL > SLL ;
typedef set < char > SC ;
 
string numtostr(ll n) {
     OS str1 ;
     str1 << n ;
     return str1.str();
}
ll strtonum(string s) {
     ll x ;
     SS str1(s);
     str1 >> x ;
     return x ;
}
ll GCD(ll a, ll b) {
    if ( b == 0 ) return a ;
    else return GCD(b,a%b);
}
ll LCM(ll a , ll b) {
    ll gcd = GCD(a,b);
     return (a/gcd)*b ;
}
ll power(ll base, ll pow) {
    ll res = 1 ;
    INC(i,1,pow) res *= base ;
    return res ;
}
ll k,v,e ;
vector < VL > graph ;
VL visited,visittimes;
void setting() {
    graph.clear();
    graph.resize(v+5);
    visittimes.clear();
    visittimes.resize(v+5,0);
}
void dfs(ll node) {
    visited[node] = 1 ;
    visittimes[node]++ ;
    for ( ll child : graph[node]) {
        if (!visited[child]) {
            dfs(child);
        }
    }
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll t,c = 0 ;
    scanf("%lld",&t);
    while(t--) {
        scanf("%lld %lld %lld",&k,&v,&e);
        setting();
        VL vertexset ;
        INC(i,0,k-1) {
            ll nodek ;
            scanf("%lld",&nodek);
            vertexset.PB(nodek);
        }
        INC(i,1,e) {
            ll node1,node2;
            scanf("%lld %lld",&node1,&node2);
            graph[node1].PB(node2);
        }

        INC(i,0,vertexset.size()-1) {
            visited.clear();
            visited.resize(v+5,0);
            dfs(vertexset[i]);            
        }
        ll total = 0 ;
        INC(i,1,v) if ( visittimes[i] == k) total++ ;
        printf("Case %lld: %lld\n",++c,total);
    }
 
    return 0 ;
}