Please notice the unusual memory limit of this problem.

Orac likes games. Recently he came up with the new game, “Game of Life”.

You should play this game on a black and white grid with n rows and m columns. Each cell is either black or white.

For each iteration of the game (the initial iteration is 0), the color of each cell will change under the following rules:

If there are no adjacent cells with the same color as this cell on the current iteration, the color of it on the next iteration will be the same.
Otherwise, the color of the cell on the next iteration will be different.
Two cells are adjacent if they have a mutual edge.

Now Orac has set an initial situation, and he wants to know for the cell (i,j) (in i-th row and j-th column), what will be its color at the iteration p. He may ask you these questions several times.

Input
The first line contains three integers n,m,t (1≤n,m≤1000,1≤t≤100000), representing the number of rows, columns, and the number of Orac queries.

Each of the following n lines contains a binary string of length m, the j-th character in i-th line represents the initial color of cell (i,j). ‘0’ stands for white, ‘1’ stands for black.

Each of the following t lines contains three integers i,j,p (1≤i≤n,1≤j≤m,1≤p≤1018), representing a query from Orac.

Output
Print t lines, in i-th line you should print the answer to the i-th query by Orac. If the color of this cell is black, you should print ‘1’; otherwise, you should write ‘0’.

Examples
Input
3 3 3
000
111
000
1 1 1
2 2 2
3 3 3
Output
1
1
1
Input
5 2 2
01
10
01
10
01
1 1 4
5 1 4
Output
0
0
Input
5 5 3
01011
10110
01101
11010
10101
1 1 4
1 2 3
5 5 3
Output
1
0
1
Input
1 1 3
0
1 1 1
1 1 2
1 1 3
Output
0
0
0
Note

For the first example, the picture above shows the initial situation and the color of cells at the iteration 1, 2, and 3. We can see that the color of (1,1) at the iteration 1 is black, the color of (2,2) at the iteration 2 is black, and the color of (3,3) at the iteration 3 is also black.

For the second example, you can prove that the cells will never change their colors.
思路：講真的，比D題思維量小一些。
我們對(duì)樣例按照題意模擬一下，我們是可以發(fā)現(xiàn)規(guī)律的。當(dāng)達(dá)到某一狀態(tài)的時(shí)候，之后的狀態(tài)就可以確定了。我們第一輪符合題意的點(diǎn)放入隊(duì)列中，利用bfs去擴(kuò)展。直到全部擴(kuò)展完成或者無(wú)法擴(kuò)展就退出。bfs的過(guò)程記錄每一個(gè)格子會(huì)發(fā)生變化的回合，之后的變化就是有規(guī)律可尋的了。然后q次詢問(wèn)，就可以O(shè)(1)的時(shí)間內(nèi)完成了。
代碼如下：

#include<bits/stdc++.h> #define ll long long using namespace std;const int maxx=1e3+10; struct node{int x,y;node(){}node(int a,int b){x=a,y=b;} }; int mp[maxx][maxx]; int vis[maxx][maxx]; int d[][2]={{1,0},{0,1},{-1,0},{0,-1}}; int n,m,q;inline void bfs() {int i,j,k,tx,ty;node a;queue<node> q;for(i=1;i<=n;i++)for(j=1;j<=m;j++)for(k=0;k<4;k++) {tx=i+d[k][0];ty=j+d[k][1];if(tx<1||tx>n||ty<1||ty>m) continue;if(mp[i][j]==mp[tx][ty]) vis[i][j]=1,q.push(node(i,j));}while(q.size()){a=q.front();q.pop();for(i=0;i<4;i++){tx=a.x+d[i][0];ty=a.y+d[i][1];if(tx<1||tx>n||ty<1||ty>m||vis[tx][ty]) continue;if(mp[tx][ty]==(!mp[a.x][a.y])){vis[tx][ty]=vis[a.x][a.y]+1;q.push(node(tx,ty));}}} } int main() {scanf("%d%d%d",&n,&m,&q);for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) scanf("%1d",&mp[i][j]);memset(vis,0,sizeof(vis));bfs();int x,y;ll t;while(q--){scanf("%d%d%lld",&x,&y,&t);if((ll)vis[x][y]>t) printf("%d\n",mp[x][y]);else{if(vis[x][y]==0) printf("%d\n",mp[x][y]);else{t-=vis[x][y];printf("%d\n",mp[x][y]^((t+1ll)&1ll));}}}return 0; }

努力加油a啊，(^o)/~

總結(jié)

以上是生活随笔為你收集整理的Orac and Game of Life CodeForces - 1350E（思维+BFS）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。