oj.uz

Submission #145170

# Submission time Handle Problem Language Result Execution time Memory
145170 2019-08-19T04:05:01 Z jwvg0425 Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 141620 KB 
#include "rect.h"
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#include <stack>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

int up[2505][2505];
int down[2505][2505];
bool visited[2505][2505];
int dx[] = { -1, 0, 1, 0 };
int dy[] = { 0, -1, 0, 1 };

i64 sub6(vector<vector<int>> a)
{
	int n = a.size();
	int m = a[0].size();
	i64 ans = 0;

	for (int x = 1; x < n - 1; x++)
	{
		for (int y = 1; y < m - 1; y++)
		{
			if (visited[x][y] || a[x][y] == 1)
				continue;

			int lx = x, ly = y, rx = x, ry = y;
			int c = 0;

			queue<ii> q;
			q.emplace(x, y);
			visited[x][y] = true;
			while (!q.empty())
			{
				auto now = q.front();
				q.pop();
				lx = min(now.xx, lx);
				ly = min(now.yy, ly);
				rx = max(now.xx, rx);
				ry = max(now.yy, ry);
				c++;

				for (int i = 0; i < 4; i++)
				{
					int nx = now.xx + dx[i];
					int ny = now.yy + dy[i];

					if (nx == 0 || nx == n - 1 || ny == 0 || ny == m - 1 || visited[nx][ny] || a[nx][ny] == 1)
						continue;

					visited[nx][ny] = true;
					q.emplace(nx, ny);
				}
			}

			bool ok = true;
			if (c != (rx - lx + 1) * (ry - ly + 1))
				ok = false;

			for (int i = ly; i <= ry; i++)
				if (a[lx - 1][i] != 1 || a[rx + 1][i] != 1)
					ok = false;

			for (int i = lx; i <= rx; i++)
				if (a[i][ly - 1] != 1 || a[i][ry + 1] != 1)
					ok = false;

			if (ok)
				ans++;
		}
	}

	return ans;
}

i64 count_rectangles(vector<vector<int>> a)
{
	int n = a.size();
	int m = a[0].size();

	i64 ans = 0;
	int amax = 0;

	for (int x = 0; x < n; x++)
	{
		for (int y = 0; y < m; y++)
		{
			amax = max(amax, a[x][y]);
			int yu = y - 1;
			int yd = y + 1;

			while (yd < m && a[x][yd] < a[x][y])
				yd++;

			while (yu >= 0 && a[x][yu] < a[x][y])
				yu--;

			down[x][y] = yd - y - 1;
			up[x][y] = y - yu - 1;
		}
	}

	if (amax == 1)
		return sub6(a);

	for (int l = 0; l < n - 2; l++)
	{
		vector<int> dnow(m, 987654321);
		vector<int> unow(m, 987654321);
		vector<int> maxv(m, 0); // 좌우에서 y별 최댓값값

		for (int r = l + 2; r < n; r++)
		{
			vector<int> newup(m + 1, 0);
			vector<int> newdown(m + 1, 0);
			vector<int> delup(m + 1, 0);
			vector<int> deldown(m + 1, 0);
			vector<int> lrup(m + 1, 0);
			vector<int> lrdown(m + 1, 0);
			vector<bool> lr(m, 0); // l - r은 가능한지
			vector<int> depth(m + 1, 0);

			for (int y = 0; y < m; y++)
			{
				dnow[y] = min(dnow[y], down[r - 1][y]);
				unow[y] = min(unow[y], up[r - 1][y]);
				maxv[y] = max(maxv[y], a[r - 1][y]);
				lr[y] = maxv[y] < a[l][y] && maxv[y] < a[r][y];
			}

			int lru = 0, lrd = 0;

			vector<int> dval(m + 1, 0);
			vector<int> uval(m + 1, 0);

			for (int y = 0; y < m; y++)
			{
				uval[y] = min(unow[y], lru);

				if (lr[y])
					lru++;
				else
					lru = 0;
			}

			for (int y = m - 1; y >= 0; y--)
			{
				dval[y] = min(dnow[y], lrd);

				if (lr[y])
					lrd++;
				else
					lrd = 0;
			}

			for (int y = 0; y < m; y++)
			{
				if (uval[y] >= 1)
				{
					newup[y - uval[y]]++;
					delup[y - 1]++;
				}

				if (dval[y] >= 1)
				{
					newdown[y + 1]++;
					deldown[y + dval[y]]++;
				}
			}

			int d = 0;
			for (int y = 0; y < m; y++)
			{
				d += newup[y];
				d -= delup[y];

				depth[y] = d;
			}

			// (ypos, minvalue)
			stack<ii> s;

			for (int y = 1; y < m; y++)
			{
				for (int j = 0; j < newdown[y]; j++)
					s.emplace(y, 987654321);

				if (!s.empty())
				{
					s.top().yy = min(s.top().yy, depth[y]);
				}

				for (int j = 0; j < deldown[y]; j++)
				{
					ii top = s.top();
					int f = depth[top.xx - 1] + newup[top.xx];

					ans += f - top.yy;

					s.pop();
					if (!s.empty())
						s.top().yy = min(s.top().yy, top.yy);
				}
			}
		}
	}

	return ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 3 ms 632 KB Output is correct
11 Correct 3 ms 632 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 10 ms 1152 KB Output is correct
18 Correct 10 ms 1144 KB Output is correct
19 Correct 10 ms 1148 KB Output is correct
20 Correct 10 ms 1144 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1116 KB Output is correct
23 Correct 10 ms 1144 KB Output is correct
24 Correct 8 ms 1020 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 632 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 3 ms 632 KB Output is correct
11 Correct 3 ms 632 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 10 ms 1152 KB Output is correct
18 Correct 10 ms 1144 KB Output is correct
19 Correct 10 ms 1148 KB Output is correct
20 Correct 10 ms 1144 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1116 KB Output is correct
23 Correct 10 ms 1144 KB Output is correct
24 Correct 8 ms 1020 KB Output is correct
25 Correct 93 ms 2808 KB Output is correct
26 Correct 93 ms 2800 KB Output is correct
27 Correct 95 ms 2928 KB Output is correct
28 Correct 88 ms 2680 KB Output is correct
29 Correct 91 ms 2680 KB Output is correct
30 Correct 92 ms 2936 KB Output is correct
31 Correct 91 ms 2936 KB Output is correct
32 Correct 90 ms 2936 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 632 KB Output is correct
36 Correct 3 ms 632 KB Output is correct
37 Correct 2 ms 376 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 3 ms 632 KB Output is correct
11 Correct 3 ms 632 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 10 ms 1152 KB Output is correct
18 Correct 10 ms 1144 KB Output is correct
19 Correct 10 ms 1148 KB Output is correct
20 Correct 10 ms 1144 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1116 KB Output is correct
23 Correct 10 ms 1144 KB Output is correct
24 Correct 8 ms 1020 KB Output is correct
25 Correct 93 ms 2808 KB Output is correct
26 Correct 93 ms 2800 KB Output is correct
27 Correct 95 ms 2928 KB Output is correct
28 Correct 88 ms 2680 KB Output is correct
29 Correct 91 ms 2680 KB Output is correct
30 Correct 92 ms 2936 KB Output is correct
31 Correct 91 ms 2936 KB Output is correct
32 Correct 90 ms 2936 KB Output is correct
33 Correct 3337 ms 16892 KB Output is correct
34 Correct 3338 ms 17016 KB Output is correct
35 Correct 3349 ms 16888 KB Output is correct
36 Correct 3342 ms 16888 KB Output is correct
37 Correct 3366 ms 17016 KB Output is correct
38 Correct 3371 ms 17064 KB Output is correct
39 Correct 3368 ms 17320 KB Output is correct
40 Correct 2953 ms 16376 KB Output is correct
41 Correct 47 ms 18296 KB Output is correct
42 Correct 3173 ms 14712 KB Output is correct
43 Correct 3257 ms 15568 KB Output is correct
44 Correct 3263 ms 17016 KB Output is correct
45 Correct 1772 ms 11640 KB Output is correct
46 Correct 826 ms 7416 KB Output is correct
47 Correct 3213 ms 13948 KB Output is correct
48 Correct 3227 ms 13944 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 3 ms 632 KB Output is correct
52 Correct 3 ms 632 KB Output is correct
53 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 636 KB Output is correct
2 Correct 8 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 504 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 247 ms 61640 KB Output is correct
3 Correct 515 ms 128860 KB Output is correct
4 Correct 526 ms 141560 KB Output is correct
5 Correct 522 ms 141432 KB Output is correct
6 Correct 204 ms 70008 KB Output is correct
7 Correct 483 ms 136124 KB Output is correct
8 Correct 530 ms 141620 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 632 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 2 ms 376 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 3 ms 632 KB Output is correct
11 Correct 3 ms 632 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 10 ms 1152 KB Output is correct
18 Correct 10 ms 1144 KB Output is correct
19 Correct 10 ms 1148 KB Output is correct
20 Correct 10 ms 1144 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1116 KB Output is correct
23 Correct 10 ms 1144 KB Output is correct
24 Correct 8 ms 1020 KB Output is correct
25 Correct 93 ms 2808 KB Output is correct
26 Correct 93 ms 2800 KB Output is correct
27 Correct 95 ms 2928 KB Output is correct
28 Correct 88 ms 2680 KB Output is correct
29 Correct 91 ms 2680 KB Output is correct
30 Correct 92 ms 2936 KB Output is correct
31 Correct 91 ms 2936 KB Output is correct
32 Correct 90 ms 2936 KB Output is correct
33 Correct 3337 ms 16892 KB Output is correct
34 Correct 3338 ms 17016 KB Output is correct
35 Correct 3349 ms 16888 KB Output is correct
36 Correct 3342 ms 16888 KB Output is correct
37 Correct 3366 ms 17016 KB Output is correct
38 Correct 3371 ms 17064 KB Output is correct
39 Correct 3368 ms 17320 KB Output is correct
40 Correct 2953 ms 16376 KB Output is correct
41 Correct 47 ms 18296 KB Output is correct
42 Correct 3173 ms 14712 KB Output is correct
43 Correct 3257 ms 15568 KB Output is correct
44 Correct 3263 ms 17016 KB Output is correct
45 Correct 1772 ms 11640 KB Output is correct
46 Correct 826 ms 7416 KB Output is correct
47 Correct 3213 ms 13948 KB Output is correct
48 Correct 3227 ms 13944 KB Output is correct
49 Correct 11 ms 636 KB Output is correct
50 Correct 8 ms 632 KB Output is correct
51 Correct 3 ms 632 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 3 ms 632 KB Output is correct
54 Correct 3 ms 632 KB Output is correct
55 Correct 3 ms 632 KB Output is correct
56 Correct 3 ms 632 KB Output is correct
57 Correct 3 ms 632 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 2 ms 504 KB Output is correct
61 Correct 247 ms 61640 KB Output is correct
62 Correct 515 ms 128860 KB Output is correct
63 Correct 526 ms 141560 KB Output is correct
64 Correct 522 ms 141432 KB Output is correct
65 Correct 204 ms 70008 KB Output is correct
66 Correct 483 ms 136124 KB Output is correct
67 Correct 530 ms 141620 KB Output is correct
68 Execution timed out 5101 ms 98836 KB Time limit exceeded
69 Halted 0 ms 0 KB -