[codeforces]919D

time limit per test:3 seconds
memory limit per test:256 megabytes

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.

Input1

5 4
abaca
1 2
1 3
3 4
4 5

Output1

3

Input2

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

Output2

-1

Input3

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

Output3

4

Note

In the first sample, the path with largest value is 1 → 3 → 4 → 5. The value is 3 because the letter ‘a’ appears 3 times.

题意:

给定一张N个点M条边的有向图，每个点上都有一个小写字母，定义一条路径的答案为该路径上出现次数最多的字母的出现次数，如某条路径上的点为aaca 则答案为3.求所有路径中的答案的最大值。如果最大值无穷大则输出-1.

题解

首先，如果有环的话，答案肯定是-1了
接着我们$f[i][j]$表示以起始入度为0的所有点走到第i个点结束的所有路径中，第j个字母的数量最多的那条路径上，字母j的个数是多少。那么就在拓扑排序的时候转移方程就好了
$f[to][j]=max(f[to][j],f[now][j])$

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<queue>
#define LiangJiaJun main
using namespace std;
int n,m,h[300004],ru[300004],ne;
struct edge{
    int to,nt;
}e[600004];
int add(int u,int v){
    e[++ne].to=v;e[ne].nt=h[u];
    h[u]=ne;return 0;
}
char s[300004];
int cnt[300004][34];
queue<int>q;
int w33ha(){
    memset(h,0,sizeof(h));
    memset(ru,0,sizeof(ru));
    memset(cnt,0,sizeof(cnt));
    ne=0;
    scanf("%s",s+1);
    for(int i=1;i<=m;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        add(u,v);++ru[v];
    }
    for(int i=1;i<=n;i++)if(!ru[i])q.push(i);
    while(!q.empty()){
        int x=q.front();q.pop();
        cnt[x][s[x]-'a']++;
        for(int i=h[x];i;i=e[i].nt){
            --ru[e[i].to];
            for(int j=0;j<26;j++){
                cnt[e[i].to][j]=max(cnt[e[i].to][j],cnt[x][j]);
            }
            if(!ru[e[i].to])q.push(e[i].to);
        }
    }
    for(int i=1;i<=n;i++)if(ru[i])return puts("-1"),0;
    int ans=0;
    for(int i=1;i<=n;i++)
        for(int j=0;j<26;j++)ans=max(ans,cnt[i][j]);
    printf("%d\n",ans);
    return 0;
}
int LiangJiaJun(){
    while(scanf("%d%d",&n,&m)!=EOF)w33ha();
    return 0;
}