C++博客-Feng-随笔分类-BFS

hdu 1983 Kaitou Kid - The Phantom Thief (2)

Going — Fri, 08 May 2009 13:41:00 GMT

摘要: //1349539 2009-05-08 18:24:44 Accepted 1983 1093MS 272K 5667 B C++ xufeng1618 #include#include#include... 阅读全文

Going 2009-05-08 21:41 发表评论

zju 2743 Bubble Shooter

Going — Thu, 07 May 2009 01:44:00 GMT

摘要: #include#include#include#includeusing namespace std;typedef struct node { int x; &nbs... 阅读全文

Going 2009-05-07 09:44 发表评论

zju 2849 Attack of Panda Virus

Going — Tue, 05 May 2009 03:20:00 GMT

#include<iostream>
#include<queue>
using namespace std;

int mat[502][502];//存输入矩阵
typedef struct node
{
    int x,y;
    int type;
    int day;
    friend bool operator < (node a,node b)
    {
        if(a.day != b.day)
            return a.day > b.day; //先按天数排序
        else
            return a.type > b.type;
    }
}Node;//优先队列的节点
int mark[502][502];

int dir[4][2] = {1,0,-1,0,0,1,0,-1};
int m,n;
int sum[250002];//存储几号病毒感染的电脑数
priority_queue<Node> Q;

void init()
{
    Node p;
    int i,j;
    memset(sum,0,sizeof(sum));//一定要全部清空，切记切记
    for(i = 1;i <=m ;i++)
        for(j = 1;j <= n;j++)
        {
            scanf("%d",&mat[i][j]);
            if(mat[i][j] > 0)//将已经感染的电脑入队
            {
                p.x = i;
                p.y = j;
                p.type = mat[i][j];
                p.day = 1;
                Q.push(p);
                sum[mat[i][j]]++;
            }
        }
}

void Bfs()
{
    int k,dmax;
    Node p,q;
    while(!Q.empty())
    {
        q = Q.top();
        Q.pop();
        dmax = -100000000;
        for(k = 0;k < 4;k++)
        {
            p.x = q.x + dir[k][0];
            p.y = q.y + dir[k][1];
            if(p.x >= 1 && p.x <= m && p.y >= 1 && p.y <= n)
            {
                if(mat[p.x][p.y] < 0)
                {
                    if(mat[p.x][p.y] + q.day >= 0)
                    {
                        p.type = q.type;
                        q.day = q.day;
                        mat[p.x][p.y] = p.type;
                        Q.push(p);
                        sum[mat[p.x][p.y]] ++;
                    }
                    else if(mat[p.x][p.y] > dmax )//寻找其周围最快传染的机子~
                    {
                        dmax = mat[p.x][p.y];
                    }
                }
            }
        }//for()
        if(dmax != -100000000 )//优化，找到周围最快被感染的电脑的天数入队
        {
            q.day = dmax * (-1);
            Q.push(q);
        }
    }//while()
}

int main()
{
    while(cin>>m>>n)
    {
        int t;
        int h;
        init();
        Bfs();
        int i;
        cin>>t;
        for(i = 0;i < t;i++)
        {
            scanf("%d",&h);
            printf("%d\n",sum[h]);
        }
    }
    return 0;
}

Going 2009-05-05 11:20 发表评论

hdu 1195 Open the Lock

Going — Thu, 23 Apr 2009 05:05:00 GMT

摘要: #include#include#include#includeusing namespace std;typedef struct node{ char data[5]; &nb... 阅读全文

Going 2009-04-23 13:05 发表评论

hdu 1195 Open the Lock

Going — Thu, 23 Apr 2009 05:05:00 GMT

摘要: #include#include#include#includeusing namespace std;typedef struct node{ char data[5]; &nb... 阅读全文

Going 2009-04-23 13:05 发表评论

hdu 1241 Oil Deposits

Going — Thu, 23 Apr 2009 05:01:00 GMT

#include<iostream>
#include<string>
using namespace std;

int sum,m,n;
bool used[102][102];
char maps[102][102];
int a[8][2] = {{0,1},{0,-1},{1,0},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};

void Dfs(int i,int j)
{
    int k;
    int s,t;
    if(used[i][j] == true)
        return;
    for(k = 0;k < 8;k++)
    {
        s = i + a[k][0];
        t = j + a[k][1];

        if(s < 0 || s >= n || t < 0 || t >= m)
            continue;

        if(maps[s][t] == '@' && used[s][t] == false)
        {
            used[s][t] = true;
            Dfs(s,t);
        }
    }//while(!Q.empty())
}

int main()
{
    int i,j;
    while(cin>>n>>m)
    {
        if(n == 0 && m == 0)
            break;
        for(i = 0;i < n;i++)
            scanf("%s",maps[i]);

        for(i = 0;i < n;i++)
            for(j = 0;j < m;j++)
                used[i][j] = false;

        sum = 0;
        for(i = 0;i < n;i++)
        {
            for(j = 0;j < m;j++)
            {
                if(maps[i][j] == '@' && used[i][j] == false)
                {
                    used[i][j] = true;
                    Dfs(i,j);
                    sum++;
                }
            }

        }
        printf("%d\n",sum);
    }
    return 0;
}

/*
#include
#include
#include
using namespace std;

typedef struct node
{
    int x,y;
}Node;

queue Q;
int sum,m,n;
bool used[102][102];
char maps[102][102];
int a[8][2] = {{0,1},{0,-1},{1,0},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};

void Bfs(int i,int j)
{
    Node p,q;
    int k;
    int s,t;
    p.x = i;
    p.y = j;
    Q.push(p);
    while(!Q.empty())
    {
        q = Q.front();
        Q.pop();

        for(k = 0;k < 8;k++)
        {
            s = q.x + a[k][0];
            t = q.y + a[k][1];

            if(s < 0 || s >= n || t < 0 || t >= m)
                continue;

            if(maps[s][t] == '@' && used[s][t] == false)
            {
                used[s][t] = true;
                p.x = s;
                p.y = t;
                Q.push(p);
            }
        }
    }//while(!Q.empty())
}

int main()
{
    int i,j;
    while(cin>>n>>m)
    {
        if(n == 0 && m == 0)
            break;
        for(i = 0;i < n;i++)
            //cin>>maps[i];
            scanf("%s",maps[i]);

        for(i = 0;i < n;i++)
            for(j = 0;j < m;j++)
                used[i][j] = false;

        sum = 0;
        for(i = 0;i < n;i++)
        {
            for(j = 0;j < m;j++)
            {
                if(maps[i][j] == '@' && used[i][j] == false)
                {
                    used[i][j] = true;
                    Bfs(i,j);
                    sum++;
                }
            }

        }
        printf("%d\n",sum);
        //cout<    }
    return 0;
}
*/

Going 2009-04-23 13:01 发表评论