zoukankan      html  css  js  c++  java
  • Codeforces 761E(DFS)

    E. Dasha and Puzzle
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve. 

    The tree is a non-oriented connected graph without cycles. In particular, there always are n - 1 edges in a tree with n vertices.

    The puzzle is to position the vertices at the points of the Cartesian plane with integral coordinates, so that the segments between the vertices connected by edges are parallel to the coordinate axes. Also, the intersection of segments is allowed only at their ends. Distinct vertices should be placed at different points. 

    Help Dasha to find any suitable way to position the tree vertices on the plane.

    It is guaranteed that if it is possible to position the tree vertices on the plane without violating the condition which is given above, then you can do it by using points with integral coordinates which don't exceed 1018 in absolute value.

    Input

    The first line contains single integer n (1 ≤ n ≤ 30) — the number of vertices in the tree. 

    Each of next n - 1 lines contains two integers uivi (1 ≤ ui, vi ≤ n) that mean that the i-th edge of the tree connects vertices ui and vi.

    It is guaranteed that the described graph is a tree.

    Output

    If the puzzle doesn't have a solution then in the only line print "NO".

    Otherwise, the first line should contain "YES". The next n lines should contain the pair of integers xiyi (|xi|, |yi| ≤ 1018) — the coordinates of the point which corresponds to the i-th vertex of the tree.

    If there are several solutions, print any of them. 

    Examples
    input
    7
    1 2
    1 3
    2 4
    2 5
    3 6
    3 7
    output
    YES
    0 0
    1 0
    0 1
    2 0
    1 -1
    -1 1
    0 2
    input
    6
    1 2
    2 3
    2 4
    2 5
    2 6
    output
    NO
    input
    4
    1 2
    2 3
    3 4
    output
    YES
    3 3
    4 3
    5 3
    6 3
    Note

    In the first sample one of the possible positions of tree is: 

    直接向4个方向模拟按长度从大到小DFS即可

    #include<iostream>
    #include<cstdio>
    #include<cmath>
    #include<cstdlib>
    #include<algorithm>
    #include<cstring>
    #include<string>
    #include<vector>
    #include<map>
    #include<set>
    #include<queue>
    using namespace std;
    int n;
    vector<int> a[101];
    long long ansx[101],ansy[101];
    long long p[41];
    const int d1[4]={0,1,0,-1};
    const int d2[4]={1,0,-1,0};
    void dfs(int x,int fa,int d,int cnt)
    {
        vector<int>::iterator iter;
        for (iter=a[x].begin();iter!=a[x].end();iter++)
        {
            int y=*iter;
            if (y==fa) continue;
            ansx[y]=ansx[x]+d1[(d+3)%4]*p[cnt];
            ansy[y]=ansy[x]+d2[(d+3)%4]*p[cnt];
            dfs(y,x,(d+3)%4,cnt-1);
            d++;
        }
    }
    int main()
    {
        scanf("%d",&n);
        int i;
        p[0]=1ll;
        for (i=1;i<=40;i++) p[i]=p[i-1]<<1;
        for (i=1;i<n;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            a[x].push_back(y);
            a[y].push_back(x);
        }
        for (i=1;i<=n;i++)
            if (a[i].size()>4)
            {
                puts("NO");
                return 0;
            }
        dfs(1,0,0,40);
        puts("YES");
        for (i=1;i<=n;i++)
            printf("%lld %lld
    ",ansx[i],ansy[i]);
        return 0;
    }
  • 相关阅读:
    power designer 水电费缴纳系统的设计
    水电费管理系统需求分析----表格的建立
    GUID
    Java对象的序列化
    模拟银行自动终端系统
    随便选择两个城市作为预选旅游目标。实现两个独立的线程分别显示10次城市名,每次显示后休眠一段随机时间(1000ms以内),哪个先显示完毕,就决定去哪个城市。分别用Runnable接口和Thread类实现。
    Cookie的简易用法
    工作任务:题目一:网页输出九九乘法表;题目二:网页输出三角形和菱形
    简单的sql注入
    10-18 Oracle 基础练习
  • 原文地址:https://www.cnblogs.com/hnqw1214/p/6476121.html
Copyright © 2011-2022 走看看