#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9+7;
const int nax = 200005;
bool grid[1005][1005];
int n,m;
bool dfs(int x, int y){
if(x == n-1 && y == m-1) return 1;
if(x >= n || y >= m) return 0;
if(grid[x][y]) return 0;
return max(dfs(x+1,y),dfs(x,y+1));
}
int main(){
optimise;
cin>>n >>m;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < m; ++j)
{
cin >> grid[i][j];
}
}
int q;
cin >>q;
while(q--){
int x,y;
cin >> x >> y;
x--,y--;
grid[x][y] = 1;
int a = dfs(0,0);
cout << a << endl;
grid[x][y] = a;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
5057 ms |
332 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
5057 ms |
332 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |