Codeforces 543 B. World Tour
http://codeforces.com/problemset/problem/543/B
题意:
#include<queue> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm>using namespace std;#define N 3001int dis[N][N];int s1,t1,s2,t2,l1,l2;int n;int tot; int front[N],to[N*N],nxt[N*N];int mi;void read(int &x) {x=0; char c=getchar();while(!isdigit(c)) c=getchar();while(isdigit(c)) { x=x*10+c-'0'; c=getchar(); } }void add(int u,int v) {to[++tot]=v; nxt[tot]=front[u]; front[u]=tot;to[++tot]=u; nxt[tot]=front[v]; front[v]=tot; }void bfs(int s) {int now,t;static queue<int>q;q.push(s);while(!q.empty()){now=q.front();q.pop();for(int i=front[now];i;i=nxt[i]){t=to[i];if(dis[s][t]==-1) {dis[s][t]=dis[s][now]+1;q.push(t);}}} }void solve() {for(int i=1;i<=n;++i)for(int j=1;j<=n;++j){if(dis[s1][i]+dis[i][j]+dis[j][t1]>l1 || dis[s2][i]+dis[i][j]+dis[j][t2]>l2) continue;mi=min(mi,dis[s1][i]+dis[j][t1]+dis[s2][i]+dis[j][t2]+dis[i][j]);} }int main() {int m;read(n); read(m);int u,v;for(int i=1;i<=m;++i){read(u); read(v);add(u,v);}memset(dis,-1,sizeof(dis));for(int i=1;i<=n;++i) dis[i][i]=0;for(int i=1;i<=n;++i) bfs(i);read(s1); read(t1); read(l1);read(s2); read(t2); read(l2);if(dis[s1][t1]>l1 || dis[s2][t2]>l2){printf("-1");return 0;}mi=dis[s1][t1]+dis[s2][t2];solve();swap(s1,t1);solve();printf("%d",m-mi); }
2 seconds
256 megabytes
standard input
standard output
In some country there are exactly n cities and m bidirectional roads connecting the cities. Cities are numbered with integers from 1 to n. If cities a and b are connected by a road, then in an hour you can go along this road either from city a to city b, or from city b to city a. The road network is such that from any city you can get to any other one by moving along the roads.
You want to destroy the largest possible number of roads in the country so that the remaining roads would allow you to get from city s1 to city t1 in at most l1 hours and get from city s2 to city t2 in at most l2 hours.
Determine what maximum number of roads you need to destroy in order to meet the condition of your plan. If it is impossible to reach the desired result, print -1.
The first line contains two integers n, m (1 ≤ n ≤ 3000, ) — the number of cities and roads in the country, respectively.
Next m lines contain the descriptions of the roads as pairs of integers ai, bi (1 ≤ ai, bi ≤ n, ai ≠ bi). It is guaranteed that the roads that are given in the description can transport you from any city to any other one. It is guaranteed that each pair of cities has at most one road between them.
The last two lines contains three integers each, s1, t1, l1 and s2, t2, l2, respectively (1 ≤ si, ti ≤ n, 0 ≤ li ≤ n).
Print a single number — the answer to the problem. If the it is impossible to meet the conditions, print -1.
5 41 22 33 44 51 3 23 5 2
0
5 41 22 33 44 51 3 22 4 2
1
5 41 22 33 44 51 3 23 5 1
-1
转载于:https://www.cnblogs.com/TheRoadToTheGold/p/8419246.html
Codeforces 543 B. World Tour相关推荐
- Codeforces 894.D Ralph And His Tour in Binary Country
D. Ralph And His Tour in Binary Country time limit per test 2.5 seconds memory limit per test 512 me ...
- Codeforces 刷题记录(已停更)
Codeforces 每日刷题记录 (已停更) 打'+'是一些有启发意义的题目,部分附上一句话题解,每日更新3题,大部分题目较水. Day ID Problem Tutorial Note 1 1 + ...
- Codeforces Round #760 (Div. 3) (ABCDEF)
Codeforces Round #760 (Div. 3) 题目 A. Polycarp and Sums of Subsequences 题意:t组样例,每组样例输入从小到大输入7个数构成b数组, ...
- Codeforces 544D Destroying Roads
链接:http://codeforces.com/problemset/problem/543/B B. Destroying Roads time limit per test:2 seconds ...
- CodeForces 375D Tree and Queries
传送门:https://codeforces.com/problemset/problem/375/D 题意: 给你一颗有根树,树上每个节点都有其对应的颜色,有m次询问,每次问你以点v为父节点的子树内 ...
- 「日常训练」Bad Luck Island(Codeforces Round 301 Div.2 D)
题意与分析(CodeForces 540D) 是一道概率dp题. 不过我没把它当dp做... 我就是凭着概率的直觉写的,还好这题不算难. 这题的重点在于考虑概率:他们喜相逢的概率是多少?考虑超几何分布 ...
- 【codeforces 812C】Sagheer and Nubian Market
[题目链接]:http://codeforces.com/contest/812/problem/C [题意] 给你n个物品; 你可以选购k个物品;则 每个物品有一个基础价值; 然后还有一个附加价值; ...
- CodeForces 获得数据
针对程序的输出可以看见 CodeForces :当输入.输出超过一定字符,会隐藏内容 所以:分若干个程序进行输入数据的获取 1. 1 for (i=1;i<=q;i++) 2 { 3 scanf ...
- codeforces水题100道 第二十七题 Codeforces Round #172 (Div. 2) A. Word Capitalization (strings)...
题目链接:http://www.codeforces.com/problemset/problem/281/A 题意:将一个英文字母的首字母变成大写,然后输出. C++代码: #include < ...
最新文章
- 左神讲算法——二分法及其拓展
- linux恢复设置文件夹,将.bashrc文件恢复到Ubuntu中的默认设置
- springboot中java泛型使用
- 用c++创建xml文件的两种方法
- html 狗头小游戏祝大家情人节快乐
- postman|接口测试 | pre-request script 场景应用
- css中 div圆角边框样式,DIV+CSS圆角边框 - 前端LOVER - 博客园
- windows必备软件系列
- PuTTY使用复制粘贴
- C语言编程>第十四周 ⑦ 请编写一个函数fun,它的功能是:计算n门课程的平均分,计算结果作为函数值返回。
- 【第3版emWin教程】第55章 emWin6.x按钮Button控件自定义回调函数,实现各种按钮效果
- Elasticsearch DSL语法中queries/filters执行顺序探秘
- Capacitor Plugin 实现
- ctfshow SQL注入Web171-174
- The road you are trudging is bound for loneliness.(前行的道路注定孤独)
- java设计模式系列的7大设计原则
- 智能照明控制系统是如何实现的?
- 单片机c语言按键调整时钟,关于单片机电子时钟按键部分(调时间的)如何设计...
- 知物由学 | 多级建模方法提升汉语语音识别效果,获ISCSLP大赛认可
- mac安装charls工具
热门文章
- vue设置输入框输入长度_vue输入框限制字符串长度和输入内容实时验证的实现方式...
- using namespace std 不识别_一篇文章带你了解 C++ 的门门道道,不知道的快点看过来...
- Qt工作笔记-使用setFilterKeyColumn实现model的单行过滤
- C++设计模式-继承与多态影响耦合性(最基础的简单工厂模式小实例)
- 软件设计师习题笔记-重点习题二
- WEB安全基础-PHP中GET与POST实践
- oracle dg 日志手动应用,做了DG之后,日志没有被应用
- linux ls不显示total,Linux中使用ls指令时total的意思
- mac docker安装linux,Mac上使用docker安装centos
- PHP 会话 线程 进程,php进程后台调用(多线程/进程)