Codeforces Round #480 (Div. 2) B. Marlin

最新推荐文章于 2020-02-21 18:58:35 发布

ffcf

最新推荐文章于 2020-02-21 18:58:35 发布

阅读量191

点赞数

分类专栏：大学生活之ACM比赛

本文链接：https://blog.csdn.net/feifancaicai/article/details/80276454

版权

大学生活之ACM比赛专栏收录该内容

51 篇文章 0 订阅

订阅专栏

The city of Fishtopia can be imagined as a grid of $4$ rows and an odd number of columns. It has two main villages; the first is located at the top-left cell $(1, 1)$ , people who stay there love fishing at the Tuna pond at the bottom-right cell $(4, n)$ . The second village is located at $(4, 1)$ and its people love the Salmon pond at $(1, n)$ .

The mayor of Fishtopia wants to place $k$ hotels in the city, each one occupying one cell. To allow people to enter the city from anywhere, hotels should not be placed on the border cells.

A person can move from one cell to another if those cells are not occupied by hotels and share a side.

Can you help the mayor place the hotels in a way such that there are equal number of shortest paths from each village to its preferred pond?

Input

The first line of input contain two integers, $n$ and $k$ ( $3 \leq n \leq 99$ , $0 \leq k \leq 2 \times (n - 2)$ ), $n$ is odd, the width of the city, and the number of hotels to be placed, respectively.

Output

Print "YES", if it is possible to place all the hotels in a way that satisfies the problem statement, otherwise print "NO".

If it is possible, print an extra $4$ lines that describe the city, each line should have $n$ characters, each of which is "#" if that cell has a hotel on it, or "." if not.

          Examples 
        

            input 
           
             Copy 
           
7 2

            output 
           
             Copy 
           
YES
.......
.#.....
.#.....
.......

            input 
           
             Copy 
           
5 3

            output 
           
             Copy 
           
YES
.....
.###.
.....
.....

当时做的时候没读懂题意，理解成最短路径的长度，结果错了好几次，最后少考虑一种情况直接gg了

思路：图形应该上下对称或左右对称如果

大佬代码

#include<bits/stdc++.h>

using namespace std;

const int maxi=1e6+2;

vector<int> v[maxi];
int a[maxi];
string s;
int  d[100][100];
int main()
{

   int n,k;
   cin>>n>>k;

   printf("YES\n");

   if (k%2==0){
    for (int j=2;j<=2+k/2-1;j++)
        for (int i=2;i<=3;i++)
            d[i][j]=1;
   } else
   {
       k--;
       d[2][n/2+1]=1;
       for (int i=2;i<=n;i++)
        for (int j=2;j<=3;j++)
       {
          if (k>0)
          {
              d[j][i]=1;
              d[j][n-i+1]=1;
              k-=2;
          }
       }
   }


   for (int i=1;i<=4;i++)
   {
       for (int j=1;j<=n;j++)
        if (d[i][j]) printf("#"); else printf(".");

       printf("\n");
   }

    return 0;
}