oj.uz

Submission #1068056

# Submission time Handle Problem Language Result Execution time Memory
1068056 2024-08-21T06:59:02 Z Gromp15 Rectangles (IOI19_rect) C++17
59 / 100
 1762 ms 75460 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include "rect.h"
#define ll long long
#define ar array
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rint(l, r) uniform_int_distribution<int>(l, r)(rng)

struct fenwick {
	int n; vector<int> bit;
	fenwick(int a) : n(a), bit(a+1) {}
	void update(int pos, int x) {
		pos++;
		for (int i = pos; i <= n; i += i&-i) bit[i] += x;
	}
	int sum(int pos) {
		int res = 0;
		while (pos) res += bit[pos], pos -= pos&-pos;
		return res;
	}
	int query(int l, int r) {
		return sum(r+1) - sum(l);
	}
};

long long count_rectangles(std::vector<std::vector<int>> a) {
	int n = sz(a), m = sz(a[0]);
	if ((n <= 700 && m <= 700) || (n <= 3)) {
		vector ok(n, vector(n, vector<bool>(m)));
		for (int i = 0; i < m; i++) {
			for (int j = 1; j < n-1; j++) {
				int mx = 0;
				for (int k = j; k < n-1; k++) {
					ckmax(mx, a[k][i]);
					ok[j][k][i] = mx >= min(a[j-1][i], a[k+1][i]);
				}
			}
		}
		vector<vector<int>> right(n, vector<int>(m, -1)), left(n, vector<int>(m, m-1));
		for (int i = 0; i < n; i++) {
			for (int j = 1; j < m-1; j++) {
				int mx = 0;
				for (int k = j; k < m-1; k++) {
					ckmax(mx, a[i][k]);
					if (mx >= a[i][j-1]) break;
					right[i][j] = k;
				}
			}
			for (int j = m-2; j >= 1; j--) {
				int mx = 0;
				for (int k = j; k >= 1; k--) {
					ckmax(mx, a[i][k]);
					if (mx >= a[i][j+1]) break;
					left[i][j] = k;
				}
			}
		}
		long long ans = 0;
		for (int i = 1; i < n-1; i++) { 
			vector<int> R(m, m-2), L(m, -1);
			for (int j = i; j < n-1; j++) {
				for (int k = 0; k < m; k++) {
					ckmin(R[k], right[j][k]);
					ckmax(L[k], left[j][k]);
				}
				vector<int> to(m, -1);
				for (int k = m-1; k >= 0; k--) if (!ok[i][j][k]) {
					int l = k;
					while (l && !ok[i][j][l-1]) l--;
					for (int z = l; z <= k; z++) to[z] = k;
					k = l;
				}
				for (int k = 1; k < m-1; k++) {
					int r = min(to[k], R[k]);
					for (int l = k; l <= r; l++) ans += L[l] <= k;
				}
			}
		}
		return ans;
	}
	vector<vector<bool>> vis(n, vector<bool>(m));
	const int dx[]{1, 0, -1, 0}, dy[]{0, 1, 0, -1};
	int ans = 0;
	for (int i = 1; i < n-1; i++) {
		for (int j = 1; j < m-1; j++) if (!vis[i][j] && !a[i][j]) {
			int lx = i, ly = j, rx = i, ry = j, got = 0;
			auto dfs = [&](auto&& s, int x, int y) -> void {
				vis[x][y] = 1, got++;
				ckmin(lx, x);
				ckmax(rx, x);
				ckmin(ly, y);
				ckmax(ry, y);
				for (int d = 0; d < 4; d++) {
					int nx = x + dx[d], ny = y + dy[d];
					if (nx >= 1 && ny >= 1 && nx < n-1 && ny < m-1 && !vis[nx][ny] && !a[nx][ny]) s(s, nx, ny);
				}
			};
			dfs(dfs, i, j);
			ans += (rx-lx+1)*(ry-ly+1) == got;
		}
	}
	return ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 428 KB Output is correct
22 Correct 4 ms 800 KB Output is correct
23 Correct 3 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 3 ms 860 KB Output is correct
26 Correct 3 ms 960 KB Output is correct
27 Correct 5 ms 860 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 4 ms 860 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 4 ms 800 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 3 ms 860 KB Output is correct
21 Correct 3 ms 960 KB Output is correct
22 Correct 5 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 428 KB Output is correct
30 Correct 47 ms 4760 KB Output is correct
31 Correct 31 ms 4696 KB Output is correct
32 Correct 29 ms 4700 KB Output is correct
33 Correct 29 ms 4616 KB Output is correct
34 Correct 29 ms 4440 KB Output is correct
35 Correct 31 ms 4788 KB Output is correct
36 Correct 27 ms 4756 KB Output is correct
37 Correct 34 ms 4700 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 4 ms 800 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 3 ms 860 KB Output is correct
21 Correct 3 ms 960 KB Output is correct
22 Correct 5 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 47 ms 4760 KB Output is correct
26 Correct 31 ms 4696 KB Output is correct
27 Correct 29 ms 4700 KB Output is correct
28 Correct 29 ms 4616 KB Output is correct
29 Correct 29 ms 4440 KB Output is correct
30 Correct 31 ms 4788 KB Output is correct
31 Correct 27 ms 4756 KB Output is correct
32 Correct 34 ms 4700 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 428 KB Output is correct
38 Correct 1695 ms 74992 KB Output is correct
39 Correct 1600 ms 75088 KB Output is correct
40 Correct 1584 ms 74996 KB Output is correct
41 Correct 1654 ms 75000 KB Output is correct
42 Correct 1648 ms 74996 KB Output is correct
43 Correct 1733 ms 75004 KB Output is correct
44 Correct 1762 ms 75308 KB Output is correct
45 Correct 1479 ms 66644 KB Output is correct
46 Correct 1519 ms 73972 KB Output is correct
47 Correct 1547 ms 74064 KB Output is correct
48 Correct 1509 ms 74408 KB Output is correct
49 Correct 1632 ms 75460 KB Output is correct
50 Correct 687 ms 55508 KB Output is correct
51 Correct 347 ms 21900 KB Output is correct
52 Correct 1555 ms 74804 KB Output is correct
53 Correct 1594 ms 75352 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 604 KB Output is correct
2 Correct 7 ms 604 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 528 KB Output is correct
6 Correct 1 ms 528 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 428 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 113 ms 26408 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 4 ms 800 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 3 ms 860 KB Output is correct
21 Correct 3 ms 960 KB Output is correct
22 Correct 5 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 47 ms 4760 KB Output is correct
26 Correct 31 ms 4696 KB Output is correct
27 Correct 29 ms 4700 KB Output is correct
28 Correct 29 ms 4616 KB Output is correct
29 Correct 29 ms 4440 KB Output is correct
30 Correct 31 ms 4788 KB Output is correct
31 Correct 27 ms 4756 KB Output is correct
32 Correct 34 ms 4700 KB Output is correct
33 Correct 1695 ms 74992 KB Output is correct
34 Correct 1600 ms 75088 KB Output is correct
35 Correct 1584 ms 74996 KB Output is correct
36 Correct 1654 ms 75000 KB Output is correct
37 Correct 1648 ms 74996 KB Output is correct
38 Correct 1733 ms 75004 KB Output is correct
39 Correct 1762 ms 75308 KB Output is correct
40 Correct 1479 ms 66644 KB Output is correct
41 Correct 1519 ms 73972 KB Output is correct
42 Correct 1547 ms 74064 KB Output is correct
43 Correct 1509 ms 74408 KB Output is correct
44 Correct 1632 ms 75460 KB Output is correct
45 Correct 687 ms 55508 KB Output is correct
46 Correct 347 ms 21900 KB Output is correct
47 Correct 1555 ms 74804 KB Output is correct
48 Correct 1594 ms 75352 KB Output is correct
49 Correct 10 ms 604 KB Output is correct
50 Correct 7 ms 604 KB Output is correct
51 Correct 1 ms 444 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 528 KB Output is correct
54 Correct 1 ms 528 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 2 ms 600 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Incorrect 113 ms 26408 KB Output isn't correct
62 Halted 0 ms 0 KB -