#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define M_PI 3.14159265358979323846 using namespace std; //conversion //------------------------------------------ inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } inline int readInt() { int x; scanf("%d", &x); return x; } //typedef //------------------------------------------ typedef vector VI; typedef vector VVI; typedef vector VS; typedef pair PII; typedef pair TIII; typedef long long LL; typedef unsigned long long ULL; typedef vector VLL; typedef vector VVLL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define SQ(a) ((a)*(a)) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //repetition //------------------------------------------ #define FOR(i,s,n) for(int i=s;i<(int)n;++i) #define REP(i,n) FOR(i,0,n) #define MOD 1000000007 #define rep(i, a, b) for(int i = a; i < (b); ++i) #define trav(a, x) for(auto& a : x) #define all(x) x.begin(), x.end() #define sz(x) (int)(x).size() struct Edge { int to, cost; Edge(int to, int cost): to(to), cost(cost) {} }; typedef long long ll; typedef pair pii; typedef vector vi; typedef vector> AdjList; AdjList graph; const int INF = 100000000; LL N, M; int h[155]; vector> P(100010); int main() { //cout << fixed << setprecision(15); cin >> N >> M; string S; cin >> S; vi vs; REP(i, M){ int u, v; cin >> u >> v; u--; v--; if(S[u]=='P' && S[v] == 'D'){ vs.push_back(u); P[u].push_back(v); }else if(S[u] == 'D' && S[v] == 'C'){ P[u].push_back(v); }else if(S[u] =='C' && S[v] == 'A') { P[u].push_back(v); }else if(S[u] == 'D' && S[v] == 'P'){ vs.push_back(v); P[v].push_back(u); }else if(S[u]=='C' && S[v]=='D'){ P[v].push_back(u); }else if(S[u]=='A' && S[v] == 'C'){ P[v].push_back(u); } } LL ans = 0; for(int i=0; i Q のパスの本数 for(int j=0; j C のパスの本数 for(int k=0; k