//Enter three integers r, c, n: number of rows, number of columns and number of objects //Example: 10 10 12 #include #include #include #include #include #include using namespace std; typedef pairii; #define inf 1234567890 int r, c, n, m; struct Obj{ int r,c,w,h,d; ii target; const bool operator<(const Obj&o) const{ return d> map; vector> dist; vector objects; int DR[4]={1,0,-1,0}; int DC[4]={0,-1,0,1}; int DIR[4]={'D','L','U','R'}; int whatdir(char ch){ if(ch=='D') return 0; if(ch=='L') return 1; if(ch=='U') return 2; if(ch=='R') return 3; return -1; } void printMap(vector> &m){ for(int i=0; i=c ||y+h>=r){ i--; continue ; } //cout<<"obj "< q; for(int i=0; i=r||c2>=r|| map[r2][c2].second>0|| dist[r2][c2].first!=inf) continue ; dist[r2][c2]={dist[point.first][point.second] .first+1,DIR[i]}; q.push({r2,c2}); } } } int main() { cin>>r>>c>>n; srand(time(NULL)); map=vector>(r, vector(c, {0,0})); dist=vector>(r,vector(c, {inf, -1})); cout<<". - free place\n"; cout<<"E - enemy object\n"; cout<<"A - ally object\n"; cout<<"@ - enemy and ally seen at one point\n"; cout<<"# - missile path\n"; cout<<"All missiles are launched at once, but for better readability there are shown separately.\n"; generate_objects(); bfs(); for(int i=0; i> map2=map; if(objects[i].d==inf) continue; int row=objects[i].target.first; int col=objects[i].target.second; vector pattern; while(row=0; j--) cout<

Challenge: Defend the base