例题6-9 天平 UVa 839 递归

Not soMobile 

Before being an ubiquous communications gadget, amobile was just a structure made of strings and wiressuspending colourfull things. This kind of mobile is usually foundhanging over cradles of small babies.

The figure illustrates a simple mobile. It is just a wire,suspended by a string, with an object on each side. It can also beseen as a kind of lever with the fulcrum on the point where thestring ties the wire. From the lever principle we know that tobalance a simple mobile the product of the weight of the objects bytheir distance to the fulcrum must be equal. That is W_l×D_l =W_r×D_r where D_l is the left distance,D_r is the rightdistance, W_l is theleft weight and W_r isthe right weight.

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

Input 

The input begins with a single positive integer on a line byitself indicating the number of the cases following, each of themas described below. This line is followed by a blank line, andthere is also a blank line between two consecutive inputs.

The input is composed of several lines, each containing 4integers separated by a single space. The 4 integers represent thedistances of each object to the fulcrum and their weights, in theformat: W_l D_l W_r D_r

If W_l orW_r is zero then thereis a sub-mobile hanging from that end and the following linesdefine the the sub-mobile. In this case we compute the weight ofthe sub-mobile as the sum of weights of all its objects,disregarding the weight of the wires and strings. If bothW_l and W_r are zero then the followinglines define two sub-mobiles: first the left then the rightone.

Output 

For each test case, the output must follow the descriptionbelow. The outputs of two consecutive cases will be separated by ablank line.

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

SampleInput 

1 

0 2 0 4 

0 3 0 1 

1 1 1 1 

2 4 4 2 

1 6 3 2

SampleOutput 

YES

分析：递归求解，输入是递归先序输入。一个节点的重量是其子树的重量和，所以需要加起来才能判断某个节点的重量

#include<iostream>
using namespace std;
bool solve(int& w)
{
    int w1,d1,w2,d2;
    bool b1=true,b2=true;
    cin>>w1>>d1>>w2>>d2;
    if(!w1)b1=solve(w1);
    if(!w2)b2=solve(w2);
    w=w1+w2;
    return b1&&b2&&(w1*d1==w2*d2);
}
int main()
{
    int T,W;
    cin>>T;
    while(T--){
        if(solve(W))cout<<"YES\n";
        else cout<<"NO\n";
        if(T)cout<<"\n";
    }
}