NYIST_2013寒假ACM集训队练习赛（2）

最新推荐文章于 2020-12-04 12:29:30 发布

原创

最新推荐文章于 2020-12-04 12:29:30 发布 · 2.1w 阅读

4 ·

CC 4.0 BY-SA版权

文章标签：

#比赛并查集 #Bfs #哈希 #搜索 #优化

本文描述了一家公司需要确保所有员工能够通过间接翻译进行正式沟通的问题。为了解决这个问题，公司需要确定最小的花费，使得每个员工都能用至少一种语言与其他人交流。输入包括员工数和语言数，以及每个员工已知的语言。题目要求计算公司支付学习费用的最小总额，使得任意两个员工之间可以通信。输出是所需支付的总金额。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

集训第二周周四，做出来了7道题目，题目非常水，还有几道没有A出来的也不难，完了花点时间水一下，a过的题目贴在这里。没有a的后面补上。

比赛链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=39441#overview 密码：nyist

I - I

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status Practice HDU 1242

Description

Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.

Angel's friends want to save Angel. Their task is: approach Angel. We assume that "approach Angel" is to get to the position where Angel stays. When there's a guard in the grid, we must kill him (or her?) to move into the grid. We assume that we moving up, down, right, left takes us 1 unit time, and killing a guard takes 1 unit time, too. And we are strong enough to kill all the guards.

You have to calculate the minimal time to approach Angel. (We can move only UP, DOWN, LEFT and RIGHT, to the neighbor grid within bound, of course.)

Input

First line contains two integers stand for N and M.

Then N lines follows, every line has M characters. "." stands for road, "a" stands for Angel, and "r" stands for each of Angel's friend.

Process to the end of the file.

Output

For each test case, your program should output a single integer, standing for the minimal time needed. If such a number does no exist, you should output a line containing "Poor ANGEL has to stay in the prison all his life."

Sample Input

       
       
       
        
        
         7 8
#.#####.
#.a#..r.
#..#x...
..#..#.#
#...##..
.#......
........

Sample Output

这是一道搜索题目，一眼就看出来，但是没有想到用优先队列wa了一次，因为他求得是一个最短的步数，优先队列来进行广搜bfs，不然会出现时间长的先到达

#include <cstdio>
#include <queue>
const int N = 300;
using namespace std;
int m,n;
char map[N][N];
struct Node
{
    int x,y;
    int step;
    friend bool operator<(Node n1,Node n2)
    {
        return n1.step>n2.step;
    }
};
int dx[6]={0,0,1,-1};
int dy[6]={1,-1,0,0};
int Bfs(int sta,int stb,int ena,int enb)
{
    priority_queue<Node> q;   
    Node tmd,tmp;
    tmd.x=sta,tmd.y=stb,tmd.step=0;
    q.push(tmd);
    while(!q.empty())
    {
        tmd=q.top();q.pop();   //初始片段搜索结束条件的地方
        if(tmd.x==ena&&tmd.y==enb)
            return tmd.step;
        for(int i=0;i<4;i++)
        {
            tmp.x=tmd.x+dx[i];
            tmp.y=tmd.y+dy[i];
            if(map[tmp.x][tmp.y]=='x')
                tmp.step=tmd.step+2;
            else
                tmp.step=tmd.step+1;
            if(map[tmp.x][tmp.y]!='#'&&tmp.x>=0 &&tmp.y>=0 &&tmp.x<m&&tmp.y<n)
            { //注意上面的搜索条件，是！=‘#’ 错在了这里
                q.push(tmp);
                map[tmp.x][tmp.y]='#';
            }
        }
    }
    return -1;
}
int main()
{
    while(~scanf("%d%d",&m,&n))
    {
        int sta,stb,ena,enb;
        getchar();
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<n;j++)
            {
                scanf("%c",&map[i][j]);
                if(map[i][j]=='a')
                {
                    sta=i,stb=j;
                }
                if(map[i][j]=='r')
                {
                    ena=i,enb=j;
                }
            }
            getchar();
        }
        int ans=Bfs(sta,stb,ena,enb);
        if(ans==-1)
            printf("Poor ANGEL has to stay in the prison all his life.\n");
        else
            printf("%d\n",ans);

    }
    return 0;
}

H - H

Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u