uva 839 - Not so Mobile

最新推荐文章于 2020-07-25 23:59:41 发布

轩怡沫

最新推荐文章于 2020-07-25 23:59:41 发布

阅读量452

点赞数

分类专栏： tree

本文链接：https://blog.csdn.net/u010652938/article/details/17059295

版权

tree 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <cstring>
#include <cstdlib>
#define maxn 20000+10
using namespace std;
struct node {
    int data;
    int ld, rd;
    node *l, *r;
};
bool ok;
void dfs(node *t)
{
    if(!ok) return;
    if(t == NULL) return;
    if(t->l == NULL && t->r == NULL) return;
    dfs(t->l);
    dfs(t->r);
    if(t->l->data != 0 && t->r->data != 0)
    {
        //printf("%d %d\n", t->l->data, t->r->data);
        t->data = t->l->data + t->r->data;
        //printf("%d * %d = %d, %d * %d = %d\n", t->l->data, t->ld, t->l->data*t->ld, t->r->data, t->rd, t->r->data*t->rd);
        if(t->r->data*t->rd != t->l->data*t->ld)
            ok = false;
    }
    return;
}
node* &build()
{
    node *t;
    t = (node*)malloc(sizeof(node));
    int a, b, c, d;
    scanf("%d%d%d%d", &a, &b, &c, &d);
    t->ld = b;
    t->rd = d;
    t->l = (node*)malloc(sizeof(node));
    t->r = (node*)malloc(sizeof(node));
    t->l->data = a;
    t->r->data = c;
    if(a == 0) t->l = build();
    else t->l->l = NULL, t->l->r = NULL;
    if(c == 0) t->r = build();
    else t->r->l = NULL, t->r->r = NULL;
    return t;
}

int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        node *tree;
        tree = build();
        ok = true;
        dfs(tree);
        if(ok) puts("YES");
        else puts("NO");
        if(t) printf("\n");
    }
    return 0;
}