CodeForces - 919D

                                CodeForces - 919D 

You are given a graph with n nodes and m directed edges. One lowercase letter is assigned to each node. We define a path's value as the number of the most frequently occurring letter. For example, if letters on a path are "abaca", then the value of that path is 3. Your task is find a path whose value is the largest.

Input

The first line contains two positive integers n, m (1 ≤ n, m ≤ 300 000), denoting that the graph has n nodes and m directed edges.

The second line contains a string s with only lowercase English letters. The i-th character is the letter assigned to the i-th node.

Then m lines follow. Each line contains two integers x, y (1 ≤ x, y ≤ n), describing a directed edge from x to y. Note that x can be equal to y and there can be multiple edges between x and y. Also the graph can be not connected.

Output

Output a single line with a single integer denoting the largest value. If the value can be arbitrarily large, output -1 instead.

Example

Input

5 4
abaca
1 2
1 3
3 4
4 5

Output

3

Input

6 6
xzyabc
1 2
3 1
2 3
5 4
4 3
6 4

Output

-1

Input

10 14
xzyzyzyzqx
1 2
2 4
3 5
4 5
2 6
6 8
6 5
2 10
3 9
10 9
4 6
1 10
2 8
3 7

Output

4

题解 ： 

    DFS拓扑的同时 进行树形DP

    定义DP[i][j] 为 以 点i  为起点的路径的 字符 j  的最多出现次数

Code：

#include <queue>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
const int M = 3e5 + 233;
const int Mod = 1e9 + 7;
const int INF = 0x3f3f3f;
typedef long long ll;
char s[M];
vector <int> v[M];
int vis[M], in[M];
int dp[M][40] ;// 以 i 结尾的  子符 的次数

int dfs(int x)
{
    in[x] = 1;
    vis[x] = 1;
    dp[x][s[x]-'a'] = 1;
    for(int i=0;i<v[x].size();i++)
    {
        int &t = v[x][i];
        if(in[t]) printf("-1\n"), exit(0);
        if(!vis[t]) dfs(t);
        for(int j=0;j<26;j++)
            dp[x][j] = max(dp[t][j]+((s[x]-'a')==j),dp[x][j]);
    }
    in[x] = 0;
}
int main()
{
    int n,m,x,y;
    scanf("%d%d%s",&n,&m,s+1);
    for(int i=0;i<m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        if(x == y) return 0*puts("-1");
    }
    for(int i=1;i<=n;i++)  if(!vis[i])  dfs(i);
    int ans = 0;
    for(int i=1;i<=n;i++)
    for(int j=0;j<30;j++)
        ans  = max(ans,dp[i][j]);
    printf("%d\n",ans);
}
// 3 3  aaa 1 2 2 3 3 1