poj 2814

 

Mobiles

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 191		Accepted: 43

Description

Alabama Mobiles Inc. designs and manufactures mobiles, lightweight ``kinetic sculptures" consisting of a bar hanging from a string tied about its center. From each end of the bar hangs a string supporting either a small decorative object of some kind or another, smaller mobile. A well-designed mobile must have the weights of all the decorative items balanced, so that each bar in the mobile will naturally tend to hang horizontally. In addition, the lengths of the bars must be chosen so that each bar can rotate freely without striking the other bars, decorative objects, or the strings connecting them. 

Write a program to read a partial design for a new mobile and determine if it can be balanced and if, once balanced, the elements will swing freely without bumping or entangling with one another. 

Each mobile will be described as a collection of bars and decorative objects. You will be given the lengths of the bars, the weights of all but one object, and all information on how the bars and objects are connected to one another. You may assume that the bars are made of a lightweight material so that their weight and the weight of the connecting strings are negligible compared to the weights of the decorative objects. You should assume that all connecting strings are of the same length. Every mobile will have at least one bar.

Input

The input consists of a number of mobile design specifications. Each mobile design is given as a series of numbered elements, beginning with number 1 and increasing sequentially until the end of the specification. 

Each element is described on one line, beginning with the the element number. The next nonblank character will be either `B' or `D' to indicate that the element is a bar or a decorative object, respectively. 

If the element is a bar, the `B' indicator is followed by a floating-point number denoting the length of the bar, and then two integers giving the element numbers of the two elements hanging from the two ends of the bar. Every element in the input except the top bar will listed as hanging from one end of some bar. 

If the element is a decorative object, the `D' is followed either by a single floating point number denoting the weight of that object or by the character `X' indicating that the weight of that object has not been determined. There will be exactly one `X' object in each mobile specification. 

In each line describing an element, the numbers and characters making up that line are separated by one or more blank spaces. 

The end of a specification is indicated by a line containing a non-positive value in the place of the element number. If that number is negative, it indicates the end of the final mobile specification in the input file.

Output

For each mobile specification, the program should print one or two lines of output. The first will either be 


Object M must have weight NN 


or 

The mobile cannot be balanced. 

where M is replaced by the element number of the `X' object and NN by the weight for that element that will balance the entire mobile (printed with two digits after the decimal point.) The second alternative should be printed if and only if no positive weight exists that will balance the mobile. 

If the mobile can be balanced, the second line of output will either be 

The mobile will swing freely. 

or 

The mobile will not swing freely. 

depending upon whether, when the strings are hanging straight down, all bars are separated by a positive distance no matter how they swing around on the string.

Sample Input

1 B 4.0 2 5 
2 D 6.0 
3 D X 
4 D 3.0 
5 B 3.0 3 4
-1

Sample Output

Object 3 must have weight 3.00 
The mobile will swing freely.

Source

Mid-Atlantic 2005

分析：把整个系统看成一棵二叉树，

          1.判断系统是否平衡：遍历一下二叉树，看左子树与右子树是否重量相等（当子树为未知值时要特判，并算出值）

          2.判断系统能否自由旋转：遍历一遍二叉树，记录每一个节点的子树中每层能旋转到的最左端和最右端，

             判断左右子树的每一层会不会相交

#include <cstdlib> #include <iostream> using namespace std; const int maxn=2011; bool flag,p[maxn]; int root,n,num,ln[maxn],rn[maxn],tier[maxn],m; double lenwei[maxn],get[maxn][maxn]; char kind[maxn],c[30]; double checkbalance(int x) { if(flag)return(0); if(kind[x]=='B') { double lw,rw; lw=checkbalance(ln[x]); rw=checkbalance(rn[x]); if(ln[x]==m)lw=rw,lenwei[ln[x]]=lw; else if(rn[x]==m)rw=lw,lenwei[rn[x]]=rw; if(lw!=rw)flag=1; return(lw+rw); } else if(x==m)return(0); else return(lenwei[x]); } void checkfree(int x) { if(flag)return; tier[x]=1; if(kind[x]=='B') { get[x][1]=lenwei[x]/2; checkfree(ln[x]); checkfree(rn[x]); tier[x]=max(tier[ln[x]],tier[rn[x]]); for(int i=tier[x];i>0;--i) if(get[ln[x]][i]+get[rn[x]][i]>=lenwei[x]) { flag=1; return; } for(int i=1;i<=tier[ln[x]];++i) if(get[x][i+1]<get[ln[x]][i])get[x][i+1]=get[ln[x]][i]; for(int i=1;i<=tier[rn[x]];++i) if(get[x][i+1]<get[rn[x]][i])get[x][i+1]=get[rn[x]][i]; ++tier[x]; for(int i=2;i<=tier[x];++i)get[x][i]+=get[x][1]; } return; } int main(int argc, char** argv) { //freopen("car.in","r",stdin); //freopen("car.out","w",stdout); scanf("%d",&num); while(num!=-1) { memset(p,true,sizeof(p));n=0; while((num!=0)&&(num!=-1)) { if(num>n)n=num; scanf(" %c",&kind[num]); if(kind[num]=='B') { scanf("%lf%d%d",&lenwei[num],&ln[num],&rn[num]); p[ln[num]]=0; p[rn[num]]=0; } else { scanf(" %s",&c); if(c[0]=='X')m=num; else sscanf(c,"%lf",&lenwei[num]); } scanf("%d",&num); } for(int i=1;i<n;++i)if(p[i])root=i; flag=0; checkbalance(root); if(flag)printf("The mobile cannot be balanced./n"); else { printf("Object %d must have weight %0.2lf/n",m,lenwei[m]); memset(get,0,sizeof(get)); checkfree(root); if(flag)printf("The mobile will not swing freely./n"); else printf("The mobile will swing freely./n"); } if(num==0)scanf("%d",&num); } return 0; }