题目要求找到两个数x和y（1≤x<y≤n），使得给定的m组数对中每组至少有一个数是x或y。可以通过遍历和比较所有数对来判断是否存在这样的数对。如果找到一组数对与已知所有数对都不相同，那么这组数对中的另一个数可能是另一个目标数。遍历所有可能的数对组合，如果发现满足条件的，输出'YES'，否则输出'NO'。编程时要注意变量的使用，避免重复导致错误。保持冷静，专注于当前的任务，不要过于纠结于过去的错误。
Toad Ivan has mm pairs of integers, each integer is between 11 and nn, inclusive. The pairs are (a1,b1),(a2,b2),…,(am,bm)(a1,b1),(a2,b2),…,(am,bm).
He asks you to check if there exist two integers xx and yy (1≤x<y≤n1≤x<y≤n) such that in each given pair at least one integer is equal to xx or yy.
Input
The first line contains two space-separated integers nn and mm (2≤n≤3000002≤n≤300000, 1≤m≤3000001≤m≤300000) — the upper bound on the values of integers in the pairs, and the number of given pairs.
The next mm lines contain two integers each, the ii-th of them contains two space-separated integers aiai and bibi (1≤ai,bi≤n,ai≠bi1≤ai,bi≤n,ai≠bi) — the integers in the ii-th pair.
Output
Output "YES" if there exist two integers xx and yy (1≤x<y≤n1≤x<y≤n) such that in each given pair at least one integer is equal to xx or yy. Otherwise, p
最低0.47元/天 解锁文章
655
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
