同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22648_Triathlon

2022-5-16 18:22| 发布者: Hocassian| 查看: 23| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506818260499-Problem List-采集的数据-后羿采集器.html

Pro.ID

22648

Title

Triathlon

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22648

AC

Submit

Ratio

42.86%

时间&空间限制

Time Limit: 1500/500 MS (Java/Others) Memory Limit: 20000/10000 K (Java/Others)

描述

Triathlon is an athletic contest consisting of three consecutive sections that should be completed as fast as possible as a whole. The first section is swimming, the second section is riding bicycle and the third one is running.

The speed of each contestant in all three sections is known. The judge can choose the length of each section arbitrarily provided that no section has zero length. As a result sometimes she could choose their lengths in such a way that some particular contestant would win the competition.

输入

The first line of the input file contains integer number N ( 1 <= N <= 100 ), denoting the number of contestants. Then N lines follow, each line contains three integers Vi, Ui and Wi ( 1 <= Vi, Ui, Wi <= 10000 ), separated by spaces, denoting the speed of ith contestant in each section.

输出

Description

Input

Output

For every contestant write to the output file one line, that contains word "Yes" if the judge could choose the lengths of the sections in such a way that this particular contestant would win (i.e. she is the only one who would come first), or word "No" if this is impossible.

Sample Input

Sample Output

Yes
Yes
Yes
No
No
No
Yes
No
Yes

Source

NEERC 2000

样例输入

样例输出

Yes
Yes
Yes
No
No
No
Yes
No
Yes

提示