CCF-CSP题解 201604-4 游戏 bfs #include <bits/stdc++.h> const int maxn = 100; using namespace std; int n, m, t; bool hasDanger[maxn + 10][maxn + 10]; int danger[maxn + 10][maxn + 10][2]; struct tNode { int r, c; int time; tNode(int rr, int cc, int ttime)...
printf("%d", top.g);break; }for(intd=0; d<4; d++) {intnx = top.x + dirs[d][0];intny = top.y + dirs[d][1];intng = top.g +1;if(legal(nx,ny) && (ng<start[nx][ny] || ng>end[nx][ny]) && !visited[nx][ny][ng]) { visited[nx][ny][ng]=true; q.push(Nod...