Codeforces 919D - Substring 【有向图判环+DP】

D. Substring

time limit per test  3 seconds

memory limit per test      256 megabytes

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

Input

The first linecontains two positive integers n, m (1 ≤ n, m ≤ 300 000), denoting thatthe graph has n nodes and m directed edges.

The second linecontains a string s with onlylowercase 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 adirected edge from x to y. Note that x can be equal toy and there can be multiple edges betweenx and y. Also the graph can be not connected.

Output

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

Examples

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

Note

In the first sample, the path withlargest value is 1 → 3 → 4 → 5. The value is 3 because the letter 'a' appears 3 times.

 

【题意】

有一个具有n个节点，m条边的有向图，每个点对应一个小写字母，现在给出每个顶点对应的字母以及有向边的连接情况，求经过的某一条路上相同字母出现的最多次数。如果次数无限大，则输出-1.

【思路】

显然，当这个有向图有回路的话结果无限大，输出-1。

我们可以通过拓扑排序的方法判断有向图是否有环，若这个有向图不具有拓扑次序，那么就说明有环。

然后就是对结果的求解，我们依次枚举每一个字母，求出这个字母在所有路中的某一条中出现次数的最大值。

根据前面求出的拓扑次序DP一下即可，具体见代码。

#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
#define mst(a,b) memset((a),(b),sizeof(a))
#define rush() int T;scanf("%d",&T);while(T--)

typedef long long ll;
const int maxn = 300005;
const ll mod = 1e9+7;
const ll INF = 1e9;
const double eps = 1e-9;

int n,m;
int degree[maxn];
char s[maxn];
int dp[maxn];
vector<int>vec[maxn];
vector<int>mp;

bool check()
{
    mp.clear();
    queue<int>q;
    for(int i=1;i<=n;i++)
    {
        if(degree[i]==0) q.push(i);
    }
    while(q.size())
    {
        int u=q.front();
        q.pop();
        mp.push_back(u);
        for(int i=0;i<vec[u].size();i++)
        {
            degree[vec[u][i]]--;
            if(degree[vec[u][i]]==0) q.push(vec[u][i]);
        }
    }
    return mp.size()==n;
}

int solve(int x)
{
    mst(dp,0);
    char c=x+'a';
    int cnt=0;
    for(int i=mp.size()-1;i>=0;i--)
    {
        int u=mp[i];
        for(int j=0;j<vec[u].size();j++)
        {
            dp[u]=max(dp[u],dp[vec[u][j]]);
        }
        if(s[u-1]==c) dp[u]++;
        cnt=max(cnt,dp[u]);
    }
    return cnt;
}

int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1;i<=n;i++) vec[i].clear();
        scanf("%s",s);
        mst(degree,0);
        for(int i=0;i<m;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            vec[x].push_back(y);
            degree[y]++;
        }
        if(!check())
        {
            puts("-1");
            continue;
        }
        int ans=0;
        for(int i=0;i<26;i++)
        {
            ans=max(ans,solve(i));
        }
        printf("%d\n",ans);
    }
}