UVa 839 Not so Mobile (DFS二叉树)
2013-10-24 19:31
351 查看
839 - Not so Mobile
Time limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=104&page=show_problem&problem=780
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.
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.
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
1 0 2 0 4 0 3 0 1 1 1 1 1 2 4 4 2 1 6 3 2
Sample Output
YES
简单dfs。
完整代码:
/*0.076s*/ #include<cstdio> bool flag; int dfs() { int wl, dl, wr, dr; scanf("%d%d%d%d", &wl, &dl, &wr, &dr); if (!wl) wl = dfs(); if (!wr) wr = dfs(); if (wl * dl != wr * dr) flag = false; return wl + wr; } int main() { int t; scanf("%d", &t); while (t--) { flag = true; dfs(); puts(flag ? "YES" : "NO"); if (t) putchar(10); } return 0; }
相关文章推荐
- UVa - 839 - Not so Mobile(二叉树的DFS)
- uva839-Not so Mobile-二叉树的DFS
- UVA 839 Not so Mobile(二叉树|DFS)
- UVA 839 - Not so Mobile(dfs就可以)
- UVa 839 (递归方式读取二叉树) Not so Mobile
- uva839 Not so Mobile (重建二叉树)
- UVA 839 Not so Mobile(二叉树经典题)
- UVA 839 Not so Mobile (递归建立二叉树)
- UVA839 Not so Mobile【二叉树】【递归】
- 例题6-9UVA839 - Not so Mobile 递归访问二叉树
- Uva-839 - Not so Mobile
- uva 839 not so mobile——yhx
- UVa 839 Not so Mobile
- 例题6-9 UVa839 Not so Mobile(树)
- UVA839 - Not so Mobile
- uva 839 Not so Mobile
- UVa839 Not so Mobile
- uva839 Not so Mobile
- UVA - 839 Not so Mobile
- uva 839 Not so Mobile-S.B.S.