#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);; cin.tie(NULL)
void selfMax(long long& a, long long b){
a = max(a, b);
}
void selfMin(long long& a, long long b){
a = min(a, b);
}
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& x) {return in >> x.first >> x.second;}
template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& x) {return out << x.first << ' ' << x.second;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};
template<typename T> ostream& operator<<(ostream& out, vector<vector<T> >& a) {for(auto &x : a) out << x << '\n'; return out;};
template<typename T1, typename T2> ostream& operator<<(ostream& out, vector<pair<T1, T2> >& a) {for(auto &x : a) out << x << '\n'; return out;};
/*
Use DSU dsu(N);
*/
struct DSU {
vector<long long> e;
DSU(long long N) { e = vector<long long>(N, -1); }
// get representive component (uses path compression)
long long get(long long x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool same_set(long long a, long long b) { return get(a) == get(b); }
long long size(long long x) { return -e[get(x)]; }
bool unite(long long x, long long y) { // union by size
x = get(x), y = get(y);
if (x == y) return false;
if (e[x] > e[y]) swap(x, y);
e[x] += e[y]; e[y] = x;
return true;
}
};
/*
Run with Bit<long long> BIT
*/
template <class T> class BIT {
private:
long long size;
vector<T> bit;
vector<T> arr;
public:
BIT(long long size) : size(size), bit(size + 1), arr(size) {}
void set(long long ind, long long val) { add(ind, val - arr[ind]); }
void add(long long ind, long long val) {
arr[ind] += val;
ind++;
for (; ind <= size; ind += ind & -ind) { bit[ind] += val; }
}
T pref_sum(long long ind) {
ind++;
T total = 0;
for (; ind > 0; ind -= ind & -ind) { total += bit[ind]; }
return total;
}
};
/*
Change Comb for specific Seg tree probs, but run with Seg<long long> Seg;
*/
template<class T> struct Seg {
const T ID = 1e18; T comb(T a, T b) { return min(a,b); }
long long n; vector<T> seg;
void init(long long _n) { n = _n; seg.assign(2*n,ID); }
void pull(long long p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
void upd(long long p, T val) {
seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
T query(long long l, long long r) {
T ra = ID, rb = ID;
for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
if (l&1) ra = comb(ra,seg[l++]);
if (r&1) rb = comb(seg[--r],rb);
}
return comb(ra,rb);
}
};
bool inside(int i, int j, int n, int m){
return (1 <= i && i <= n && 1 <= j && j <= m);
}
int main(){
int n, m;
cin >> n >> m;
int grid[2 + n][2 + m];
queue<pair<int, int> > q;
int counter[1 + n + m];
memset(counter, 0, sizeof(counter));
for(int i = 0; i < m + 2; i++){
grid[0][i] = grid[n + 1][i] = 1;
}
for(int i = 0; i < n + 2; i++){
grid[i][0] = grid[i][m + 1] = 1;
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
cin >> grid[i][j];
if(grid[i][j]){
q.push(make_pair(i, j));
}
else{
counter[i + j]++;
}
}
}
while(!q.empty()){
pair<int, int> u = q.front();
q.pop();
if(grid[u.first - 1][u.second + 1]){
if(inside(u.first - 1, u.second, n, m) && !grid[u.first - 1][u.second]){
grid[u.first - 1][u.second] = 1;
counter[u.first + u.second - 1]--;
q.push(make_pair(u.first - 1, u.second));
}
if(inside(u.first, u.second + 1, n, m) && !grid[u.first][u.second + 1]){
grid[u.first][u.second + 1] = 1;
counter[u.first + u.second + 1]--;
q.push(make_pair(u.first, u.second + 1));
}
}
if(grid[u.first + 1][u.second - 1]){
if(inside(u.first + 1, u.second, n, m) && !grid[u.first + 1][u.second]){
grid[u.first + 1][u.second] = 1;
counter[u.first + u.second + 1]--;
}
if(inside(u.first, u.second - 1, n, m) && !grid[u.first][u.second - 1]){
grid[u.first][u.second - 1] = 1;
counter[u.first + u.second - 1]--;
q.push(make_pair(u.first, u.second - 1));
}
}
}
int queries;
cin >> queries;
while(queries--){
int a, b;
cin >> a >> b;
if(grid[a][b]){
cout << 1 << "\n";
}
else if(counter[a + b] == 1){
cout << 0 << "\n";
}
else{
cout << 1 << "\n";
grid[a][b] = 1;
counter[a + b]--;
q.push(make_pair(a, b));
while(!q.empty()){
pair<int, int> u = q.front();
q.pop();
if(grid[u.first - 1][u.second + 1]){
if(inside(u.first - 1, u.second, n, m) && !grid[u.first - 1][u.second]){
grid[u.first - 1][u.second] = 1;
counter[u.first + u.second - 1]--;
q.push(make_pair(u.first - 1, u.second));
}
if(inside(u.first, u.second + 1, n, m) && !grid[u.first][u.second + 1]){
grid[u.first][u.second + 1] = 1;
counter[u.first + u.second + 1]--;
q.push(make_pair(u.first, u.second + 1));
}
}
if(grid[u.first + 1][u.second - 1]){
if(inside(u.first + 1, u.second, n, m) && !grid[u.first + 1][u.second]){
grid[u.first + 1][u.second] = 1;
counter[u.first + u.second + 1]--;
}
if(inside(u.first, u.second - 1, n, m) && !grid[u.first][u.second - 1]){
grid[u.first][u.second - 1] = 1;
counter[u.first + u.second - 1]--;
q.push(make_pair(u.first, u.second - 1));
}
}
}
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
308 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
308 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
