题意:给你一个边权为1的图,s1到t1最多不能超过l1时间,s2到t2最多不能超过l2时间,问你最多能删多少条边
思路:首先因为边权为1,所以最短路的时间就是边数,那么可以直接枚举重复的区间然后相减即可
#include<bits/stdc++.h>
using namespace std;
const int maxn = 3005;
#define INF 1e9
vector<int>e[maxn];
int vis[maxn];
int d[maxn][maxn];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i = 0;i<m;i++)
{
int u,v;
scanf("%d%d",&u,&v);
e[u].push_back(v);
e[v].push_back(u);
}
int s1,t1,s2,t2,l1,l2;
scanf("%d%d%d",&s1,&t1,&l1);
scanf("%d%d%d",&s2,&t2,&l2);
for(int i = 1;i<=n;i++)
{
memset(vis,0,sizeof(vis));
d[i][i]=0;
queue<int>q;
q.push(i);
vis[i]=1;
while(!q.empty())
{
int now = q.front();
q.pop();
for(int j = 0;j<e[now].size();j++)
{
int v = e[now][j];
if(vis[v])
continue;
d[i][v]=d[i][now]+1;
if(!vis[v])
q.push(v);
vis[v]=1;
}
}
}
if(d[s1][t1]>l1 || d[s2][t2]>l2)
{
printf("-1\n");
return 0;
}
int ans = d[s1][t1]+d[s2][t2];
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=n;j++)
{
if(d[s1][i]+d[i][j]+d[j][t1]<=l1 && d[s2][i]+d[i][j]+d[j][t2]<=l2)
ans = min(ans,d[s1][i]+d[i][j]+d[j][t1]+d[s2][i]+d[j][t2]);
if(d[s1][i]+d[i][j]+d[j][t1]<=l1 && d[t2][i]+d[i][j]+d[j][s2]<=l2)
ans = min(ans,d[s1][i]+d[i][j]+d[j][t1]+d[t2][i]+d[j][s2]);
}
}
printf("%d\n",m-ans);
}