ZOJ 2849 Attack of Panda Virus

最新推荐文章于 2024-05-15 05:23:35 发布

poptree hengli

最新推荐文章于 2024-05-15 05:23:35 发布

阅读量473

点赞数

分类专栏： ZOJ 文章标签： zoj

本文链接：https://blog.csdn.net/pootree/article/details/50700144

版权

ZOJ 专栏收录该内容

76 篇文章 0 订阅

订阅专栏

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2849

#include <iostream>
#include <queue>
#include <set>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
#define LINE_SIZE 510
int com[LINE_SIZE][LINE_SIZE];
struct Node{
    int x;
    int y;
    int day;
    int type;
};
bool cmp(Node a, Node b){
    return a.type < b.type;
}
vector<Node> virus;
priority_queue<Node> priQue;
int type[LINE_SIZE*LINE_SIZE];
bool operator < (const Node a, Node b){
    if (a.day != b.day){
        return a.day > b.day;
    }
    return a.type > b.type;
}
int movey[4][2] = { { -1, 0 }, { 1, 0 }, { 0, -1 }, { 0, 1 } };
void bfs(){
    while (!priQue.empty()){
        Node front = priQue.top();
        priQue.pop();
        int flag = -1e7;
        for (int aim = 0; aim < 4; aim++){
            Node temp;
            temp.x = front.x + movey[aim][0];
            temp.y = front.y + movey[aim][1];
            if (com[temp.x][temp.y] < 0){
                if (0 - com[temp.x][temp.y] <= front.day){
                    temp.type = front.type;
                    temp.day = front.day;
                    type[front.type]++;
                    com[temp.x][temp.y] = front.type;
                    priQue.push(temp);
                }
                else{
                    if (flag < com[temp.x][temp.y])
                        flag = com[temp.x][temp.y];
                }
            }
        }
        if (flag != -1e7){
            front.day = flag*(-1);
            priQue.push(front);
        }
    }
}
int main(){
    int m, n;
    while (cin >> m >> n){
        memset(com, 0, sizeof(com));
        memset(type, 0, sizeof(type));
        while (!priQue.empty()){
            priQue.pop();
        }
        virus.clear();
        for (int i = 1; i <= m; i++){
            for (int j = 1; j <= n; j++){
                cin >> com[i][j];
                if (com[i][j] > 0){
                    Node temp;
                    temp.x = i;
                    temp.y = j;
                    temp.day = 0;
                    temp.type = com[i][j];
                    type[com[i][j]]++;
                    virus.push_back(temp);
                }
            }
        }
        sort(virus.begin(), virus.end(), cmp);
        for (int i = 0; i < virus.size(); i++){
            priQue.push(virus[i]);
        }
        bfs();
        int Q;
        cin >> Q;
        while (Q--){
            int nn;
            cin >> nn;
            cout << type[nn] << "\n";
        }
    }
}