/**
* Author: Tenjin
* Created: 27.04.2022 18:58
* Why am I so stupid? :c
* Slishkom slab
**/
#include <bits/stdc++.h>
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse,-fgcse-lm")
#pragma GCC optimize("-ftree-pre,-ftree-vrp")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)
template<typename T> T get_rand(T l, T r) {
random_device rd;
mt19937 gen(rd());
return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }
string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }
template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }
void freop(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int MOD = 998244353;
const ll INF = 1e14;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
const int N = 1e3 + 5;
const int M = 2e6 + 6;
int might[2 * N];
int in[N][N], out[N][N];
int a[N][N], n, m;
void go(int x, int y) {
if(a[x][y]) return;
a[x][y] = 1;
might[x + y]--;
if(!--in[x + 1][y]) go(x + 1, y);
if(!--in[x][y + 1]) go(x, y + 1);
if(!--out[x - 1][y]) go(x - 1, y);
if(!--out[x][y - 1]) go(x, y - 1);
}
void solve() {
read(n, m);
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
might[i + j]++;
in[i + 1][j]++;
in[i][j + 1]++;
out[i - 1][j]++, out[i][j - 1]++;
a[i][0] = a[i][m + 1] = a[0][j] = a[n + 1][j] = 1;
}
}
/*for(int i = 1; i <= n + m; ++i) write(might[i], ' ');
print("");
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) write(in[i][j], ' ');
print("");
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) write(out[i][j], ' ');
print("");
}
*/
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
int cur; read(cur);
if(cur) go(i, j);
}
}
int q; read(q);
while(q--) {
int x, y; read(x, y);
if(a[x][y]) {
print(1);
continue;
}
//print("X", might[x + y]);
if(might[x + y] == 1) print(0);
else {
print(1);
go(x, y);
}
}
}
int main() {
//srand(time(NULL));
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freop("");
int t = 1;
//read(t);
for (int i = 1; i <= t; ++i) {
//write("Case #" + to_string(i) + ": ");
solve();
}
return 0;
}
Compilation message
furniture.cpp: In function 'void freop(std::string)':
furniture.cpp:71:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
71 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
furniture.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
72 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
6748 KB |
Output is correct |
| 2 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 3 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 4 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 5 |
Correct |
3 ms |
8928 KB |
Output is correct |
| 6 |
Correct |
4 ms |
8948 KB |
Output is correct |
| 7 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 8 |
Correct |
3 ms |
8924 KB |
Output is correct |
| 9 |
Correct |
3 ms |
8796 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
6748 KB |
Output is correct |
| 2 |
Correct |
2 ms |
8796 KB |
Output is correct |
| 3 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 4 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 5 |
Correct |
3 ms |
8928 KB |
Output is correct |
| 6 |
Correct |
4 ms |
8948 KB |
Output is correct |
| 7 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 8 |
Correct |
3 ms |
8924 KB |
Output is correct |
| 9 |
Correct |
3 ms |
8796 KB |
Output is correct |
| 10 |
Correct |
8 ms |
7004 KB |
Output is correct |
| 11 |
Correct |
4 ms |
6748 KB |
Output is correct |
| 12 |
Correct |
108 ms |
16752 KB |
Output is correct |
| 13 |
Correct |
45 ms |
13904 KB |
Output is correct |
| 14 |
Correct |
177 ms |
21452 KB |
Output is correct |
| 15 |
Correct |
189 ms |
21924 KB |
Output is correct |
| 16 |
Correct |
191 ms |
22696 KB |
Output is correct |
| 17 |
Correct |
204 ms |
23892 KB |
Output is correct |
| 18 |
Correct |
198 ms |
22868 KB |
Output is correct |
| 19 |
Correct |
199 ms |
23888 KB |
Output is correct |
| 20 |
Correct |
219 ms |
23764 KB |
Output is correct |
| 21 |
Correct |
204 ms |
23872 KB |
Output is correct |
