题目链接:http://codeforces.com/contest/1003/problem/E
题解:
先特判k=1以及D>n-1的情况.然后根据D的奇偶性,奇数时根的有一颗子树的深度跟其他子树不一样。dfs构造时特判一下即可。
#include"bits/stdc++.h"
using namespace std;
const int MX = 4e5+7;
int n,D,K;
struct node{
int u,v;
node(){}
node(int x, int y) : u(x), v(y){}
}p[MX];
int tt;
int dep[MX],du[MX];
bool flag[MX];
vector<int> G[MX];
int get_chain()
{
int u = 1;
int d = D;
while(d--){
p[++tt] = node(u,u+1);
G[u].push_back(u+1);
G[u+1].push_back(u);
++u;
}
return (D+1)/2+1;
}
void dfs(int &st,int u, int x, int fa, int dep)
{
if(flag[u] && dep >= (D+1)/2 || (!flag[u] && dep >= D/2) ) return;
while(G[u].size() < K){
if(st > n) return;
G[u].push_back(st);
G[st].push_back(u);
flag[st] |= flag[u];
p[++tt] = node(u,st);
st++;
}
for(int i = 0; i < G[u].size(); i++){
int v = G[u][i];
if(v != fa) dfs(st,v,x,u,dep+1);
if(st > n) return;
}
}
bool work()
{
int x = get_chain();
for(int i = 1; i < x; i++)
flag[i] = 1;
int st = D+2;
dfs(st,x,x,0,0);
if(st <= n) return 0;
else return 1;
}
int main()
{
scanf("%d%d%d",&n,&D,&K);
if(n-1 < D || (K == 1 && D > 1) ){
puts("NO");
return 0;
}
if(work()){
puts("YES");
for(int i = 1; i <= tt; i++)
printf("%d %d\n",p[i].u, p[i].v);
}
else puts("NO");
return 0;
}