【打CF，学算法——二星级】CodeForces 374A Inna and Pink Pony （水题/坑题）

本文链接：https://blog.csdn.net/David_Jett/article/details/51895118

提交链接：CF 374A

题面：

Dima and Inna are doing so great! At the moment, Inna is sitting on the magic lawn playing with a pink pony. Dima wanted to play too. He brought an n × m chessboard, a very tasty candy and two numbers a and b.

Dima put the chessboard in front of Inna and placed the candy in position (i, j) on the board. The boy said he would give the candy if it reaches one of the corner cells of the board. He's got one more condition. There can only be actions of the following types:

move the candy from position (x, y) on the board to position (x - a, y - b);
move the candy from position (x, y) on the board to position (x + a, y - b);
move the candy from position (x, y) on the board to position (x - a, y + b);
move the candy from position (x, y) on the board to position (x + a, y + b).

Naturally, Dima doesn't allow to move the candy beyond the chessboard borders.

Inna and the pony started shifting the candy around the board. They wonder what is the minimum number of allowed actions that they need to perform to move the candy from the initial position (i, j) to one of the chessboard corners. Help them cope with the task!

Input

The first line of the input contains six integers n, m, i, j, a, b (1 ≤ n, m ≤ 10⁶; 1 ≤ i ≤ n; 1 ≤ j ≤ m; 1 ≤ a, b ≤ 10⁶).

You can assume that the chessboard rows are numbered from 1 to n from top to bottom and the columns are numbered from 1 to m from left to right. Position (i, j) in the statement is a chessboard cell on the intersection of the i-th row and the j-th column. You can consider that the corners are: (1, m), (n, 1), (n, m), (1, 1).

Output

In a single line print a single integer — the minimum number of moves needed to get the candy.

If Inna and the pony cannot get the candy playing by Dima's rules, print on a single line "Poor Inna and pony!" without the quotes.

Examples

Input

5 7 1 3 2 2

Output

Input

5 5 2 3 1 1

Output

Poor Inna and pony!

Note

Note to sample 1:

Inna and the pony can move the candy to position (1 + 2, 3 + 2) = (3, 5), from there they can move it to positions (3 - 2, 5 + 2) = (1, 7) and (3 + 2, 5 + 2) = (5, 7). These positions correspond to the corner squares of the chess board. Thus, the answer to the test sample equals two.

题意：

给定一个n*m的棋盘，和一个初始点的坐标（i,j）。移动方式有(x +/- a, y+/ - b)四种，移动过程中不能超出棋盘，问最少需要多少步可以移动到四个角落中的任意一个。不能移到，则输出“Poor Inna and pony!”。

解题：

直观的想法是求起始点到四个点的坐标偏差，并计算x/y方向的运动次数，倘若两者运动次数一样，则可作为一个解，若运动次数奇偶性不同，则无法修正。遍历四个点，取最小即可。

坑点：

很多人可能都会死在样例37，这个样例比较特殊，就是某一维不需要移动，但另一维需要移动，但不需要移动的那维，若发生移动，则会越界。给个样例如5 7 1 3 10 2，实际上是不能移动的，错的人可能都会输出2。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#define inf 10e8
using namespace std;
int main()
{
    int n,m,i,j,a,b,ans=1000000,x,y,ta,tb,sx[2],sy[2],tmp;
	scanf("%d%d%d%d%d%d",&n,&m,&i,&j,&a,&b);
	sx[0]=1,sx[1]=n,sy[0]=1,sy[1]=m;
	if((i==1||i==n)&&(j==1||j==m))
		ans=0;
    for(int p=0;p<2;p++)
	{
      for(int q=0;q<2;q++)
	  {
		  x=abs(i-sx[p]);
		  y=abs(j-sy[q]);
		  if(x%a==0&&y%b==0)
		  {
             ta=x/a;
			 tb=y/b; 
			 if(ta%2==tb%2)
		     {
			   if(ta==0&&(abs(i-1)<a)&&(abs(i-n)<a))
				   continue;
			   if(tb==0&&(abs(j-1)<b)&&(abs(j-m)<b))
				   continue;
			   ans=min(ans,max(ta,tb));
			 }
		  }
	  }
	}
	if(ans!=1000000)
    	printf("%d\n",ans);
	else
		printf("Poor Inna and pony!\n");
	return 0;
}