oj.uz

Submission #726562

# Submission time Handle Problem Language Result Execution time Memory
726562 2023-04-19T05:11:21 Z LittleCube Rectangles (IOI19_rect) C++17
100 / 100
 4352 ms 690680 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#ifndef EVAL
#include "grader.cpp"
#endif
#include "rect.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

namespace
{
	struct BIT
	{
		int bit[2501], N;
		void init(int n)
		{
			N = n;
			for (int i = 1; i < N; i++)
				bit[i] = 0;
		}
		void modify(int pos, int val)
		{
			for (int i = pos; i < N; i += (i & -i))
				bit[i] += val;
		}
		int query(int pos)
		{
			int ans = 0;
			for (int i = pos; i; i -= (i & -i))
				ans += bit[i];
			return ans;
		}

	} bit[2500];

	int N, M;
	pii table[2500][2500];
	vector<pii> ver[2500], hor[2500];
	vector<tuple<int, int, int, int>> event[2500];
	ll ans;

	void add_query(int l, int r, pii range)
	{
		if (range == pii(-1, -1))
			return;

		event[l].emplace_back(make_tuple(r, 0, range.F - 1, range.S + 1));
	}

	void add_modify(pii range, int u, int d)
	{
		if (range == pii(-1, -1))
			return;
		for (int i = range.F - 1; i <= range.S + 1; i++)
			event[i].emplace_back(make_tuple(range.S + 1, 1, u, d));
	}

	ll mango(vector<vector<int>> &a)
	{
		N = a.size(), M = a[0].size();

		if (N <= 2 || M <= 2)
			return 0;

		for (int i = 1; i + 1 < N; i++)
		{
			vector<pii> mono;
			for (int j = 0; j < M; j++)
			{
				while (!mono.empty() && mono.back().F < a[i][j])
				{
					if (j - mono.back().S >= 2)
						ver[i].emplace_back(pii(mono.back().S, j));
					mono.pop_back();
				}
				if (!mono.empty())
					if (j - mono.back().S >= 2)
						ver[i].emplace_back(pii(mono.back().S, j));
				if (!mono.empty() && mono.back().F == a[i][j])
					mono.back().S = j;
				else
					mono.emplace_back(pii(a[i][j], j));
			}
		}

		for (int i = 0; i < M; i++)
			for (int j = 0; j < M; j++)
				table[i][j] = pii(-1, -1);

		for (int i = 1; i + 1 < N; i++)
			for (auto [x, y] : ver[i])
				if (table[x][y].S == i - 1)
					table[x][y].S++;
				else
				{
					add_query(x, y, table[x][y]);
					table[x][y] = pii(i, i);
				}

		for (int i = 0; i < M; i++)
			for (int j = 0; j < M; j++)
				add_query(i, j, table[i][j]);

		for (int i = 1; i + 1 < M; i++)
		{
			vector<pii> mono;
			for (int j = 0; j < N; j++)
			{
				while (!mono.empty() && mono.back().F < a[j][i])
				{
					if (j - mono.back().S >= 2)
						hor[i].emplace_back(pii(mono.back().S, j));
					mono.pop_back();
				}
				if (!mono.empty())
					if (j - mono.back().S >= 2)
						hor[i].emplace_back(pii(mono.back().S, j));
				if (!mono.empty() && mono.back().F == a[j][i])
					mono.back().S = j;
				else
					mono.emplace_back(pii(a[j][i], j));
			}
		}

		for (int i = 0; i < N; i++)
			for (int j = 0; j < N; j++)
				table[i][j] = pii(-1, -1);

		for (int i = 1; i + 1 < M; i++)
			for (auto [x, y] : hor[i])
				if (table[x][y].S == i - 1)
					table[x][y].S++;
				else
				{
					add_modify(table[x][y], x, y);
					table[x][y] = pii(i, i);
				}

		for (int i = 0; i < N; i++)
			for (int j = 0; j < N; j++)
				add_modify(table[i][j], i, j);

		for (int i = 0; i < N; i++)
			bit[i].init(N);
		for (int i = 0; i < M; i++)
		{
			sort(event[i].begin(), event[i].end(), greater<>());
			for (auto [_, t, l, r] : event[i])
			{
				if (t == 1)
					bit[l].modify(r, 1);
				else
					for (int j = l; j <= r; j++)
						ans += bit[j].query(r);
			}
			for (auto [_, t, l, r] : event[i])
				if (t == 1)
					bit[l].modify(r, -1);
		}
		return ans;
	}

}

ll count_rectangles(vector<vector<int>> a)
{
	return mango(a);
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 2 ms 1492 KB Output is correct
18 Correct 2 ms 1620 KB Output is correct
19 Correct 1 ms 1620 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Correct 3 ms 1900 KB Output is correct
22 Correct 4 ms 1876 KB Output is correct
23 Correct 3 ms 1876 KB Output is correct
24 Correct 2 ms 1492 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 7 ms 4448 KB Output is correct
31 Correct 7 ms 4436 KB Output is correct
32 Correct 7 ms 4528 KB Output is correct
33 Correct 9 ms 4948 KB Output is correct
34 Correct 21 ms 6848 KB Output is correct
35 Correct 22 ms 7156 KB Output is correct
36 Correct 18 ms 6336 KB Output is correct
37 Correct 18 ms 6200 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 2 ms 1492 KB Output is correct
18 Correct 2 ms 1620 KB Output is correct
19 Correct 1 ms 1620 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Correct 3 ms 1900 KB Output is correct
22 Correct 4 ms 1876 KB Output is correct
23 Correct 3 ms 1876 KB Output is correct
24 Correct 2 ms 1492 KB Output is correct
25 Correct 7 ms 4448 KB Output is correct
26 Correct 7 ms 4436 KB Output is correct
27 Correct 7 ms 4528 KB Output is correct
28 Correct 9 ms 4948 KB Output is correct
29 Correct 21 ms 6848 KB Output is correct
30 Correct 22 ms 7156 KB Output is correct
31 Correct 18 ms 6336 KB Output is correct
32 Correct 18 ms 6200 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 724 KB Output is correct
36 Correct 1 ms 724 KB Output is correct
37 Correct 0 ms 468 KB Output is correct
38 Correct 124 ms 41436 KB Output is correct
39 Correct 128 ms 43136 KB Output is correct
40 Correct 131 ms 39904 KB Output is correct
41 Correct 101 ms 40256 KB Output is correct
42 Correct 76 ms 37940 KB Output is correct
43 Correct 76 ms 37888 KB Output is correct
44 Correct 77 ms 37964 KB Output is correct
45 Correct 71 ms 36676 KB Output is correct
46 Correct 79 ms 29964 KB Output is correct
47 Correct 111 ms 33856 KB Output is correct
48 Correct 267 ms 62536 KB Output is correct
49 Correct 276 ms 62936 KB Output is correct
50 Correct 138 ms 37920 KB Output is correct
51 Correct 137 ms 35248 KB Output is correct
52 Correct 221 ms 53196 KB Output is correct
53 Correct 231 ms 52720 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 49620 KB Output is correct
2 Correct 21 ms 42276 KB Output is correct
3 Correct 25 ms 49464 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 27 ms 49624 KB Output is correct
6 Correct 26 ms 49620 KB Output is correct
7 Correct 25 ms 49616 KB Output is correct
8 Correct 26 ms 49548 KB Output is correct
9 Correct 26 ms 49492 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 501 ms 160228 KB Output is correct
8 Correct 1221 ms 288412 KB Output is correct
9 Correct 1194 ms 288672 KB Output is correct
10 Correct 1234 ms 289068 KB Output is correct
11 Correct 87 ms 84556 KB Output is correct
12 Correct 162 ms 119884 KB Output is correct
13 Correct 170 ms 122896 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 2 ms 1492 KB Output is correct
18 Correct 2 ms 1620 KB Output is correct
19 Correct 1 ms 1620 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Correct 3 ms 1900 KB Output is correct
22 Correct 4 ms 1876 KB Output is correct
23 Correct 3 ms 1876 KB Output is correct
24 Correct 2 ms 1492 KB Output is correct
25 Correct 7 ms 4448 KB Output is correct
26 Correct 7 ms 4436 KB Output is correct
27 Correct 7 ms 4528 KB Output is correct
28 Correct 9 ms 4948 KB Output is correct
29 Correct 21 ms 6848 KB Output is correct
30 Correct 22 ms 7156 KB Output is correct
31 Correct 18 ms 6336 KB Output is correct
32 Correct 18 ms 6200 KB Output is correct
33 Correct 124 ms 41436 KB Output is correct
34 Correct 128 ms 43136 KB Output is correct
35 Correct 131 ms 39904 KB Output is correct
36 Correct 101 ms 40256 KB Output is correct
37 Correct 76 ms 37940 KB Output is correct
38 Correct 76 ms 37888 KB Output is correct
39 Correct 77 ms 37964 KB Output is correct
40 Correct 71 ms 36676 KB Output is correct
41 Correct 79 ms 29964 KB Output is correct
42 Correct 111 ms 33856 KB Output is correct
43 Correct 267 ms 62536 KB Output is correct
44 Correct 276 ms 62936 KB Output is correct
45 Correct 138 ms 37920 KB Output is correct
46 Correct 137 ms 35248 KB Output is correct
47 Correct 221 ms 53196 KB Output is correct
48 Correct 231 ms 52720 KB Output is correct
49 Correct 25 ms 49620 KB Output is correct
50 Correct 21 ms 42276 KB Output is correct
51 Correct 25 ms 49464 KB Output is correct
52 Correct 0 ms 468 KB Output is correct
53 Correct 27 ms 49624 KB Output is correct
54 Correct 26 ms 49620 KB Output is correct
55 Correct 25 ms 49616 KB Output is correct
56 Correct 26 ms 49548 KB Output is correct
57 Correct 26 ms 49492 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 501 ms 160228 KB Output is correct
62 Correct 1221 ms 288412 KB Output is correct
63 Correct 1194 ms 288672 KB Output is correct
64 Correct 1234 ms 289068 KB Output is correct
65 Correct 87 ms 84556 KB Output is correct
66 Correct 162 ms 119884 KB Output is correct
67 Correct 170 ms 122896 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 1 ms 468 KB Output is correct
70 Correct 1 ms 724 KB Output is correct
71 Correct 1 ms 724 KB Output is correct
72 Correct 0 ms 468 KB Output is correct
73 Correct 1798 ms 433616 KB Output is correct
74 Correct 1801 ms 430176 KB Output is correct
75 Correct 1809 ms 400088 KB Output is correct
76 Correct 1359 ms 409804 KB Output is correct
77 Correct 1050 ms 375400 KB Output is correct
78 Correct 2268 ms 421480 KB Output is correct
79 Correct 2717 ms 469660 KB Output is correct
80 Correct 4082 ms 682964 KB Output is correct
81 Correct 2391 ms 424356 KB Output is correct
82 Correct 3330 ms 563636 KB Output is correct
83 Correct 4352 ms 690680 KB Output is correct
84 Correct 1951 ms 373236 KB Output is correct
85 Correct 3421 ms 548752 KB Output is correct
86 Correct 3419 ms 536656 KB Output is correct
87 Correct 629 ms 259072 KB Output is correct
88 Correct 1047 ms 375212 KB Output is correct
89 Correct 1102 ms 375216 KB Output is correct
90 Correct 1036 ms 375368 KB Output is correct