oj.uz

Submission #529092

# Submission time Handle Problem Language Result Execution time Memory
529092 2022-02-22T06:10:03 Z d2k05 Furniture (JOI20_furniture) C++14
5 / 100
 5000 ms 5288 KB 
#include <bits/stdc++.h>

#define fastio ios_base :: sync_with_stdio(0), cin.tie(0);

using namespace std;
using ll = long long;

const int mxN = 1e3 + 5, mod = 1e9 + 7;

int n, m, a[mxN][mxN];
bool dp[mxN][mxN];

int main() {
	fastio;
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) cin >> a[i][j];
	}
	int q;
	cin >> q;
	while (q--) {
		int x, y;
		cin >> x >> y;
		a[x][y] = 1;
		dp[1][1] = 1;
		for (int i = 1; i <= n; ++i) {
			for (int j = 1 + (i == 1); j <= m; ++j) {
				dp[i][j] = 0;
				if (a[i][j]) continue;
				dp[i][j] = (dp[i - 1][j] | dp[i][j - 1]);
			}
		}
		if (dp[n][m]) 
			cout << "1\n";
		else
			a[x][y] = 0, cout << "0\n";
	}
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 588 KB Output is correct
2 Correct 35 ms 716 KB Output is correct
3 Correct 79 ms 764 KB Output is correct
4 Correct 186 ms 784 KB Output is correct
5 Correct 190 ms 804 KB Output is correct
6 Correct 270 ms 788 KB Output is correct
7 Correct 163 ms 716 KB Output is correct
8 Correct 177 ms 816 KB Output is correct
9 Correct 162 ms 816 KB Output is correct

Subtask #2
0.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 588 KB Output is correct
2 Correct 35 ms 716 KB Output is correct
3 Correct 79 ms 764 KB Output is correct
4 Correct 186 ms 784 KB Output is correct
5 Correct 190 ms 804 KB Output is correct
6 Correct 270 ms 788 KB Output is correct
7 Correct 163 ms 716 KB Output is correct
8 Correct 177 ms 816 KB Output is correct
9 Correct 162 ms 816 KB Output is correct
10 Correct 4264 ms 736 KB Output is correct
11 Correct 154 ms 560 KB Output is correct
12 Execution timed out 5082 ms 5288 KB Time limit exceeded
13 Halted 0 ms 0 KB -