题目链接:http://codeforces.com/contest/761/problem/E
题意:给你一颗树,问你能否把这颗树放在二维坐标轴上,且每条边都与x或y轴平行,且每条边不可以重合,点也不能重合,如果可以请输出每个点的坐标
解析:其实这是一道很容易就想到的搜索题,奈何我一直姿势不对,WA成傻逼,首先如果一个点度数超过4那肯定是不行的,然后你随便选一个点,去做dfs,按照一个方向开始四处扩撒,不过点与点之间的距离应该一开始打,后面小,否则会有相同坐标出现
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
using namespace std;
const int maxn = 1e6+100;
const int inf = 0x7ffffff;
struct node
{
int x,y;
node() {}
node(int _x,int _y)
{
x = _x;
y = _y;
}
}ans[maxn];
vector<int>G[maxn];
int dx[] = {1,0,-1,0};
int dy[] = {0,-1,0,1};
int vis[maxn];
void dfs(int u,int x,int y,int dir,int num)
{
if(vis[u])
return;
vis[u] = 1;
int tmp = 0;
for(int i=0;i<G[u].size();i++)
{
int v = G[u][i];
if(vis[v])
continue;
if(tmp==dir)
tmp = (tmp+1)%4;
int tx = x+dx[tmp]*(1<<num);
int ty = y+dy[tmp]*(1<<num);
ans[v] = node(tx,ty);
dfs(v,tx,ty,(tmp+2)%4,num-1);
tmp = (tmp+1)%4;
}
}
int main(void)
{
int n;
scanf("%d",&n);
for(int i=0;i<n-1;i++)
{
int u,v;
scanf("%d %d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
}
int flag = 1;
for(int i=1;i<=n;i++)
{
if(G[i].size()>4)
{
flag = 0;
puts("NO");
break;
}
}
if(flag)
{
puts("YES");
memset(vis,0,sizeof(vis));
ans[1] = node(0,0);
dfs(1,0,0,-1,30);
for(int i=1;i<=n;i++)
printf("%d %d\n",ans[i].x,ans[i].y);
}
return 0;
}