zoukankan      html  css  js  c++  java
  • D. Bear and Two Paths(贪心构造)

    D. Bear and Two Paths
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard 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.

    题意:看a,b之间,c,d之间是否遍历所有顶点且一次后有路,且路的数目不超过K.

    题解:

    构造一条a,c……d,b的路

    和一条   c,a……b,d的路,最少需要n+1条,所以k>=n+1  且n == 4时,a,b之间和c,d之间都不能有通路,所以n == 4怎么都不行。

     1 #include <iostream>
     2 #include <cstdio>
     3 #include <algorithm>
     4 #include <cstring>
     5 using namespace std;
     6 int vis[1005];
     7 void solve(){
     8     int n,k;
     9     int a,b,c,d;
    10     scanf("%d %d",&n,&k);
    11     scanf("%d%d%d%d",&a,&b,&c,&d);
    12     if(n == 4 || k<n+1) printf("-1
    ");
    13     else{
    14         vis[a] = vis[b] = vis[c] = vis[d] = 1;
    15         printf("%d %d ",a,c);
    16         for(int i = 1; i<=n; i++){
    17             if(!vis[i]) printf("%d ",i);
    18         }
    19         printf("%d %d
    ",d,b);
    20         printf("%d %d ",c,a);
    21         for(int i = 1; i<=n; i++){
    22             if(!vis[i]) printf("%d ",i);
    23         }
    24         printf("%d %d
    ",b,d);
    25     }
    26 }
    27 int main()
    28 {
    29     solve();
    30     return 0;
    31 }
  • 相关阅读:
    hdu 4777 树状数组+合数分解
    hdu5635 BestCoder Round #74 (div.2)
    hdu 5636 搜索 BestCoder Round #74 (div.2)
    hdu 5637 BestCoder Round #74 (div.2)
    hdu4605 树状数组+离散化+dfs
    hdu4521 线段树+dp
    hdu3340 线段树+多边形
    孜孜不倦,必能求索;风尘仆仆,终有归途。
    增加、删除类文件或者在一个类中增加、删除方法时,是不能够热部署到服务上的。这时候需要停止服务器重新部署后再启动,就不会出现上面的提示了。
    为什么jdk1.8不支持sql.append,该如何解决
  • 原文地址:https://www.cnblogs.com/littlepear/p/5487879.html
Copyright © 2011-2022 走看看