oj.uz

Submission #622433

# Submission time Handle Problem Language Result Execution time Memory
622433 2022-08-04T09:27:59 Z Jomnoi Rectangles (IOI19_rect) C++17
72 / 100
 4387 ms 111488 KB 
#include <bits/stdc++.h>
#include "rect.h"
using namespace std;

const int MAX_N = 2505;
const int d[4][2] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};

int N, M;
long long ans;
vector <vector <int>> A;
vector <vector <bitset <705>>> validRow, validCol;
vector <vector <vector <bool>>> validRow2, validCol2;
int qs[MAX_N][MAX_N];
short dp[MAX_N];
bool visited[MAX_N][MAX_N];

long long count_rectangles(vector <vector <int>> a) {
	N = a.size(), M = a[0].size();
	A.resize(N + 1, vector <int> (M + 1, 0));
	if(min(N, M) < 3) {
		return 0;
	}

	for(int i = 0; i < N; i++) {
		for(int j = 0; j < M; j++) {
			A[i + 1][j + 1] = a[i][j];
		}
	}
	
	if(N <= 700 and M <= 700) {
		validRow.resize(N + 1, vector <bitset <705>> (M + 1, bitset <705> (M + 1)));
		validCol.resize(M + 1, vector <bitset <705>> (N + 1, bitset <705> (N + 1)));
		for(short r = 2; r <= N - 1; r++) {
			for(short c1 = 2; c1 <= M - 1; c1++) {
				int maxA = 0;
				for(short c2 = c1; c2 <= M - 1; c2++) {
					maxA = max(maxA, A[r][c2]);
					if(min(A[r][c1 - 1], A[r][c2 + 1]) > maxA) {
						validRow[r][c1][c2] = 1;
					}
					else {
						validRow[r][c1][c2] = 0;
					}
				}
			}
		}
		for(short c = 2; c <= M - 1; c++) {
			for(short r1 = 2; r1 <= N - 1; r1++) {
				int maxA = 0;
				for(short r2 = r1; r2 <= N - 1; r2++) {
					maxA = max(maxA, A[r2][c]);
					if(min(A[r1 - 1][c], A[r2 + 1][c]) > maxA) {
						validCol[c][r1][r2] = 1;
					}
					else {
						validCol[c][r1][r2] = 0;
					}
				}
			}
		}

		for(short r1 = 2; r1 <= N - 1; r1++) {
			for(short c1 = 2; c1 <= M - 1; c1++) {
				for(short sz = 1; r1 + sz - 1 <= N - 1; sz++) {
					dp[sz] = 0;
					for(short c2 = c1; c2 <= M - 1; c2++) {
						if(validCol[c2][r1][r1 + sz - 1] == true) {
							dp[sz]++;
						}
						else {
							break;
						}
					}
				}
				for(short sz = 1; c1 + sz - 1 <= M - 1; sz++) {
					for(short r2 = r1; r2 <= N - 1; r2++) {
						if(validRow[r2][c1][c1 + sz - 1] == true) {
							if(dp[r2 - r1 + 1] >= sz) {
								ans++;
							}
						}
						else {
							break;
						}
					}
				}
			}
		}
	}
	else if(N == 3) {
		validRow2.resize(N + 1, vector <vector <bool>> (M + 1, vector <bool> (M + 1, false)));
		validCol2.resize(M + 1, vector <vector <bool>> (N + 1, vector <bool> (N + 1, false)));
		for(int r = 2; r <= N - 1; r++) {
			for(int c1 = 2; c1 <= M - 1; c1++) {
				int maxA = 0;
				for(int c2 = c1; c2 <= M - 1; c2++) {
					maxA = max(maxA, A[r][c2]);
					if(min(A[r][c1 - 1], A[r][c2 + 1]) > maxA) {
						validRow2[r][c1][c2] = true;
					}
				}
			}
		}
		for(int c = 2; c <= M - 1; c++) {
			for(int r1 = 2; r1 <= N - 1; r1++) {
				int maxA = 0;
				for(int r2 = r1; r2 <= N - 1; r2++) {
					maxA = max(maxA, A[r2][c]);
					if(min(A[r1 - 1][c], A[r2 + 1][c]) > maxA) {
						validCol2[c][r1][r2] = true;
					}
				}
			}
		}
 
		for(int r1 = 2; r1 <= N - 1; r1++) {
			for(int c1 = 2; c1 <= M - 1; c1++) {
				for(int sz = 1; sz <= max(N, M); sz++) {
					dp[sz] = 0;
				}
				for(int sz = 1; r1 + sz - 1 <= N - 1; sz++) {
					for(int c2 = c1; c2 <= M - 1; c2++) {
						if(validCol2[c2][r1][r1 + sz - 1] == true) {
							dp[sz]++;
						}
						else {
							break;
						}
					}
				}
				for(int sz = 1; c1 + sz - 1 <= M - 1; sz++) {
					for(int r2 = r1; r2 <= N - 1; r2++) {
						if(validRow2[r2][c1][c1 + sz - 1] == true) {
							if(dp[r2 - r1 + 1] >= sz) {
								ans++;
							}
						}
						else {
							break;
						}
					}
				}
			}
		}
	}
	else {
		for(int i = 1; i <= N; i++) {
			for(int j = 1; j <= M; j++) {
				qs[i][j] = qs[i - 1][j] + qs[i][j - 1] - qs[i - 1][j - 1] + A[i][j];
			}
		}

		for(int i = 1; i <= N; i++) {
			for(int j = 1; j <= M; j++) {
				if(A[i][j] == 0 and visited[i][j] == false) {
					visited[i][j] = true;
					int minR = N, maxR = 1, minC = M, maxC = 1;
					queue <pair <int, int>> q;
					q.emplace(i, j);
					while(!q.empty()) {
						auto [ux, uy] = q.front();
						q.pop();

						minR = min(minR, ux);
						maxR = max(maxR, ux);
						minC = min(minC, uy);
						maxC = max(maxC, uy);
						for(int ii = 0; ii < 4; ii++) {
							int vx = ux + d[ii][0], vy = uy + d[ii][1];
							if(vx < 1 or vx > N or vy < 1 or vy > M) {
								continue;
							}

							if(visited[vx][vy] == false and A[vx][vy] == 0) {
								visited[vx][vy] = true;
								q.emplace(vx, vy);
							}
						}
					}

					if(minR > 1 and minC > 1 and maxR < N and maxC < M and qs[maxR][maxC] - qs[maxR][minC - 1] - qs[minR - 1][maxC] + qs[minR - 1][minC - 1] == 0) {
						ans++;
					}
				}
			}
		}
	}
	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 5 ms 1620 KB Output is correct
23 Correct 5 ms 1640 KB Output is correct
24 Correct 9 ms 1632 KB Output is correct
25 Correct 4 ms 1620 KB Output is correct
26 Correct 4 ms 1624 KB Output is correct
27 Correct 4 ms 1620 KB Output is correct
28 Correct 4 ms 1620 KB Output is correct
29 Correct 2 ms 980 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 5 ms 1620 KB Output is correct
18 Correct 5 ms 1640 KB Output is correct
19 Correct 9 ms 1632 KB Output is correct
20 Correct 4 ms 1620 KB Output is correct
21 Correct 4 ms 1624 KB Output is correct
22 Correct 4 ms 1620 KB Output is correct
23 Correct 4 ms 1620 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 63 ms 8404 KB Output is correct
31 Correct 66 ms 8404 KB Output is correct
32 Correct 67 ms 8404 KB Output is correct
33 Correct 52 ms 8416 KB Output is correct
34 Correct 49 ms 8424 KB Output is correct
35 Correct 46 ms 8416 KB Output is correct
36 Correct 46 ms 8404 KB Output is correct
37 Correct 46 ms 8300 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 5 ms 1620 KB Output is correct
18 Correct 5 ms 1640 KB Output is correct
19 Correct 9 ms 1632 KB Output is correct
20 Correct 4 ms 1620 KB Output is correct
21 Correct 4 ms 1624 KB Output is correct
22 Correct 4 ms 1620 KB Output is correct
23 Correct 4 ms 1620 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 63 ms 8404 KB Output is correct
26 Correct 66 ms 8404 KB Output is correct
27 Correct 67 ms 8404 KB Output is correct
28 Correct 52 ms 8416 KB Output is correct
29 Correct 49 ms 8424 KB Output is correct
30 Correct 46 ms 8416 KB Output is correct
31 Correct 46 ms 8404 KB Output is correct
32 Correct 46 ms 8300 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1753 ms 98560 KB Output is correct
39 Correct 1759 ms 98564 KB Output is correct
40 Correct 1729 ms 98500 KB Output is correct
41 Correct 1784 ms 98564 KB Output is correct
42 Correct 4034 ms 98636 KB Output is correct
43 Correct 4324 ms 101772 KB Output is correct
44 Correct 4258 ms 102120 KB Output is correct
45 Correct 4387 ms 95616 KB Output is correct
46 Correct 1796 ms 99532 KB Output is correct
47 Correct 1724 ms 99528 KB Output is correct
48 Correct 1701 ms 100352 KB Output is correct
49 Correct 1763 ms 102268 KB Output is correct
50 Correct 727 ms 51444 KB Output is correct
51 Correct 677 ms 51436 KB Output is correct
52 Correct 1755 ms 101328 KB Output is correct
53 Correct 1741 ms 102276 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4948 KB Output is correct
2 Correct 18 ms 3796 KB Output is correct
3 Correct 18 ms 4948 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 20 ms 5012 KB Output is correct
6 Correct 18 ms 4996 KB Output is correct
7 Correct 18 ms 4948 KB Output is correct
8 Correct 16 ms 5004 KB Output is correct
9 Correct 18 ms 4948 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 148 ms 49076 KB Output is correct
8 Correct 315 ms 103984 KB Output is correct
9 Correct 311 ms 104732 KB Output is correct
10 Correct 317 ms 104728 KB Output is correct
11 Correct 138 ms 51708 KB Output is correct
12 Correct 266 ms 100060 KB Output is correct
13 Correct 302 ms 104596 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 5 ms 1620 KB Output is correct
18 Correct 5 ms 1640 KB Output is correct
19 Correct 9 ms 1632 KB Output is correct
20 Correct 4 ms 1620 KB Output is correct
21 Correct 4 ms 1624 KB Output is correct
22 Correct 4 ms 1620 KB Output is correct
23 Correct 4 ms 1620 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 63 ms 8404 KB Output is correct
26 Correct 66 ms 8404 KB Output is correct
27 Correct 67 ms 8404 KB Output is correct
28 Correct 52 ms 8416 KB Output is correct
29 Correct 49 ms 8424 KB Output is correct
30 Correct 46 ms 8416 KB Output is correct
31 Correct 46 ms 8404 KB Output is correct
32 Correct 46 ms 8300 KB Output is correct
33 Correct 1753 ms 98560 KB Output is correct
34 Correct 1759 ms 98564 KB Output is correct
35 Correct 1729 ms 98500 KB Output is correct
36 Correct 1784 ms 98564 KB Output is correct
37 Correct 4034 ms 98636 KB Output is correct
38 Correct 4324 ms 101772 KB Output is correct
39 Correct 4258 ms 102120 KB Output is correct
40 Correct 4387 ms 95616 KB Output is correct
41 Correct 1796 ms 99532 KB Output is correct
42 Correct 1724 ms 99528 KB Output is correct
43 Correct 1701 ms 100352 KB Output is correct
44 Correct 1763 ms 102268 KB Output is correct
45 Correct 727 ms 51444 KB Output is correct
46 Correct 677 ms 51436 KB Output is correct
47 Correct 1755 ms 101328 KB Output is correct
48 Correct 1741 ms 102276 KB Output is correct
49 Correct 23 ms 4948 KB Output is correct
50 Correct 18 ms 3796 KB Output is correct
51 Correct 18 ms 4948 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 20 ms 5012 KB Output is correct
54 Correct 18 ms 4996 KB Output is correct
55 Correct 18 ms 4948 KB Output is correct
56 Correct 16 ms 5004 KB Output is correct
57 Correct 18 ms 4948 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 148 ms 49076 KB Output is correct
62 Correct 315 ms 103984 KB Output is correct
63 Correct 311 ms 104732 KB Output is correct
64 Correct 317 ms 104728 KB Output is correct
65 Correct 138 ms 51708 KB Output is correct
66 Correct 266 ms 100060 KB Output is correct
67 Correct 302 ms 104596 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 1 ms 468 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Incorrect 266 ms 111488 KB Output isn't correct
74 Halted 0 ms 0 KB -