CCPC-Wannafly Winter Camp Day5 (Div2, onsite) A Cactus Draw DFS

A - Cactus Draw

把节点的深度做x坐标，儿子序做y坐标，进行DFS遍历，因为是棵树所以肯定不会交边

#include<stdio.h>
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+10;
struct edge{
    int v,next;
}e[maxn];
int head[maxn],hcnt=0;
int u[maxn],v[maxn];
void add(int u,int v){
    e[hcnt]=edge{v,head[u]};
    head[u]=hcnt++;
}
pair<int,int> point[maxn];
bool vi[maxn];
int vis[maxn];
void dfs(int u,int x){
    if(vi[u])return;
    vi[u]=1;
    if(!vis[x])
    vis[x]=1;
    point[u]=make_pair(x,vis[x]++);
    for(int i=head[u];i>=0;i=e[i].next){
        int v=e[i].v;
        if(vi[v])continue;
        dfs(v,x+1);
    }
}
int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    memset(head,-1,sizeof(head));
    for(int i=1;i<=m;i++)
    scanf("%d%d",&u[i],&v[i]),add(u[i],v[i]),add(v[i],u[i]);
    dfs(1,1);
    for(int i=1;i<=n;i++)
    cout<<point[i].first<<' '<<point[i].second<<endl;
    return 0;
}