Find a way

N - Find a way

 
思路:两次bfs,分别计算出到达‘@’要花费的时间,然后相加。注意可能到达不了‘@’。
代码:
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
int n,m;
char maze[202][202];
int tag[202][202],c[202][202];//数组tag用来标记是否走过,数组c用来标记需要花的步数
int go[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
struct node
{
    int x;
    int y;
    int step;
};
void bfs(int i,int j)
{
    node a,b;
    queue<node>q;
    a.x=i;
    a.y=j;
    a.step=0;
    q.push(a);
    while(!q.empty())
    {
        a=q.front();
        q.pop();
        b.step=a.step+1;
        for(int i=0;i<4;i++)
        {
            b.x=a.x+go[i][0];
            b.y=a.y+go[i][1];
            if(maze[b.x][b.y]=='#'||b.x<0||b.y<0||b.x>=n||b.y>=m)//出界或者是为障碍物
                continue;
            if(tag[b.x][b.y]!=0)//曾经走过
                continue;
            tag[b.x][b.y]=1;
            c[b.x][b.y]+=b.step;//每个人走的步数相加
            q.push(b);
        }
    }
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        int ma=500;
        memset(maze,0,sizeof(maze));
        memset(c,0,sizeof(c));
        for(int i=0;i<n;i++)
            scanf("%s",maze[i]);
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(maze[i][j]=='Y'||maze[i][j]=='M')
                {
                    memset(tag,0,sizeof(tag));
                    bfs(i,j);
                }

            }
        }
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(maze[i][j]=='@'&&c[i][j]<=ma&&c[i][j]!=0)
                    ma=c[i][j];
            }
        }
        printf("%d\n",ma*11);
    }
    return 0;
}

You and your team have worked tirelessly until you have a sequence a1,a2,…,a2n+1 of positive integers satisfying these properties. 1≤ai≤1018 for all 1≤i≤2n+1 . a1,a2,…,a2n+1 are pairwise distinct. a1=a2−a3+a4−a5+…+a2n−a2n+1 . However, the people you worked with sabotaged you because they wanted to publish this sequence first. They deleted one number from this sequence and shuffled the rest, leaving you with a sequence b1,b2,…,b2n . You have forgotten the sequence a and want to find a way to recover it. If there are many possible sequences, you can output any of them. It can be proven under the constraints of the problem that at least one sequence a exists.    Input Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤104 ). The description of the test cases follows. The first line of each test case contains one integer n (1≤n≤2⋅105 ). The second line of each test case contains 2n distinct integers b1,b2,…,b2n (1≤bi≤109 ), denoting the sequence b . It is guaranteed that the sum of n over all test cases does not exceed 2⋅105 .    Output For each test case, output 2n+1 distinct integers, denoting the sequence a (1≤ai≤1018 ). If there are multiple possible sequences, you can output any of them. The sequence a should satisfy the given conditions, and it should be possible to obtain b after deleting one element from a and shuffling the remaining elements. Example InputCopy 4 1 9 2 2 8 6 1 4 3 99 2 86 33 14 77 2 1 6 3 2 OutputCopy 7 9 2 1 8 4 6 9 86 99 2 77 69 14 33 4 6 1 2 3
最新发布
03-11
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值