oj.uz

Submission #420773

# Submission time Handle Problem Language Result Execution time Memory
420773 2021-06-08T13:50:30 Z QCFium Rectangles (IOI19_rect) C++14
72 / 100
 4434 ms 692036 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

struct BIT {
	int n;
	std::vector<int> data;
	int all_sum = 0;
	BIT (int n) : n(n), data(n + 1) {}
	void add(int i, int val) {
		for (i++; i <= n; i += i & -i) data[i] += val;
		all_sum += val;
	}
	int sum_left(int r) {
		int res = 0;
		for (; r; r -= r & -r) res += data[r];
		return res;
	}
	int sum_right(int l) { return all_sum - sum_left(l); }
};
struct SegTree {
	int n;
	std::vector<int> data;
	SegTree (int n_) {
		for (n = 1; n < n_; n <<= 1);
		data.resize(n << 1);
	}
	void add(int i, int val) {
		for (i += n; i; i >>= 1) data[i] += val;
	}
	int sum(int l, int r) {
		int res = 0;
		for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
			if (r & 1) res += data[--r];
			if (l & 1) res += data[l++];
		}
		return res;
	}
};

long long count_rectangles2(std::vector<std::vector<int> > a) {
	int n = a.size();
	int m = a[0].size();
	int64_t res = 0;
	
	bool subtask6_flag = true;
	for (auto i : a) for (auto j : i) if (j != 0 && j != 1) subtask6_flag = false;
	
	if (subtask6_flag) {
		std::vector<std::vector<bool> > visited(n, std::vector<bool>(m));
		std::queue<std::pair<int, int> > que;
		std::pair<int, int> dd[] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (a[i][j]) continue;
				if (!visited[i][j]) {
					visited[i][j] = true;
					que.push({i, j});
					int xmin = 1000000000;
					int xmax = -1;
					int ymin = 1000000000;
					int ymax = -1;
					int num = 0;
					while (que.size()) {
						auto i = que.front();
						que.pop();
						num++;
						xmin = std::min(xmin, i.first);
						xmax = std::max(xmax, i.first);
						ymin = std::min(ymin, i.second);
						ymax = std::max(ymax, i.second);
						for (auto d : dd) {
							int x = i.first + d.first;
							int y = i.second + d.second;
							if (x < 0 || x >= n || y < 0 || y >= m) continue;
							if (a[x][y]) continue;
							if (!visited[x][y]) visited[x][y] = true, que.push({x, y});
						}
					}
					if (xmin == 0 || xmax == n - 1 || ymin == 0 || ymax == m - 1 || num != (xmax - xmin + 1) * (ymax - ymin + 1)) continue;
					res++;
				}
			}
		}
	} else assert(0);
	return res;
}

long long count_rectangles(std::vector<std::vector<int> > a) {
	int n = a.size();
	int m = a[0].size();
	
	bool subtask6_flag = true;
	for (auto i : a) for (auto j : i) if (j != 0 && j != 1) subtask6_flag = false;
	
	int64_t res = 0;
	if (n <= 2 || m <= 2) return 0;
	else if (subtask6_flag) {
		std::vector<std::vector<bool> > visited(n, std::vector<bool>(m));
		std::queue<std::pair<int, int> > que;
		std::pair<int, int> dd[] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (a[i][j]) continue;
				if (!visited[i][j]) {
					visited[i][j] = true;
					que.push({i, j});
					int xmin = 1000000000;
					int xmax = -1;
					int ymin = 1000000000;
					int ymax = -1;
					int num = 0;
					while (que.size()) {
						auto i = que.front();
						que.pop();
						num++;
						xmin = std::min(xmin, i.first);
						xmax = std::max(xmax, i.first);
						ymin = std::min(ymin, i.second);
						ymax = std::max(ymax, i.second);
						for (auto d : dd) {
							int x = i.first + d.first;
							int y = i.second + d.second;
							if (x < 0 || x >= n || y < 0 || y >= m) continue;
							if (a[x][y]) continue;
							if (!visited[x][y]) visited[x][y] = true, que.push({x, y});
						}
					}
					if (xmin == 0 || xmax == n - 1 || ymin == 0 || ymax == m - 1 || num != (xmax - xmin + 1) * (ymax - ymin + 1)) continue;
					res++;
				}
			}
		}
	} else if (n == 3) {
		auto solve_sub = [&] (std::vector<int> a) {
			int n = a.size();
			std::deque<int> all;
			for (int i = n - 1; i >= 0; i--) {
				if (i <= n - 3) {
					int tmp = std::lower_bound(all.begin(), all.end(), a[i]) - all.begin();
					tmp = std::min(tmp, (int) all.size() - 1);
					res += std::max(0, tmp);
				}
				while (all.size() && all.front() <= a[i]) all.pop_front();
				all.push_front(a[i]);
			}
		};
		std::vector<int> all{a[1][0]};
		for (int i = 1; i < m; i++) {
			bool ok = i != m - 1 && a[1][i] < a[0][i] && a[1][i] < a[2][i];
			if (!ok) {
				if (all.size() > 1) {
					all.push_back(a[1][i]);
					solve_sub(all);
				}
				all = {a[1][i]};
			} else all.push_back(a[1][i]);
		}
	} else if (n <= 700 && m <= 700) {
		std::vector<std::vector<std::vector<int> > > r1(n, std::vector<std::vector<int> > (m));
		for (int i = 1; i + 1 < m; i++) {
			std::vector<int> cur(m - i, 0);
			for (int k = n - 2; k >= 1; k--) {
				int max = -1;
				for (int j = i + 1; j < m; j++) {
					max = std::max(max, a[k][j - 1]);
					if (max < a[k][j] && max < a[k][i - 1]) cur[j - i]++;
					else cur[j - i] = 0;
				}
				r1[k][i] = cur;
			}
		}
		
		auto calc = [&] (const std::vector<int> &r0, const std::vector<int> &r1) {
			std::vector<int> all[r0.size()];
			for (int k = 1; k < (int) r1.size(); k++) if (r1[k]) all[r1[k]].push_back(k);
			BIT tree(r1.size());
			for (int k = 1; k < (int) r0.size(); k++) {
				tree.add(r0[k], 1);
				for (auto l : all[k]) res += tree.sum_right(l);
			}
		};
		
		for (int i = 1; i + 1 < n; i++) {
			bool ok[n][m];
			std::vector<int> max(m, -1);
			for (int j = i + 1; j < n; j++) {
				for (int k = 1; k + 1 < m; k++) {
					max[k] = std::max(max[k], a[j - 1][k]);
					ok[j][k] = max[k] < a[j][k] && max[k] < a[i - 1][k];
				}
			}
			std::vector<int> cur(n - i, 0);
			for (int j = m - 2; j >= 1; j--) {
				for (int k = i + 1; k < n; k++) {
					if (ok[k][j]) cur[k - i]++;
					else cur[k - i] = 0;
				}
				calc(cur, r1[i][j]);
			}
		}
	} else assert(0);
	return res;
}

std::random_device rnd_dev;
std::mt19937 rnd(rnd_dev() ^ clock());
int rnd_int(int l, int r) { return std::uniform_int_distribution<>(l, r)(rnd); }

bool check() {
	int n = rnd_int(1, 4);
	int m = rnd_int(1, 4);
	std::vector<std::vector<int> > a(n, std::vector<int>(m));
	for (auto &i : a) for (auto &j : i) j = rnd_int(0, 1);
	
	auto r0 = count_rectangles2(a);
	auto r1 = count_rectangles(a);
	if (r0 != r1) {
		std::cerr << n << " " << m << std::endl;
		for (auto i : a) {
			for (auto j : i) std::cerr << j << " ";
			std::cerr << std::endl;
		}
		std::cerr << "r0/r1 : " << r0 << "/" << r1 << std::endl;
		return false;
	}
	return true;
}

#ifdef LOCAL
int main() {
	for (int i = 0; i < 10000; i++) if (!check()) {
		std::cerr << "failed at " << i << std::endl;
		return 0;
	}
	return 0;
	
	int n = ri();
	int m = ri();
	std::vector<std::vector<int> > a(n, std::vector<int>(m));
	for (auto &i : a) for (auto &j : i) j = ri();
	
	printf("%lld\n", count_rectangles(a));
	
	{
		int n, m;
		n = m = 700;
		std::vector<std::vector<int> > a(n, std::vector<int>(m));
		for (auto &i : a) for (auto &j : i) j = rnd_int(1, 1000000);
		
		clock_t r0 = clock();
		int res = count_rectangles(a);
		clock_t r1 = clock();
		printf("%d\n", res);
		printf("took %f ms\n", (double) (r1 - r0) * 1000 / CLOCKS_PER_SEC);
	}
	
	return 0;
}
#endif

Compilation message

rect.cpp: In function 'int ri()':
rect.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 272 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 7 ms 1564 KB Output is correct
23 Correct 7 ms 1560 KB Output is correct
24 Correct 8 ms 1484 KB Output is correct
25 Correct 7 ms 1484 KB Output is correct
26 Correct 9 ms 1484 KB Output is correct
27 Correct 10 ms 1484 KB Output is correct
28 Correct 7 ms 1484 KB Output is correct
29 Correct 3 ms 588 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 272 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 7 ms 1564 KB Output is correct
18 Correct 7 ms 1560 KB Output is correct
19 Correct 8 ms 1484 KB Output is correct
20 Correct 7 ms 1484 KB Output is correct
21 Correct 9 ms 1484 KB Output is correct
22 Correct 10 ms 1484 KB Output is correct
23 Correct 7 ms 1484 KB Output is correct
24 Correct 3 ms 588 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 101 ms 17584 KB Output is correct
31 Correct 102 ms 17740 KB Output is correct
32 Correct 103 ms 17896 KB Output is correct
33 Correct 115 ms 17664 KB Output is correct
34 Correct 103 ms 17736 KB Output is correct
35 Correct 107 ms 17888 KB Output is correct
36 Correct 105 ms 17848 KB Output is correct
37 Correct 105 ms 17476 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 272 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 7 ms 1564 KB Output is correct
18 Correct 7 ms 1560 KB Output is correct
19 Correct 8 ms 1484 KB Output is correct
20 Correct 7 ms 1484 KB Output is correct
21 Correct 9 ms 1484 KB Output is correct
22 Correct 10 ms 1484 KB Output is correct
23 Correct 7 ms 1484 KB Output is correct
24 Correct 3 ms 588 KB Output is correct
25 Correct 101 ms 17584 KB Output is correct
26 Correct 102 ms 17740 KB Output is correct
27 Correct 103 ms 17896 KB Output is correct
28 Correct 115 ms 17664 KB Output is correct
29 Correct 103 ms 17736 KB Output is correct
30 Correct 107 ms 17888 KB Output is correct
31 Correct 105 ms 17848 KB Output is correct
32 Correct 105 ms 17476 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 4434 ms 692036 KB Output is correct
39 Correct 4416 ms 691312 KB Output is correct
40 Correct 4293 ms 691188 KB Output is correct
41 Correct 4322 ms 691280 KB Output is correct
42 Correct 4292 ms 691268 KB Output is correct
43 Correct 4305 ms 689356 KB Output is correct
44 Correct 4322 ms 691404 KB Output is correct
45 Correct 3839 ms 645776 KB Output is correct
46 Correct 31 ms 4156 KB Output is correct
47 Correct 4357 ms 691316 KB Output is correct
48 Correct 4429 ms 691276 KB Output is correct
49 Correct 4401 ms 691280 KB Output is correct
50 Correct 1844 ms 178844 KB Output is correct
51 Correct 1353 ms 344908 KB Output is correct
52 Correct 4323 ms 691308 KB Output is correct
53 Correct 4417 ms 691308 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 155 ms 23192 KB Output is correct
8 Correct 336 ms 50100 KB Output is correct
9 Correct 308 ms 50836 KB Output is correct
10 Correct 382 ms 51012 KB Output is correct
11 Correct 153 ms 25620 KB Output is correct
12 Correct 369 ms 47896 KB Output is correct
13 Correct 379 ms 50884 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 272 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 7 ms 1564 KB Output is correct
18 Correct 7 ms 1560 KB Output is correct
19 Correct 8 ms 1484 KB Output is correct
20 Correct 7 ms 1484 KB Output is correct
21 Correct 9 ms 1484 KB Output is correct
22 Correct 10 ms 1484 KB Output is correct
23 Correct 7 ms 1484 KB Output is correct
24 Correct 3 ms 588 KB Output is correct
25 Correct 101 ms 17584 KB Output is correct
26 Correct 102 ms 17740 KB Output is correct
27 Correct 103 ms 17896 KB Output is correct
28 Correct 115 ms 17664 KB Output is correct
29 Correct 103 ms 17736 KB Output is correct
30 Correct 107 ms 17888 KB Output is correct
31 Correct 105 ms 17848 KB Output is correct
32 Correct 105 ms 17476 KB Output is correct
33 Correct 4434 ms 692036 KB Output is correct
34 Correct 4416 ms 691312 KB Output is correct
35 Correct 4293 ms 691188 KB Output is correct
36 Correct 4322 ms 691280 KB Output is correct
37 Correct 4292 ms 691268 KB Output is correct
38 Correct 4305 ms 689356 KB Output is correct
39 Correct 4322 ms 691404 KB Output is correct
40 Correct 3839 ms 645776 KB Output is correct
41 Correct 31 ms 4156 KB Output is correct
42 Correct 4357 ms 691316 KB Output is correct
43 Correct 4429 ms 691276 KB Output is correct
44 Correct 4401 ms 691280 KB Output is correct
45 Correct 1844 ms 178844 KB Output is correct
46 Correct 1353 ms 344908 KB Output is correct
47 Correct 4323 ms 691308 KB Output is correct
48 Correct 4417 ms 691308 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 155 ms 23192 KB Output is correct
62 Correct 336 ms 50100 KB Output is correct
63 Correct 308 ms 50836 KB Output is correct
64 Correct 382 ms 51012 KB Output is correct
65 Correct 153 ms 25620 KB Output is correct
66 Correct 369 ms 47896 KB Output is correct
67 Correct 379 ms 50884 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 0 ms 204 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Runtime error 300 ms 100140 KB Execution killed with signal 6
74 Halted 0 ms 0 KB -