Codeforces 639B Bear and Forgotten Tree 3 【构造】

题目链接：Codeforces 639B Bear and Forgotten Tree 3

B. Bear and Forgotten Tree 3
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
A tree is a connected undirected graph consisting of n vertices and n  -  1 edges. Vertices are numbered 1 through n.

Limak is a little polar bear and Radewoosh is his evil enemy. Limak once had a tree but Radewoosh stolen it. Bear is very sad now because he doesn’t remember much about the tree — he can tell you only three values n, d and h:

The tree had exactly n vertices.
The tree had diameter d. In other words, d was the biggest distance between two vertices.
Limak also remembers that he once rooted the tree in vertex 1 and after that its height was h. In other words, h was the biggest distance between vertex 1 and some other vertex.
The distance between two vertices of the tree is the number of edges on the simple path between them.

Help Limak to restore his tree. Check whether there exists a tree satisfying the given conditions. Find any such tree and print its edges in any order. It’s also possible that Limak made a mistake and there is no suitable tree – in this case print “-1”.

Input
The first line contains three integers n, d and h (2 ≤ n ≤ 100 000, 1 ≤ h ≤ d ≤ n - 1) — the number of vertices, diameter, and height after rooting in vertex 1, respectively.

Output
If there is no tree matching what Limak remembers, print the only line with “-1” (without the quotes).

Otherwise, describe any tree matching Limak’s description. Print n - 1 lines, each with two space-separated integers – indices of vertices connected by an edge. If there are many valid trees, print any of them. You can print edges in any order.

Examples
input
5 3 2
output
1 2
1 3
3 4
3 5
input
8 5 2
output
-1
input
8 4 2
output
4 8
5 7
2 3
8 1
2 1
5 6
1 5
Note
Below you can see trees printed to the output in the first sample and the third sample.

题意：构造一棵节点数为n、直径为d、高度为h的树。1为root。

思路：首先特判不存在的情况，对于存在的情况，我们总是去找一条以root为起点的最长链h和一条以root为起点的长度为d-h的链，若root存在两个分支，那么把剩余的节点全部当做root的儿子，反之把剩余节点全部接到root的唯一孩子上。

AC代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>
#include <cmath>
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
#define CLR(a, b) memset(a, (b), sizeof(a))
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
const int MAXN = 2*1e5 + 10;
void add(LL &x, LL y) { x += y; x %= MOD; }
int main()
{
    int n, d, h;
    while(scanf("%d%d%d", &n, &d, &h) != EOF) {
        int th;
        if(d & 1) {
            th = d / 2 + 1;
        }
        else {
            th = d / 2;
        }
        if(h < th || h > d) {
            printf("-1\n");
            continue;
        }
        if(d == 1 && n != 2) {
            printf("-1\n");
            continue;
        }
        int node = 2;
        for(int i = 1; i <= h; i++) {
            printf("%d %d\n", node-1, node);
            node++;
        }
        for(int i = 1; i <= d-h; i++) {
            if(i == 1) {
                printf("%d %d\n", 1, node);
            }
            else {
                printf("%d %d\n", node-1, node);
            }
            node++;
        }
        int root = 2;
        if(d-h) {
            root = 1;
        }
        for(int i = d+2; i <= n; i++) {
            printf("%d %d\n", root, node);
            node++;
        }
    }
    return 0;
}