n*m的地图,从0,0,开始走,只能向下或向右走,每一个坐标只有0~9、#、*。如果为#代表墙不能通过,如果为*代表是传送门,可以传达其他位置,如果为数字,则代表该点的价值。求最大价值。
先输入T,T组数据。
输入n、m代表地图的大小。然后输入地图,接下来输入每一个传送门能传送的位置坐标。
先用Tarjan把环求出来,然后进行缩点,最后构建一个新图,求最长路。
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <string.h>
#include <stdio.h>
#define LL long long
using namespace std;
const int N = 1e2+10;
const int NN = 1e4+10;
char str[N][N];
int n,m;
stack<int>sta;
struct Edge{
int to,next;
}edge[NN<<2],Map[NN<<2];
int head[NN],top,temp[NN],tp;
int dfn[NN],low[NN],tim;
int vis[NN],num;
int pos[NN],ans[NN],val[NN];
int dis[NN];
void init(){
memset(head,-1,sizeof(head));
memset(temp,-1,sizeof(temp));
memset(dfn,0,sizeof(dfn));
memset(vis,0,sizeof(vis));
memset(ans,0,sizeof(ans));
memset(val,0,sizeof(val));
top = tim = num = tp = 0;
}
bool judge(int i,int j){
if(i<0||i>=n||j<0||j>=m||str[i][j]=='#')return false;
return true;
}
void add(int i,int j,int x,int y){
if(judge(x,y)){
int u = i*m+j+1;
int v = x*m+y+1;
edge[top] = {v,head[u]};
head[u] = top++;
}
}
void addMap(int u,int v){
Map[tp] = {v,temp[u]};
temp[u] = tp++;
}
void tarjan(int u){
dfn[u] = low[u] = ++tim;
vis[u] = 1;
sta.push(u);
for(int i = head[u]; ~i; i = edge[i].next){
int& v = edge[i].to;
if(!dfn[v]){
tarjan(v);
}
if(vis[v]==1){
low[u] = min(low[u],low[v]);
}
}
if(dfn[u] == low[u]){
while(!sta.empty()){
int v = sta.top();
sta.pop();
vis[v] = 2;
ans[num] += val[v];
pos[v] = num;
if(u==v)break;
}
++num;
}
}
void spfa(){
memset(dis,0,sizeof(dis));
memset(vis,0,sizeof(vis));
queue<int>q;
q.push(pos[1]);
vis[pos[1]] = 1;
dis[pos[1]] = ans[pos[1]];
int mx = ans[pos[1]];
while(!q.empty()){
int u = q.front();
q.pop();
vis[u] = 0;
for(int i = temp[u]; ~i; i=Map[i].next){
int v = Map[i].to;
if(dis[v] < dis[u]+ans[v]){
dis[v] = dis[u]+ans[v];
mx = max(mx,dis[v]);
if(!vis[v]){
vis[v] = 1;
q.push(v);
}
}
}
}
printf("%d\n",mx);
}
int main()
{
int T;
int x,y;
scanf("%d",&T);
while(T--){
init();
scanf("%d%d",&n,&m);
for(int i = 0; i < n; ++i){
scanf("%s",str[i]);
}
for(int i = 0; i < n; ++i){
for(int j = 0; j < m; ++j){
if(str[i][j]=='#')continue;
if(str[i][j] == '*'){
scanf("%d%d",&x,&y);
add(i,j,x,y);
}
else val[i*m+j+1] = str[i][j]-'0';
add(i,j,i+1,j),add(i,j,i,j+1);
}
}
while(!sta.empty())sta.pop();
for(int i = 1; i <= n*m; ++i){
if(!dfn[i]) tarjan(i);
}
for(int i = 1; i <= n*m; ++i){
for(int j = head[i]; ~j; j = edge[j].next){
int v = edge[j].to;
if(pos[i]==pos[v])continue;
addMap(pos[i],pos[v]);
}
}
spfa();
}
return 0;
}