CodeForces 673D - Bear and Two Paths(构造)

D. Bear and Two Paths
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Bearland has n cities, numbered 1 through n. Cities are connected via bidirectional roads. Each road connects two distinct cities. No two roads connect the same pair of cities.

Bear Limak was once in a city a and he wanted to go to a city b. There was no direct connection so he decided to take a long walk, visiting each city exactly once. Formally:

There is no road between a and b.
There exists a sequence (path) of n distinct cities v1, v2, …, vn that v1 = a, vn = b and there is a road between vi and vi + 1 for .
On the other day, the similar thing happened. Limak wanted to travel between a city c and a city d. There is no road between them but there exists a sequence of n distinct cities u1, u2, …, un that u1 = c, un = d and there is a road between ui and ui + 1 for .

Also, Limak thinks that there are at most k roads in Bearland. He wonders whether he remembers everything correctly.

Given n, k and four distinct cities a, b, c, d, can you find possible paths (v1, …, vn) and (u1, …, un) to satisfy all the given conditions? Find any solution or print -1 if it’s impossible.

Input
The first line of the input contains two integers n and k (4 ≤ n ≤ 1000, n - 1 ≤ k ≤ 2n - 2) — the number of cities and the maximum allowed number of roads, respectively.

The second line contains four distinct integers a, b, c and d (1 ≤ a, b, c, d ≤ n).

Output
Print -1 if it’s impossible to satisfy all the given conditions. Otherwise, print two lines with paths descriptions. The first of these two lines should contain n distinct integers v1, v2, …, vn where v1 = a and vn = b. The second line should contain n distinct integers u1, u2, …, un where u1 = c and un = d.

Two paths generate at most 2n - 2 roads: (v1, v2), (v2, v3), …, (vn - 1, vn), (u1, u2), (u2, u3), …, (un - 1, un). Your answer will be considered wrong if contains more than k distinct roads or any other condition breaks. Note that (x, y) and (y, x) are the same road.

Examples
input
7 11
2 4 7 3
output
2 7 1 3 6 5 4
7 1 5 4 6 2 3
input
1000 999
10 20 30 40
output
-1
Note
In the first sample test, there should be 7 cities and at most 11 roads. The provided sample solution generates 10 roads, as in the drawing. You can also see a simple path of length n between 2 and 4, and a path between 7 and 3.

题意：
给出n个点，和两条路径，起点终点是 a,b c,d。
要求构造一个图，使得a和b间，c和d间都没有直接连接的边，且总的边数不超过k。

解题思路：
最短的路径就
ac…db
ca…bd
这样就保证了a和b没有直接边，c和d没有直接边，同时边的个数为n+1.

AC代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    int a,b,c,d;
    scanf("%d%d%d%d",&a,&b,&c,&d);
    if(n == 4 || k < n+1)   printf("-1");
    else
    {
        printf("%d %d",a,c);
        for(int i = 1;i <= n;i++)   if(i != a && i != b && i!= c && i != d) printf(" %d",i);
        printf(" %d %d\n",d,b);
        printf("%d %d",c,a);
        for(int i = 1;i <= n;i++)   if(i != a && i != b && i!= c && i != d) printf(" %d",i);
        printf(" %d %d\n",b,d);
    }
    return 0;
}