BDFZOI 拯救公主

  1 #include<iostream>
  2 #include<cstring>
  3 #include<queue>
  4 #include<vector>
  5 #include<cmath> 
  6 using namespace std;
  7 int t;
  8 char map[205][205];
  9 bool diamond[5];
 10 struct node{
 11     int x, y;
 12     int jewel,time;
 13     node(int xx, int yy, int j, int t):x(xx),y(yy),jewel(j),time(t){}
 14 }; 
 15 bool operator<(const node&a, const node&b){
 16     return a.time>b.time;
 17 }
 18 priority_queue<node> pq;
 19 bool visited[205][205][20];
 20 int dirx[4] = {0,0,1,-1};
 21 int diry[4] = {-1,1,0,0};
 22 vector<node>v;
 23 
 24 bool judge(int x, int y){
 25     if(map[x][y]!=‘#‘&&map[x][y]!=0)
 26         return true;
 27     return false;
 28 }
 29 
 30 bool isjewel(int x, int y){
 31     if(map[x][y]==‘0‘||map[x][y]==‘1‘||map[x][y]==‘2‘||map[x][y]==‘3‘||map[x][y]==‘4‘)
 32         return true;
 33     return false;
 34 }
 35 
 36 bool finished(int n){
 37     int temp = 0;
 38     for(int i = 1; i <= 32; i*=2){
 39         temp++;
 40         if((i&n)==0&&diamond[temp-1]!=0)
 41             return false;
 42     }
 43     return true;
 44 }
 45 int main(){
 46     cin>>t;
 47     while(t--){
 48         int r, c, k;
 49         cin>>r>>c>>k;
 50         memset(map, 0, sizeof(map));
 51         memset(visited,0,sizeof(visited));
 52         memset(diamond,0,sizeof(diamond));
 53         while(!pq.empty())pq.pop();
 54         v.clear();
 55         int i, j;
 56         for(i = 1; i <= r; i++)
 57             for(j = 1; j <= c; j++){
 58                 cin>>map[i][j];
 59                 if(map[i][j]==‘S‘){
 60                     pq.push(node(i,j,0,0));
 61                     visited[i][j][0] = true;
 62                 }
 63                 else if(map[i][j]==‘$‘)
 64                     v.push_back(node(i,j,0,0));
 65                 else if(map[i][j]>=‘0‘&&map[i][j]<=‘4‘){
 66                     diamond[map[i][j]-‘0‘] = true;
 67                 }
 68             }
 69             int flag = 0;
 70         while(!pq.empty()){
 71             node no = pq.top();
 72             pq.pop();
 73         //    cout<<no.x<<" "<<no.y<<" "<<no.jewel<<" "<<no.time<<":"<<endl;
 74             if(map[no.x][no.y]==‘E‘&&finished(no.jewel)){
 75                 cout<<no.time<<endl;
 76                 flag = 1;
 77                 break;
 78             }
 79             for(i = 0; i < 4; i++){
 80                 int nx = no.x+dirx[i];
 81                 int ny = no.y+diry[i];
 82                 int nj = no.jewel;
 83                 if(isjewel(nx,ny)){
 84                     if((int(pow(2,map[nx][ny]-‘0‘))&no.jewel)==0){    
 85                         nj+=pow(2, map[nx][ny]-‘0‘);
 86                     }    
 87                 }//位运算 加钻石 
 88                 if(!visited[nx][ny][nj]&&judge(nx,ny)){
 89                     if(map[nx][ny]==‘$‘){
 90                         for(j = 0; j < v.size(); j++){
 91                             pq.push(node(v[j].x,v[j].y,nj,no.time+1));
 92                             visited[v[j].x][v[j].y][nj] = true;    
 93         //                    cout<<v[j].x<<" "<<v[j].y<<" "<<nj<<" "<<no.time+1<<endl;
 94                             
 95                         }    
 96                     }
 97                     else{
 98                         pq.push(node(nx,ny,nj,no.time+1));
 99                         visited[nx][ny][nj] = true;
100         //                cout<<nx<<" "<<ny<<" "<<nj<<" "<<no.time+1<<endl;
101                     }    
102                 }
103             }
104 //            getchar();
105         }
106         if(!flag) cout<<"oop!"<<endl;
107     } 
108     return 0;
109 }