{"trustable":true,"prependHtml":"\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\nPrototype is a 3D game which allow you to control a person named Alex with\nmuch super ability to finish missions with gut along. Alex has the abilitiy\nto glide in the sky. What\u0027s more, he can make at most 3-level glide, which\nmeans before he lands at the ground, he has two chances to adjust and perform\nanother glide. We assume that each time he perform a glide, his vertical speed\nbecome zero and glide forward with a new speed. And the orbit will be a\nparabola due to the gravity.\n\u003c/p\u003e\n\u003ccenter\u003e\u003cimg src\u003d\"CDN_BASE_URL/0c6cb475edd3db26f47968131d4b634e?v\u003d1718679611\"\u003e\u003c/center\u003e\n\u003cp\u003e\nTo make the problem easier, we now only consider at most 2-level glide. The\nbinomial coefficient of the mathematical equation of the fist glide will be\ngiven as \u003ci\u003e-a\u003c/i\u003e and the second will be \u003ci\u003e-b\u003c/i\u003e, which means the\nformulations are (y - y0) \u003d -\u003ci\u003ea\u003c/i\u003ex\u003csup\u003e2\u003c/sup\u003e and (y - y0) \u003d\n-\u003ci\u003eb\u003c/i\u003e(x - x0)\u003csup\u003e2\u003c/sup\u003e. As the picture above, Alex perform a glide from\nthe top of Building1, make a 1-level or a 2-level glide and lands exactly at\npoint B. What\u0027s more, there is Building2 standing between Building1 and point\nB. Alex has to avoid crashing onto it.\n\u003c/p\u003e\n\u003cp\u003e\u003cb\u003eInput\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003e\nThere are no more than 15 cases. Proceed till the end of file.\u003cbr\u003e\nEach case contains only one line of six real number \u003ci\u003eh\u003csub\u003e1\u003c/sub\u003e\u003c/i\u003e,\n\u003ci\u003eh\u003csub\u003e2\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003ed\u003csub\u003e1\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003ed\u003csub\u003e2\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003ea\u003c/i\u003e,\n\u003ci\u003eb\u003c/i\u003e. \u003ci\u003eh\u003csub\u003e1\u003c/sub\u003e\u003c/i\u003e is the height of Building1,\n\u003ci\u003eh\u003csub\u003e2\u003c/sub\u003e\u003c/i\u003e is the height of Building2, \u003ci\u003ed\u003csub\u003e1\u003c/sub\u003e\u003c/i\u003e is the\nX-distance between Building1 and Building2, \u003ci\u003ed\u003csub\u003e2\u003c/sub\u003e\u003c/i\u003e is the\nX-distance between point B and Building1. These four numbers are in [0, 1000]\n, and satisfies \u003ci\u003ed1\u003c/i\u003e \u0026lt; \u003ci\u003ed2\u003c/i\u003e. And \u003ci\u003ea\u003c/i\u003e and \u003ci\u003eb\u003c/i\u003e are in\n(0, 1000].\n\u003c/p\u003e\n\u003cp\u003e\u003cb\u003eOutput\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003e\nIf it is possible for Alex to land exactly on point B, print Yes, otherwise\nprint No.\n\u003c/p\u003e\n\u003cp\u003e\u003cb\u003eSample Input\u003c/b\u003e\u003c/p\u003e\n\u003cpre\u003e25 1 6 7 1 1\n4 3 1 2 1 1\n\u003c/pre\u003e\n\u003cp\u003e\u003cb\u003eSample Output\u003c/b\u003e\u003c/p\u003e\n\u003cpre\u003eYes\nYes\n\u003c/pre\u003e\n\u003cp\u003e\u003cb\u003eHINT\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003e\nIn case 2, Alex just glide over the building2 and do not crash onto it.\n\u003c/p\u003e\n"}}]}