]]>
]]>
#include<iostream>#include<queue>using namespace std;int mat[502][502];//瀛樿緭鍏ョ煩闃?/span>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;//浼樺厛闃熷垪鐨勮妭鐐?/span>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));//涓瀹氳鍏ㄩ儴娓呯┖錛屽垏璁板垏璁?/span> 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;}
]]>
]]>
]]>
#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<iostream>#include<queue>#include<string>using namespace std;typedef struct node{ int x,y;}Node;queue<Node> 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<<sum<<endl; } return 0;}*/
]]>