제출 #1343176

#제출 시각아이디문제언어결과실행 시간메모리
1343176tolbiFurniture (JOI20_furniture)C++20
0 / 100
1 ms344 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<vector<bool>> v(n, vector<bool>(m));
  for (int i = 0; i < n; ++i)
  {
  	for (int j = 0; j < m; ++j) {
  		int x;cin>>x;
  		v[i][j] = x;
  	}
  }
  int q;cin>>q;
  while (q--) {
  	int x, y;cin>>x>>y;
  	x--, y--;
  	if (v[x][y] == 1) {
  		cout << 1 << '\n';
  		continue;
  	}
  	int l = y, r = y;
  	if (x > 0) {
  		while (r + 1 < m && v[x-1][r+1] == 1) r++;
  	} else r = m - 1;
  	for (int i = x + 1; i < n; i++) {
  		while (l > 0 && l <= r && v[i][l-1] == 0 && v[i][l] == 0) l++;
  		if (l > r) {
  			break;
  		}
  		while (r + 1 < m && v[i-1][r+1] == 1) r++;
  	}
  	if (l > r || r < m - 1) {
  		cout << 1 << '\n';
  		l = y, r = y;
  		if (x > 0) {
  			while (r + 1 < m && v[x-1][r+1] == 1) r++;
  		}
  		for (int i = l; i <= r; i++) {
  			v[x][i] = 1;
  		}
  		for (int i = x + 1; i < n; i++) {
  			while (l > 0 && l <= r && v[i][l-1] == 0) l++;
  			while (r + 1 < m && v[i-1][r+1] == 1) r++;
  			for (int j = l; j <= r; j++) v[i][j] = 1;
  		}
  	} else cout << 0 << '\n';
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...