codeforce之Bear and Two Paths

原创 2016年05月31日 11:46:34


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 = avn = 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 = cun = 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 nk and four distinct cities abcd, 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.


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

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


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, ..., unwhere 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.



同时可以画图就可以发下达到要求需要的最少的也是n + 1条路径,为了让路径最少就是要增加路径的复用才可以。

#include <bits/stdc++.h>
using namespace std;
#define Riep(n) for(int i=1;i<=n;i++)
#define Riop(n) for(int i=0;i<n;i++)
#define Rjep(n) for(int j=1;j<=n;j++)
#define Rjop(n) for(int j=0;j<n;j++)
#define mst(ss,b) memset(ss,b,sizeof(ss));
typedef long long LL;
const LL mod=1e9+7;
const double PI=acos(-1.0);
const int inf=0x3f3f3f3f;
const int N=1e5+5;
int n,k,a,b,c,d;
int vis[1005];
int main()
       printf("%d %d ",a,c);
       for(int i=1;i<=n;i++)
               printf("%d ",i);
       printf("%d %d\n",d,b);
       printf("%d %d ",c,a);
       for(int i=1;i<=n;i++)
               printf("%d ",i);
       printf("%d %d \n",b,d);


    return 0;

Codeforces 673D Bear and Two Paths【贪心】

D. Bear and Two Paths time limit per test 2 seconds memory limit per test 256 megabytes i...
  • mengxiang000000
  • mengxiang000000
  • 2017年02月12日 17:28
  • 204

Codeforces 673D Bear and Two Paths (贪心构造)

题意给出n个点,给出a,b,c,d,求能不能用少于m的边构成两条欧拉路 一条从a开始到b一条从c开始到d。思路因为m只有上限没有下限,我们贪心的构造就可以了,也就是说除了a,b,c,d其他的点都用相...
  • Dreamon3
  • Dreamon3
  • 2016年05月08日 19:28
  • 412

CodeForces 643 B.Bear and Two Paths(构造)

Description 给出n个点,要求用至多k条无向边构造出从a到b和从c到d的哈密顿通路,且a和b之间以及c和d之间不能右边,如果存在则输出这两条哈密顿通路,否则输出-1 Input 第一行...
  • V5ZSQ
  • V5ZSQ
  • 2017年04月28日 14:00
  • 175

B. Bear and Friendship Condition----并查集或BFS

B. Bear and Friendship Condition time limit per test 1 second memory limit per test 256 megabyte...
  • bless924295
  • bless924295
  • 2017年03月28日 21:31
  • 336

CodeForces - 673D Bear and Two Paths

D. Bear and Two Paths time limit per test 2 seconds memory limit per test 256 megabytes ...
  • DlPF_C
  • DlPF_C
  • 2017年08月01日 09:14
  • 78

Codeforces 673D Bear and Two Paths

time limit per test 2 seconds memory limit per test 256 megabytes input standard input output ...
  • ffgcc
  • ffgcc
  • 2018年01月26日 14:55
  • 3

Codeforces 907A Masha and Bears

A family consisting of father bear, mother bear and son bear owns three cars. Father bear can climb ...
  • finalcsdn
  • finalcsdn
  • 2017年12月24日 17:17
  • 162

Codeforces Round #405 B.Bear and Friendship Condition【Dfs+思维】

B. Bear and Friendship Condition time limit per test 1 second memory limit per test 256 megabytes ...
  • mengxiang000000
  • mengxiang000000
  • 2017年03月19日 12:28
  • 405

HDU 6181 Two Paths(次短路变形)

题目地址 题意:给你一个图,有两个人比赛,第一个人一定会走最短路,求第二个人最短走多长(路径不能和最短路完全一样) 思路:有两种可能,一种是次短路,还有一种是最短路之中找到一条最短的边再重复走一遍...
  • xjh_shin
  • xjh_shin
  • 2017年08月24日 23:41
  • 311

Codeforces 8D Two Friends 三分+二分+计算几何

题目链接:点击打开链接 题意:点击打开链接 三分house到shop的距离,二分这条斜边到cinema的距离 #include #include #include #include #i...
  • qq574857122
  • qq574857122
  • 2014年06月25日 00:07
  • 1313
您举报文章:codeforce之Bear and Two Paths