首页 > ACM题库 > HDU-杭电 > hdu 3019 Tracing Fairy待解决[解题报告]C++
2014
02-27

hdu 3019 Tracing Fairy待解决[解题报告]C++

Tracing Fairy

问题描述 :

Fairy Kate was going to visit man’s world. She informed her friend Conan but she didn’t want him to pick her up, but to find her. She told Conan that she was driving a car in the town, but at a given moment, she would move the car from one place to another with teleporting magic and these two places were quite far away from each other. If Conan could find her, she would play with him. It was rather difficult for Conan. He got a series of photos of every block from uncle Maoli. Each group of photos was taken every centisecond in a very short period, in which, there were a lot of cars. While in some groups, there was a car teleporting in a given time and in other time other cars as well as the Fairy’s all had a uniform motion in a straight line along the X or Y axes. However, Conan really felt puzzled, so he asked you, his friend Heiji Hattori, for help. Can you find in which moment the Fairy’s car was teleporting but not having a uniform motion in a straight line? The truth is one and only!
Ant Trip

输入:

Input several groups until you deal with EOF.

In the first line of each group of data, there are two integers, n and m, (5 =< n <= 200,1 =< m <= 200) n standing for the number of photos in this group, m for the number of cars in these photos. And then, in n groups, each photo’s data is given according to time sequence (the number of photos is 1 to n) and each group has m lines, each line two numbers which respectively represents a car’s X and Y axes (they are not given according to car’s numbers).

输出:

Input several groups until you deal with EOF.

In the first line of each group of data, there are two integers, n and m, (5 =< n <= 200,1 =< m <= 200) n standing for the number of photos in this group, m for the number of cars in these photos. And then, in n groups, each photo’s data is given according to time sequence (the number of photos is 1 to n) and each group has m lines, each line two numbers which respectively represents a car’s X and Y axes (they are not given according to car’s numbers).

样例输入:

5 2
1 1
2 2
1 2
3 2
2 8
4 2
2 9
5 2
2 10
6 2

5 2
1 3
3 2
3 3
1 4
1 5
3 4
3 5
1 6
1 7
3 6

样例输出:

The fairy use magic at photo 3.
The fairy did not appear on this group of photo.

Hint
In the first group, obviously, there is a car teleporting but not having a uniform motion in a straight line in a given moment in the third photo. In the second one, two cars both have a uniform motion in a straight line along the positive direction of Y axes at a speed of moving a unit in unit time.


  1. 有限自动机在ACM中是必须掌握的算法,实际上在面试当中几乎不可能让你单独的去实现这个算法,如果有题目要用到有限自动机来降低时间复杂度,那么这种面试题应该属于很难的级别了。