2015 ICPC 沈阳站M题
2016-04-21 21:35
344 查看
M - Meeting
Time Limit:6000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status Practice HDU
5521
Appoint description:
System Crawler (2016-04-18)
Description
Bessie and her friend Elsie decide to have a meeting. However, after Farmer John decorated his
fences they were separated into different blocks. John's farm are divided into
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006E.png?rev=2.4-beta-2)
blocks
labelled from
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
to
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006E.png?rev=2.4-beta-2)
.
Bessie lives in the first block while Elsie lives in the
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006E.png?rev=2.4-beta-2)
-th
one. They have a map of the farm
which shows that it takes they
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0074.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
minutes
to travel from a block in
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0045.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
to
another block
in
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0045.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
where
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0045.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/00A0.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0028.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006D.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0029.png?rev=2.4-beta-2)
is
a set of blocks. They want to know how soon they can meet each other
and which block should be chosen to have the meeting.
Input
The first line contains an integer
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0054.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/00A0.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0028.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0054.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0036.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0029.png?rev=2.4-beta-2)
,
the number of test cases. Then
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0054.png?rev=2.4-beta-2)
test
cases
follow.
The first line of input contains
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006E.png?rev=2.4-beta-2)
and
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006D.png?rev=2.4-beta-2)
.
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0032.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006E.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0030.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/283/0035.png?rev=2.4-beta-2)
.
The following
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006D.png?rev=2.4-beta-2)
lines
describe the sets
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0045.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/00A0.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0028.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006D.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0029.png?rev=2.4-beta-2)
.
Each line will contain two integers
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0074.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0028.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0074.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0030.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/283/0039.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0029.png?rev=2.4-beta-2)
and
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0053.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/00A0.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0028.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0053.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/003E.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0030.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0029.png?rev=2.4-beta-2)
firstly.
Then
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0053.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
integer
follows which are the labels of blocks in
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0045.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
.
It is guaranteed that
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Size1/Regular/400/2211.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/006D.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/283/003D.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/283/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0053.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0030.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/283/0036.png?rev=2.4-beta-2)
.
Output
For each test case, if they cannot have the meeting, then output "Evil John" (without quotes) in one line.
Otherwise, output two lines. The first line contains an integer, the time it takes for they to meet.
The second line contains the numbers of blocks where they meet. If there are multiple
optional blocks, output all of them in ascending order.
Sample Input
Sample Output
Hint
题意
有 N个点 n<=100000 ,m《=10000个集合,在同一个集合中的人意两个点的距离都相等,不同的集合时间不一定相同, 一个人从1 出发,一个人从n出发求 二人相遇的最时间
思路:
如果按普通的写法 则需要建立很多的边,边太多是存不下的,所以要缩图,缩图的方法
![](http://img.blog.csdn.net/20160421213817631?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center)
这样就可以了 ,保证了集合内的点人意点都是time 哈
但是 使用普通的SPFA 就会超时!!QAQ
需要是用 dijktra + 优先队列
套了个最短路优化模版 就可以了
Time Limit:6000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status Practice HDU
5521
Appoint description:
System Crawler (2016-04-18)
Description
Bessie and her friend Elsie decide to have a meeting. However, after Farmer John decorated his
fences they were separated into different blocks. John's farm are divided into
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006E.png?rev=2.4-beta-2)
blocks
labelled from
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
to
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006E.png?rev=2.4-beta-2)
.
Bessie lives in the first block while Elsie lives in the
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006E.png?rev=2.4-beta-2)
-th
one. They have a map of the farm
which shows that it takes they
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0074.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
minutes
to travel from a block in
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0045.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
to
another block
in
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0045.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
where
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0045.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/00A0.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0028.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006D.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0029.png?rev=2.4-beta-2)
is
a set of blocks. They want to know how soon they can meet each other
and which block should be chosen to have the meeting.
Input
The first line contains an integer
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0054.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/00A0.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0028.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0054.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0036.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0029.png?rev=2.4-beta-2)
,
the number of test cases. Then
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0054.png?rev=2.4-beta-2)
test
cases
follow.
The first line of input contains
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006E.png?rev=2.4-beta-2)
and
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006D.png?rev=2.4-beta-2)
.
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0032.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006E.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0030.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/283/0035.png?rev=2.4-beta-2)
.
The following
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006D.png?rev=2.4-beta-2)
lines
describe the sets
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0045.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/00A0.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0028.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/006D.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0029.png?rev=2.4-beta-2)
.
Each line will contain two integers
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0074.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0028.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0074.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0030.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/283/0039.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0029.png?rev=2.4-beta-2)
and
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0053.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/00A0.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0028.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0053.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/003E.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0030.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0029.png?rev=2.4-beta-2)
firstly.
Then
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0053.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
integer
follows which are the labels of blocks in
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0045.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
.
It is guaranteed that
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Size1/Regular/400/2211.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/006D.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/283/003D.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/283/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/400/0053.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Math/Italic/283/0069.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/2264.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0031.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/400/0030.png?rev=2.4-beta-2)
![](http://acm.hdu.edu.cn/js/MathJax/fonts/HTML-CSS/TeX/png/Main/Regular/283/0036.png?rev=2.4-beta-2)
.
Output
For each test case, if they cannot have the meeting, then output "Evil John" (without quotes) in one line.
Otherwise, output two lines. The first line contains an integer, the time it takes for they to meet.
The second line contains the numbers of blocks where they meet. If there are multiple
optional blocks, output all of them in ascending order.
Sample Input
2 5 4 1 3 1 2 3 2 2 3 4 10 2 1 5 3 3 3 4 5 3 1 1 2 1 2
Sample Output
Case #1: 3 3 4 Case #2: Evil John
Hint
In the first case, it will take Bessie 1 minute travelling to the 3rd block, and it will take Elsie 3 minutes travelling to the 3rd block. It will take Bessie 3 minutes travelling to the 4th block, and it will take Elsie 3 minutes travelling to the 4th block. In the second case, it is impossible for them to meet.
题意
有 N个点 n<=100000 ,m《=10000个集合,在同一个集合中的人意两个点的距离都相等,不同的集合时间不一定相同, 一个人从1 出发,一个人从n出发求 二人相遇的最时间
思路:
如果按普通的写法 则需要建立很多的边,边太多是存不下的,所以要缩图,缩图的方法
这样就可以了 ,保证了集合内的点人意点都是time 哈
但是 使用普通的SPFA 就会超时!!QAQ
需要是用 dijktra + 优先队列
套了个最短路优化模版 就可以了
#include <queue> #include <vector> #include <cstdio> #include <cstring> #include <iostream> #include <algorithm> #define pb push_back #define mp make_pair #define sz(x) ((int)(x).size()) using namespace std; const int N = 1000100*2; const long long INF = 1e18; int n, m; long long dis ; long long dis1 ; long long dis2 ; long long f ; bool vis ; struct Node { long long d; int e; bool operator < (const Node x) const { return x.d < d; } Node(long long d, int e):d(d), e(e) {} }; vector<pair<int,long long > > V ; void dijkstra(int s) { priority_queue<Node> q; fill(dis + 1, dis + n+2*m + 1, INF); fill(vis + 1, vis + n+2*m + 1, false); q.push(Node(0, s)); dis[s] = 0; while(!q.empty()) { Node deq = q.top(); q.pop(); if(vis[deq.e]) continue; vis[deq.e] = true; for(int i = 0; i < sz(V[deq.e]); i++) { int e = V[deq.e][i].first; long long w = V[deq.e][i].second; if(dis[deq.e] < dis[e] - w) { dis[e] = dis[deq.e] + w; q.push(Node(dis[e], e)); } } } } void add_edge(int a,int b,long long c) { V[a].push_back(make_pair(b, c)); } long long max(long long a,long long b) { if(a>b) return a; return b; } long long min(long long a,long long b) { if(a>b)return b; return a; } int main() { int T; scanf("%d",&T); int CASE=1 ; while(T--) { scanf("%d%d",&n,&m); int fc = n+1; for(int i = 1; i<=n+m*2+1; i++) V[i].clear(); long long time ; int y; for(int i = 1; i<=m; i++) { scanf("%lld%d",&time,&y); int temp ; for(int j = 1; j<=y; j++) { scanf("%d",&temp); add_edge(temp,fc,0); add_edge(fc+1,temp,0); } add_edge(fc,fc+1,time); fc+=2; } dijkstra(1); memcpy(dis1,dis,sizeof(dis)); dijkstra(n); memcpy(dis2,dis,sizeof(dis)); long long minv = INF; for(int i =1 ; i<=n; i++) { f[i] = max(dis1[i],dis2[i]); minv = min(minv,f[i]); } printf("Case #%d: ",CASE++); if(minv>=INF) { printf("Evil John\n"); } else { printf("%lld\n",minv); int flagc = 0; for(int i = 1; i<=n; i++) { if(f[i]==minv) { if(!flagc) { printf("%d",i); flagc = 1; } else printf(" %d",i); } } printf("\n"); } } return 0; }
相关文章推荐
- Notification版本更替
- 兴趣问题清单
- 课程练习二-1003-pie
- BestCoder Round #80 A B C hdu5667矩阵快速幂
- UIBarButtonSystemItem 样式 和 图片
- nyoj 448 寻找最大数
- 二分查找进阶——循环有序数组查找再进阶——循环有序重复数组查找
- javascript 前端验证 file 上传图片 尺寸 大小
- 第82课:Spark Streaming第一课:案例动手实战并在电光石火间理解其工作原理
- hdu4405(概率dp)
- 周总结
- 最详细的 Android Toolbar 开发实践总结
- Python函数——学习笔记
- 32bit/64bit-Ubuntu14.04+anaconda+CPU版本的Caffe安装教程
- 我的 Mac 清单
- python语言的解释性执行问题(备份一下,以供以后学习参考)
- NOIP2010普及组T3 接水问题 ——S.B.S.
- 学习进度条(周总结)
- spring 动态数据源
- Android事件分发机制