oj.uz

답안 #726560

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
726560 2023-04-19T04:54:56 Z LittleCube Rectangles (IOI19_rect) C++14
100 / 100
 4391 ms 702012 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;

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 count_rectangles(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;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:93:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   93 |   for (auto [x, y] : ver[i])
      |             ^
rect.cpp:132:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  132 |   for (auto [x, y] : hor[i])
      |             ^
rect.cpp:150:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  150 |   for (auto [_, t, l, r] : event[i])
      |             ^
rect.cpp:158:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  158 |   for (auto [_, t, l, r] : event[i])
      |             ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 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 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 0 ms 724 KB Output is correct
21 Correct 0 ms 468 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 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 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 0 ms 724 KB Output is correct
21 Correct 0 ms 468 KB Output is correct
22 Correct 2 ms 1620 KB Output is correct
23 Correct 2 ms 1620 KB Output is correct
24 Correct 2 ms 1620 KB Output is correct
25 Correct 2 ms 1492 KB Output is correct
26 Correct 4 ms 1876 KB Output is correct
27 Correct 4 ms 1876 KB Output is correct
28 Correct 3 ms 1748 KB Output is correct
29 Correct 2 ms 1364 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 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 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 1620 KB Output is correct
18 Correct 2 ms 1620 KB Output is correct
19 Correct 2 ms 1620 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Correct 4 ms 1876 KB Output is correct
22 Correct 4 ms 1876 KB Output is correct
23 Correct 3 ms 1748 KB Output is correct
24 Correct 2 ms 1364 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 0 ms 724 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 7 ms 4436 KB Output is correct
31 Correct 6 ms 4468 KB Output is correct
32 Correct 7 ms 4436 KB Output is correct
33 Correct 10 ms 4984 KB Output is correct
34 Correct 22 ms 6820 KB Output is correct
35 Correct 23 ms 7156 KB Output is correct
36 Correct 18 ms 6380 KB Output is correct
37 Correct 19 ms 6244 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 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 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 1620 KB Output is correct
18 Correct 2 ms 1620 KB Output is correct
19 Correct 2 ms 1620 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Correct 4 ms 1876 KB Output is correct
22 Correct 4 ms 1876 KB Output is correct
23 Correct 3 ms 1748 KB Output is correct
24 Correct 2 ms 1364 KB Output is correct
25 Correct 7 ms 4436 KB Output is correct
26 Correct 6 ms 4468 KB Output is correct
27 Correct 7 ms 4436 KB Output is correct
28 Correct 10 ms 4984 KB Output is correct
29 Correct 22 ms 6820 KB Output is correct
30 Correct 23 ms 7156 KB Output is correct
31 Correct 18 ms 6380 KB Output is correct
32 Correct 19 ms 6244 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 1 ms 724 KB Output is correct
36 Correct 0 ms 724 KB Output is correct
37 Correct 0 ms 468 KB Output is correct
38 Correct 117 ms 41408 KB Output is correct
39 Correct 124 ms 43096 KB Output is correct
40 Correct 126 ms 39832 KB Output is correct
41 Correct 106 ms 40332 KB Output is correct
42 Correct 79 ms 38068 KB Output is correct
43 Correct 77 ms 37960 KB Output is correct
44 Correct 81 ms 38012 KB Output is correct
45 Correct 76 ms 36776 KB Output is correct
46 Correct 81 ms 29900 KB Output is correct
47 Correct 117 ms 33920 KB Output is correct
48 Correct 285 ms 62624 KB Output is correct
49 Correct 277 ms 62872 KB Output is correct
50 Correct 145 ms 37836 KB Output is correct
51 Correct 130 ms 35172 KB Output is correct
52 Correct 221 ms 53172 KB Output is correct
53 Correct 231 ms 52800 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 49664 KB Output is correct
2 Correct 24 ms 42284 KB Output is correct
3 Correct 27 ms 49364 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 28 ms 49628 KB Output is correct
6 Correct 28 ms 49528 KB Output is correct
7 Correct 28 ms 49528 KB Output is correct
8 Correct 28 ms 49624 KB Output is correct
9 Correct 28 ms 49564 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 0 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 524 ms 160216 KB Output is correct
8 Correct 1193 ms 288664 KB Output is correct
9 Correct 1204 ms 288632 KB Output is correct
10 Correct 1201 ms 289100 KB Output is correct
11 Correct 89 ms 84508 KB Output is correct
12 Correct 164 ms 119904 KB Output is correct
13 Correct 173 ms 122948 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 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 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 1620 KB Output is correct
18 Correct 2 ms 1620 KB Output is correct
19 Correct 2 ms 1620 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Correct 4 ms 1876 KB Output is correct
22 Correct 4 ms 1876 KB Output is correct
23 Correct 3 ms 1748 KB Output is correct
24 Correct 2 ms 1364 KB Output is correct
25 Correct 7 ms 4436 KB Output is correct
26 Correct 6 ms 4468 KB Output is correct
27 Correct 7 ms 4436 KB Output is correct
28 Correct 10 ms 4984 KB Output is correct
29 Correct 22 ms 6820 KB Output is correct
30 Correct 23 ms 7156 KB Output is correct
31 Correct 18 ms 6380 KB Output is correct
32 Correct 19 ms 6244 KB Output is correct
33 Correct 117 ms 41408 KB Output is correct
34 Correct 124 ms 43096 KB Output is correct
35 Correct 126 ms 39832 KB Output is correct
36 Correct 106 ms 40332 KB Output is correct
37 Correct 79 ms 38068 KB Output is correct
38 Correct 77 ms 37960 KB Output is correct
39 Correct 81 ms 38012 KB Output is correct
40 Correct 76 ms 36776 KB Output is correct
41 Correct 81 ms 29900 KB Output is correct
42 Correct 117 ms 33920 KB Output is correct
43 Correct 285 ms 62624 KB Output is correct
44 Correct 277 ms 62872 KB Output is correct
45 Correct 145 ms 37836 KB Output is correct
46 Correct 130 ms 35172 KB Output is correct
47 Correct 221 ms 53172 KB Output is correct
48 Correct 231 ms 52800 KB Output is correct
49 Correct 30 ms 49664 KB Output is correct
50 Correct 24 ms 42284 KB Output is correct
51 Correct 27 ms 49364 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 28 ms 49628 KB Output is correct
54 Correct 28 ms 49528 KB Output is correct
55 Correct 28 ms 49528 KB Output is correct
56 Correct 28 ms 49624 KB Output is correct
57 Correct 28 ms 49564 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 524 ms 160216 KB Output is correct
62 Correct 1193 ms 288664 KB Output is correct
63 Correct 1204 ms 288632 KB Output is correct
64 Correct 1201 ms 289100 KB Output is correct
65 Correct 89 ms 84508 KB Output is correct
66 Correct 164 ms 119904 KB Output is correct
67 Correct 173 ms 122948 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 0 ms 468 KB Output is correct
70 Correct 1 ms 724 KB Output is correct
71 Correct 0 ms 724 KB Output is correct
72 Correct 0 ms 468 KB Output is correct
73 Correct 1719 ms 433644 KB Output is correct
74 Correct 1798 ms 430276 KB Output is correct
75 Correct 1777 ms 400036 KB Output is correct
76 Correct 1330 ms 409968 KB Output is correct
77 Correct 1008 ms 375364 KB Output is correct
78 Correct 2348 ms 421580 KB Output is correct
79 Correct 2662 ms 469612 KB Output is correct
80 Correct 3987 ms 683056 KB Output is correct
81 Correct 2373 ms 430872 KB Output is correct
82 Correct 3326 ms 572724 KB Output is correct
83 Correct 4391 ms 702012 KB Output is correct
84 Correct 1890 ms 382676 KB Output is correct
85 Correct 3445 ms 560176 KB Output is correct
86 Correct 3191 ms 547956 KB Output is correct
87 Correct 619 ms 265300 KB Output is correct
88 Correct 1048 ms 386504 KB Output is correct
89 Correct 1016 ms 386208 KB Output is correct
90 Correct 1035 ms 386212 KB Output is correct