8VC Venture Cup 2017 - Elimination Round E. PolandBall and White-Red graph【枚举思维】

最新推荐文章于 2017-10-04 18:44:00 发布

mengxiang000000

最新推荐文章于 2017-10-04 18:44:00 发布

阅读量514

点赞数

分类专栏：思维文章标签： 8VC Venture Cup

本文链接：https://blog.csdn.net/mengxiang000000/article/details/54576858

版权

思维专栏收录该内容

692 篇文章 0 订阅

订阅专栏

PolandBall has an undirected simple graph consisting of n vertices. Unfortunately, it has no edges. The graph is very sad because of that. PolandBall wanted to make it happier, adding some red edges. Then, he will add white edges in every remaining place. Therefore, the final graph will be a clique in two colors: white and red.

Colorfulness of the graph is a value min(d_r, d_w), where d_r is the diameter of the red subgraph and d_w is the diameter of white subgraph. The diameter of a graph is a largest value d such that shortest path between some pair of vertices in it is equal to d. If the graph is not connected, we consider its diameter to be -1.

PolandBall wants the final graph to be as neat as possible. He wants the final colorfulness to be equal to k. Can you help him and find any graph which satisfies PolandBall's requests?

Input

The only one input line contains two integers n and k (2 ≤ n ≤ 1000, 1 ≤ k ≤ 1000), representing graph's size and sought colorfulness.

Output

If it's impossible to find a suitable graph, print -1.

Otherwise, you can output any graph which fulfills PolandBall's requirements. First, output m — the number of red edges in your graph. Then, you should output m lines, each containing two integers a_i and b_i, (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i) which means that there is an undirected red edge between vertices a_i and b_i. Every red edge should be printed exactly once, you can print the edges and the vertices of every edge in arbitrary order.

Remember that PolandBall's graph should remain simple, so no loops or multiple edges are allowed.

Examples

Input

4 1

Output

-1

Input

5 2

Output

Note

In the first sample case, no graph can fulfill PolandBall's requirements.

In the second sample case, red graph is a path from 1 to 5. Its diameter is 4. However, white graph has diameter 2, because it consists of edges 1-3, 1-4, 1-5, 2-4, 2-5, 3-5.

题目大意：

让你构造出来一个图，使得其包含N个点，并且min（G的直径,G的补图的直径）==k;

思路（这个博客写的很好有证明：http://blog.csdn.net/jasonvictoryan/article/details/54572646）：

1、首先明确无向图的直径的定义：对于一个无向图，其任意两点间距离的最大值，就是无向图的直径长度。

2、这种题拿到手没有思路怎么办，不妨枚举出来点情况进行讨论。

通过枚举不难发现：

①k==1的时候无解，k>=4的时候也是无解的。

②k==2的时候我们只要按照第二组样例那样形成一条从1-n的链即可。其N的限制通过枚举也能发现当N<=4的时候无解。

③k==3的时候，我们搞出来一条1-3的链，再将其他孤立点连入节点3即可。其N的限制通过枚举也能发现，当N<=3的时候无解。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        if(m==1||m>=4)
        {
            printf("-1\n");
        }
        else
        {
            if(m==2)
            {
                if(n>=5)
                {
                    printf("%d\n",n-1);
                    for(int i=1;i<=n-1;i++)
                    {
                        printf("%d %d\n",i,i+1);
                    }
                }
                else printf("-1\n");
            }
            else
            {
                if(n>=4)
                {
                    printf("%d\n",n-1);
                    printf("1 2\n2 3\n");
                    for(int i=4;i<=n;i++)
                    {
                        printf("3 %d\n",i);
                    }
                }
                else printf("-1\n");
            }
        }
    }
}