Codeforces Round #460 (Div. 2) D. Substring(图论，记忆化DFS)

描述

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.

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 with largest value is 1 → 3 → 4 → 5. The
value is 3 because the letter ‘a’ appears 3 times.

思路

给你一个$n$个点$m$条边的有向图，每一个顶点都对应一个字母，定义一条路径的价值为：从一个顶点开始这条路径上出现的字母的最多次数。题目要求输出这个图的最大价值。如果出现环就输出-1.

那么定义:

• f[i][j]：当前顶点为i时，字母j在以i为顶点的路径上的最大价值

我们遍历每一个顶点和每一个字母，然后求出最大值就是答案。f[i][j]为-2代表当前的点走过了，用到记忆化搜索

代码

#include <cstdio>
#include <cstring>
#include <cctype>
#include <stdlib.h>
#include <string>
#include <map>
#include <iostream>
#include <stack>
#include <cmath>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define inf 1000000
#define mem(a,b) memset(a,b,sizeof(a))
const int N=3e5+7;

int f[N][26],n,m;

vector<int>G[N];
char s[N];
int dfs(int u,int c)
{
    if(f[u][c]==-2)
    {
        puts("-1");
        exit(0);
    }
    if(f[u][c]!=-1)
        return f[u][c];
    f[u][c]=-2;
    int res=0;
    for(int i=0; i<G[u].size(); i++)
    {
        int v=G[u][i];
        res=max(res,dfs(v,c));
    }
    res+=s[u]-'a'==c;
    f[u][c]=res;
    return res;
}
int main()
{
    int u,v;
    scanf("%d%d",&n,&m);
    scanf("%s",s+1);
    for(int i=1; i<=m; i++)
    {
        scanf("%d%d",&u,&v);
        G[u].push_back(v);
    }
    mem(f,-1);
    int ans=0;
    for(int i=1; i<=n; i++)
        for(int j=0; j<26; j++)
            ans=max(ans,dfs(i,j));
    printf("%d\n",ans);
    return 0;
}