//Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
void IO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int N,M;
int g[1001][1001];
int A[1000][1000];
int B[1000][1000];
int memo[1000][1000];
int solve(int x, int y){
if(x<0|| y<0 || x>=N || y>=M || g[x][y]==1) return 0;
if(x==N-1 && y==M-1) return 1;
if(memo[x][y]!=-1) return memo[x][y];
return memo[x][y] = (solve(x,y+1)+solve(x+1,y))%MOD;
}
int solve2(int x, int y){
//cout << x << ' ' << y << endl;
if(x<0|| y<0 || x>=N || y>=M || g[x][y]==1) return 0;
if(x==0 && y==0) return 1;
if(memo[x][y]!=-1) return memo[x][y];
int xx=(solve2(x,y-1)+solve2(x-1,y))%MOD;
//if(x==0 && y==1) cout << xx << endl;
return memo[x][y] = xx;
}
int32_t main() {
boost; IO();
cin>>N>>M;
FOR(i,0,N) FOR(j,0,M) cin>>g[i][j];
FOR(i,0,N) FOR(j,0,M) memo[i][j]=-1;
FOR(i,0,N) FOR(j,0,M) A[i][j]=solve(i,j);
FOR(i,0,N) FOR(j,0,M) memo[i][j]=-1;
FOR(i,0,N) FOR(j,0,M) B[i][j]=solve2(i,j);
//FOR(i,0,N){FOR(j,0,M) cout << B[i][j] << ' '; cout << endl;}
int X=A[0][0];
FOR(i,0,N) FOR(j,0,M) A[i][j]*=B[i][j];
//FOR(i,0,N){FOR(j,0,M) cout << A[i][j] << ' '; cout << endl;}
int Q; cin>>Q;
while(Q--){
int x,y; cin>>x>>y; x--; y--;
int nb=A[x][y];
//cout << X << ' ' << nb << endl;
if((((X-nb)%MOD+MOD)%MOD)==0) cout << 0 << endl;
else{
cout << 1 << endl;
X-=nb; X%=MOD; X+=MOD; X%=MOD;
}
}
return 0;
}
/* Careful!!!
.Array bounds
.Infinite loops
.Uninitialized variables / empty containers
.Order of input
Some insights:
.Binary search
.Graph representation
.Write brute force code
.Change your approach
*/
Compilation message
furniture.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
3 | #pragma GCC optimization ("O3")
|
furniture.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
4 | #pragma GCC optimization ("unroll-loops")
|
furniture.cpp: In function 'void IO()':
furniture.cpp:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
50 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
furniture.cpp:51:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
51 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
6 ms |
640 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
6 ms |
640 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
