codeforces919D-Substring

最新推荐文章于 2020-12-14 22:01:29 发布

原创最新推荐文章于 2020-12-14 22:01:29 发布 · 429 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

dp-背包专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种结合图论与动态规划的方法来解决寻找图中具有最大相同字母出现次数的路径问题。通过记忆化搜索避免重复计算，并利用深度优先搜索（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.

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

题目大意：给你一张图，然后图中每个结点都有一个小写字母对应其权值，现在求任意一条路径上，相同字母出现的次数的最大值，

若图中有环，直接输出-1，输入边可能含有重边和自环边。

这道题最主要的就是发现结点上的值只为小写字母，即范围为1~26，那么我们可以使用dp[u][i]，u表示当前结点，i表示u结点

上的颜色个数，由于状态范围只有26，因此在每次DFS过程中可以计算当前状态值后进行保留，实现记忆化搜索。像这种直接

暴力炸的题目，要多留意题目中给出或者隐含的数据范围。

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn =(1e5+100)*3;
int n,m,in[maxn],out[maxn],val[maxn],cnt[maxn];
vector<int> ax[maxn];
int ans = 0,temp = 0,vis[maxn];
map<int,int> ac[maxn];
int T,N,low[maxn],dfn[maxn],tot=0,sta[maxn],Ins[maxn],belong[maxn];
int scc_cnt=0,cnt1=0;
vector<int> sccno[maxn];
int store[maxn][27];
bool cal[maxn];
void dfs(int u,int fa1){
     vis[u]=1;
     store[u][val[u]]++;
     for(int i=0;i<ax[u].size();i++){
        int to = ax[u][i];
        if(to==fa1||vis[to])
            continue;
        if(cal[to]){
                for(int j=1;j<=26;j++)
				  store[u][j] = max(store[u][j],store[to][j]+(j==val[u]));
            continue;
        }
        dfs(to,u);
        for(int j=1;j<=26;j++)
				  store[u][j] = max(store[u][j],store[to][j]+(j==val[u]));
     }
	 //cout<<ans<<"  "<<u<<endl;
	 for(int i=1;i<=26;i++)
		ans = max(ans,store[u][i]);
     cal[u]=true;
     vis[u]=0;
}
void init(){
	tot=0;
	scc_cnt=0;
}
void dfs1(int u,int fa){
     dfn[u] = low[u] = ++tot;
     sta[cnt1++]=u;
     Ins[u]=1;
     for(int i=0;i<ax[u].size();i++){
           int v = ax[u][i];
           if(!dfn[v]){
              dfs1(v,u);
              low[u] = min(low[u],low[v]);
           }
           else if(Ins[v])
			  low[u] = min(low[u],dfn[v]);
     }
     if(dfn[u]==low[u]){
          scc_cnt++;
          int x = 0;
          while(x!=u){
             x = sta[--cnt1];
             sccno[scc_cnt].push_back(x);
             belong[x] = scc_cnt;
             Ins[x]=0;
          }
	 }
}
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    cin>>n>>m;
    memset(cal,false,sizeof(cal));
    for(int i=1;i<=n;i++){
        char a;
        cin>>a;
        val[i] = a-'a'+1;
    }
    int flag=0;
    for(int i=0;i<m;i++)
    {
        int a,b;
        cin>>a>>b;
        if(ac[a].find(b)!=ac[a].end())
            continue;
        if(a==b)
            flag=1;
        ac[a][b]=1;
        ax[a].push_back(b);
        in[b]++;
    }
    if(flag){
        cout<<-1<<endl;
        return 0;
    }
    for(int i=1;i<=n;i++)
        if(!dfn[i])
           dfs1(i,0);
    for(int i=1;i<=scc_cnt;i++){
       if(sccno[i].size()>1){
         cout<<-1<<endl;
         return 0;
       }
    }
    for(int i=1;i<=n;i++)
        if(!in[i])
          dfs(i,0);
	//cout<<store[3][1]<<endl;
  //cout<<ans<<" "<<temp<<endl
    cout<<ans<<endl;

   return 0;
}