CodeForces 417C（RCC 2014 Warmup (Div. 2) C）（构造）

最新推荐文章于 2019-07-14 11:29:15 发布

huatian5

最新推荐文章于 2019-07-14 11:29:15 发布

阅读量772

点赞数

分类专栏：模拟构造规律二分三分文章标签：构造思路

本文链接：https://blog.csdn.net/huatian5/article/details/52692846

版权

模拟构造规律二分三分专栏收录该内容

111 篇文章 0 订阅

订阅专栏

One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided inton teams and played several matches, two teams could not play against each other more than once.

The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.

Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.

Input

The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).

Output

In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers a_i and b_i (1 ≤ a_i, b_i ≤ n; a_i ≠ b_i). The numbers a_i and b_i mean, that in the i-th match the team with number a_i won against the team with number b_i. You can assume, that the teams are numbered from 1 to n.

If a tournir that meets the conditions of the problem does not exist, then print -1.

题意（题意很重要）：

1.n个足球队伍，每个队伍赢得k场比赛

2.输出比赛次数以及每次的胜负方。
3.如果没有满足的情况就输出-1

思路：

1.先看n和k是否满足情况，每个人最多可以赢n-1次，所以n-1一定大于等于k，否则就会有重复的胜负方出现

2.输出很宽松（cf的数据就是强）

悲催的没有理解好题意，-1没判断好。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main()
{
    int n,k;
    cin >> n >> k;
    if((n-1)/2 < k)
        return 0*printf("-1\n");
    printf("%d\n",n*k);

    for(int kk = 1;kk <= k;kk++)
    {
        for(int i = 1;i <= n;i++)
        {
            printf("%d ",i);
            if((i + kk) % n != 0)
                printf("%d\n",(i+kk)%n);
            else
                printf("%d\n",n);
        }
    }
    return 0;
}