oj.uz

Submission #470376

# Submission time Handle Problem Language Result Execution time Memory
470376 2021-09-03T15:58:24 Z tutis Rectangles (IOI19_rect) C++17
100 / 100
 1774 ms 294024 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
long long count_rectangles(vector<vector<int> > a) {
	int n = a.size();
	int m = a[0].size();
	vector<vector<int>> j2(n, vector<int>(m, -1));
	vector<vector<int>> j1(n, vector<int>(m, -1));
	vector<vector<int>> i2(n, vector<int>(m, -1));
	vector<vector<int>> i1(n, vector<int>(m, -1));
	for (int i = 0; i < n; i++)
	{
		vector<int>A;
		for (int j = 0; j < m; j++)
		{
			while (A.size() > 0 && a[i][A.back()] < a[i][j])
				A.pop_back();
			if (!A.empty())
				if (A.back() + 1 <= j - 1 && a[i][A.back()] != a[i][j])
					j1[i][j] = A.back();
			A.push_back(j);
		}
		A.clear();
		for (int j = m - 1; j >= 0; j--)
		{
			while (A.size() > 0 && a[i][A.back()] < a[i][j])
				A.pop_back();
			if (!A.empty())
				if (j + 1 <= A.back() - 1)
					j2[i][j] = A.back();
			A.push_back(j);
		}
	}
	for (int j = 0; j < m; j++)
	{
		vector<int>A;
		for (int i = 0; i < n; i++)
		{
			while (A.size() > 0 && a[A.back()][j] < a[i][j])
				A.pop_back();
			if (!A.empty())
			{
				if (A.back() + 1 <= i - 1 && a[A.back()][j] != a[i][j])
					i1[i][j] = A.back();
				else
					i1[i][j] = -1;
			}
			else
				i1[i][j] = -1;
			A.push_back(i);
		}
		A.clear();
		for (int i = n - 1; i >= 0; i--)
		{
			while (A.size() > 0 && a[A.back()][j] < a[i][j])
				A.pop_back();
			if (!A.empty())
			{
				if (i + 1 <= A.back() - 1)
					i2[i][j] = A.back();
				else
					i2[i][j] = -1;
			}
			else
				i2[i][j] = -1;
			A.push_back(i);
		}
	}
	vector<vector<int>> dpi1(n, vector<int>(m, n + 1));
	vector<vector<int>> dpi2(n, vector<int>(m, n + 1));
	vector<vector<int>> dpj1(m, vector<int>(n, m + 1));
	vector<vector<int>> dpj2(m, vector<int>(n, m + 1));
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			int j_ = j2[i][j];
			if (j_ != -1)
			{
				dpi1[i][j] = i;
				if (i != 0)
				{
					if (j2[i - 1][j] == j_)
						dpi1[i][j] = dpi1[i - 1][j];
					if (j1[i - 1][j_] == j)
						dpi1[i][j] = dpi2[i - 1][j_];
				}
			}
		}
		for (int j = m - 1; j >= 0; j--)
		{
			int j_ = j1[i][j];
			if (j_ != -1)
			{
				dpi2[i][j] = i;
				if (i != 0)
				{
					if (j1[i - 1][j] == j_)
						dpi2[i][j] = dpi2[i - 1][j];
					if (j2[i - 1][j_] == j)
						dpi2[i][j] = dpi1[i - 1][j_];
				}
			}
		}
	}
	for (int j = 0; j < m; j++)
	{
		for (int i = 0; i < n; i++)
		{
			int i_ = i2[i][j];
			if (i_ != -1)
			{
				dpj1[j][i] = j;
				if (j != 0)
				{
					if (i2[i][j - 1] == i_)
						dpj1[j][i] = dpj1[j - 1][i];
					if (i1[i_][j - 1] == i)
						dpj1[j][i] = dpj2[j - 1][i_];
				}
			}
		}
		for (int i = n - 1; i >= 0; i--)
		{
			int i_ = i1[i][j];
			if (i_ != -1)
			{
				dpj2[j][i] = j;
				if (j != 0)
				{
					if (i1[i][j - 1] == i_)
						dpj2[j][i] = dpj2[j - 1][i];
					if (i2[i_][j - 1] == i)
						dpj2[j][i] = dpj1[j - 1][i_];
				}
			}
		}
	}
	long long ans = 0;
	set<tuple<int, int, int, int>>S;
	auto check = [&](int x1, int x2, int y1, int y2)->void
	{
		if (x1 == -1 || x2 == -1 || y1 == -1 || y2 == -1)
			return;
		// if (S.count({x1, x2, y1, y2}))
		// return;
		// S.insert({x1, x2, y1, y2});
		for (int i : {x1 + 1, x2 - 1})
		{
			if (j2[i][y1] != y2 && j1[i][y2] != y1)
				return;
		}
		for (int j : {y1 + 1, y2 - 1})
		{
			if (i2[x1][j] != x2 && i1[x2][j] != x1)
				return;
		}
		if (j2[x2 - 1][y1] == y2)
		{
			if (dpi1[x2 - 1][y1] > x1 + 1)
				return;
		}
		else
		{
			if (dpi2[x2 - 1][y2] > x1 + 1)
				return;
		}
		if (i2[x1][y2 - 1] == x2)
		{
			if (dpj1[y2 - 1][x1] > y1 + 1)
				return;
		}
		else
		{
			if (dpj2[y2 - 1][x2] > y1 + 1)
				return;
		}
		ans++;
	};
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			if (j != 0 && j != m - 1)
				for (int i_ : {i1[i][j], i2[i][j]})
				{
					if (i_ == -1)
						continue;
					int x1 = i;
					int x2 = i_;
					if (x1 > x2)
						swap(x1, x2);
					check(x1, x2, j - 1, j2[x1 + 1][j - 1]);
					check(x1, x2, j1[x1 + 1][j + 1], j + 1);
				}
		}
	}
	return ans;
}
// int main()
// {
// 	cout << count_rectangles({{1, 1, 1}, {1, 0, 1}, {1, 1, 1}}) << endl;
// }

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 204 KB Output is correct
3 Correct 1 ms 204 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 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 268 KB Output is correct
20 Correct 1 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 204 KB Output is correct
3 Correct 1 ms 204 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 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 268 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 2 ms 568 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 3 ms 460 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 2 ms 332 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 204 KB Output is correct
3 Correct 1 ms 204 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 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 2 ms 568 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 268 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 5 ms 1868 KB Output is correct
31 Correct 5 ms 1868 KB Output is correct
32 Correct 6 ms 1868 KB Output is correct
33 Correct 7 ms 1868 KB Output is correct
34 Correct 10 ms 1932 KB Output is correct
35 Correct 13 ms 1984 KB Output is correct
36 Correct 11 ms 1856 KB Output is correct
37 Correct 10 ms 1896 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 204 KB Output is correct
3 Correct 1 ms 204 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 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 2 ms 568 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 5 ms 1868 KB Output is correct
26 Correct 5 ms 1868 KB Output is correct
27 Correct 6 ms 1868 KB Output is correct
28 Correct 7 ms 1868 KB Output is correct
29 Correct 10 ms 1932 KB Output is correct
30 Correct 13 ms 1984 KB Output is correct
31 Correct 11 ms 1856 KB Output is correct
32 Correct 10 ms 1896 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 268 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 46 ms 19724 KB Output is correct
39 Correct 56 ms 19720 KB Output is correct
40 Correct 50 ms 19636 KB Output is correct
41 Correct 61 ms 19720 KB Output is correct
42 Correct 57 ms 19628 KB Output is correct
43 Correct 59 ms 19640 KB Output is correct
44 Correct 69 ms 19720 KB Output is correct
45 Correct 74 ms 18440 KB Output is correct
46 Correct 64 ms 19632 KB Output is correct
47 Correct 88 ms 19616 KB Output is correct
48 Correct 117 ms 19632 KB Output is correct
49 Correct 129 ms 19620 KB Output is correct
50 Correct 60 ms 9996 KB Output is correct
51 Correct 56 ms 9948 KB Output is correct
52 Correct 107 ms 19724 KB Output is correct
53 Correct 116 ms 19632 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 268 KB Output is correct
4 Correct 1 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 402 ms 112860 KB Output is correct
8 Correct 887 ms 244624 KB Output is correct
9 Correct 862 ms 245860 KB Output is correct
10 Correct 870 ms 245820 KB Output is correct
11 Correct 306 ms 121564 KB Output is correct
12 Correct 599 ms 230524 KB Output is correct
13 Correct 692 ms 245876 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 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 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 2 ms 568 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 5 ms 1868 KB Output is correct
26 Correct 5 ms 1868 KB Output is correct
27 Correct 6 ms 1868 KB Output is correct
28 Correct 7 ms 1868 KB Output is correct
29 Correct 10 ms 1932 KB Output is correct
30 Correct 13 ms 1984 KB Output is correct
31 Correct 11 ms 1856 KB Output is correct
32 Correct 10 ms 1896 KB Output is correct
33 Correct 46 ms 19724 KB Output is correct
34 Correct 56 ms 19720 KB Output is correct
35 Correct 50 ms 19636 KB Output is correct
36 Correct 61 ms 19720 KB Output is correct
37 Correct 57 ms 19628 KB Output is correct
38 Correct 59 ms 19640 KB Output is correct
39 Correct 69 ms 19720 KB Output is correct
40 Correct 74 ms 18440 KB Output is correct
41 Correct 64 ms 19632 KB Output is correct
42 Correct 88 ms 19616 KB Output is correct
43 Correct 117 ms 19632 KB Output is correct
44 Correct 129 ms 19620 KB Output is correct
45 Correct 60 ms 9996 KB Output is correct
46 Correct 56 ms 9948 KB Output is correct
47 Correct 107 ms 19724 KB Output is correct
48 Correct 116 ms 19632 KB Output is correct
49 Correct 2 ms 716 KB Output is correct
50 Correct 1 ms 716 KB Output is correct
51 Correct 1 ms 716 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 2 ms 716 KB Output is correct
54 Correct 2 ms 716 KB Output is correct
55 Correct 2 ms 716 KB Output is correct
56 Correct 2 ms 716 KB Output is correct
57 Correct 3 ms 696 KB Output is correct
58 Correct 1 ms 588 KB Output is correct
59 Correct 2 ms 716 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 402 ms 112860 KB Output is correct
62 Correct 887 ms 244624 KB Output is correct
63 Correct 862 ms 245860 KB Output is correct
64 Correct 870 ms 245820 KB Output is correct
65 Correct 306 ms 121564 KB Output is correct
66 Correct 599 ms 230524 KB Output is correct
67 Correct 692 ms 245876 KB Output is correct
68 Correct 0 ms 204 KB Output is correct
69 Correct 0 ms 204 KB Output is correct
70 Correct 1 ms 268 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 839 ms 245876 KB Output is correct
74 Correct 778 ms 245772 KB Output is correct
75 Correct 879 ms 245884 KB Output is correct
76 Correct 945 ms 292832 KB Output is correct
77 Correct 945 ms 294012 KB Output is correct
78 Correct 941 ms 161392 KB Output is correct
79 Correct 987 ms 177544 KB Output is correct
80 Correct 1612 ms 268672 KB Output is correct
81 Correct 1002 ms 176452 KB Output is correct
82 Correct 1249 ms 235300 KB Output is correct
83 Correct 1774 ms 293852 KB Output is correct
84 Correct 896 ms 169252 KB Output is correct
85 Correct 1613 ms 294024 KB Output is correct
86 Correct 1557 ms 285992 KB Output is correct
87 Correct 534 ms 176744 KB Output is correct
88 Correct 919 ms 293652 KB Output is correct
89 Correct 919 ms 293720 KB Output is correct
90 Correct 925 ms 293896 KB Output is correct