B - Not so Mobile UVA - 839-CSDN博客

本文链接：https://blog.csdn.net/TANG3223/article/details/82081872

Before being an ubiquous communications gadget, a mobile was just a structure made of strings and wires suspending colourfull things. This kind of mobile is usually found hanging over cradles of small babies.

$\epsfbox{p839a.eps}$

The figure illustrates a simple mobile. It is just a wire, suspended by a string, with an object on each side. It can also be seen as a kind of lever with the fulcrum on the point where the string ties the wire. From the lever principle we know that to balance a simple mobile the product of the weight of the objects by their distance to the fulcrum must be equal. That is Wl×Dl = Wr×Dr where Dl is the left distance, Dr is the right distance, Wl is the left weight and Wr is the right weight.

In a more complex mobile the object may be replaced by a sub-mobile, as shown in the next figure. In this case it is not so straightforward to check if the mobile is balanced so we need you to write a program that, given a description of a mobile as input, checks whether the mobile is in equilibrium or not.

$\epsfbox{p839b.eps}$

Input

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

The input is composed of several lines, each containing 4 integers separated by a single space. The 4 integers represent the distances of each object to the fulcrum and their weights, in the format: Wl Dl Wr Dr

If Wl or Wr is zero then there is a sub-mobile hanging from that end and the following lines define the the sub-mobile. In this case we compute the weight of the sub-mobile as the sum of weights of all its objects, disregarding the weight of the wires and strings. If both Wl and Wr are zero then the following lines define two sub-mobiles: first the left then the right one.

Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

Write `YES' if the mobile is in equilibrium, write `NO' otherwise.

Sample Input

Sample Output

YES

题目意思是：题目大意：给你一个树形的天平，如图所示，根据力矩相等原则判断是否相等。

如果左边的长度为0则该天平有左子天平接下来描述的是此左子天平，然后如果右边的长度为0，则该天平有右子天平

接下来就是描述右子天平的了。如果同时有则先左后右；

思路就是递归输入，然后计算wl*dl 和 wr*dr 如果不平衡了就返回-1，平衡返回 wl*dl+wr*dr;

代码如下：

#include<stdio.h>
int dfs()
{
    int wl,dl,wr,dr;
    scanf("%d%d%d%d",&wl,&dl,&wr,&dr);
    if(wl==0)
        wl=dfs();   //左边递归
    if(wr==0)
        wr=dfs();   //右边递归
    if(wl==-1||wr==-1||wl*dl!=wr*dr)  //天平是否平衡
        return -1; 
    return wl+wr;         //平衡返回 wl*dl+sr*dr;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {

        if(dfs()==-1)         //天平不平衡
            printf("NO\n");
        else
            printf("YES\n");
        if(t)
            printf("\n");
    }
    return 0;
}