oj.uz

Submission #147149

# Submission time Handle Problem Language Result Execution time Memory
147149 2019-08-28T05:56:44 Z Mamnoon_Siam Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 310276 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

namespace binary_grid {
	const int inf = 1e5;
	const int maxn = 2501;
	int dx[] = {+1, 0, -1, 0};
	int dy[] = {0, -1, 0, +1};
	 
	int n, m;
	int a[maxn][maxn];
	int vis[maxn][maxn];
	 
	int cnt = 0;
	int mnx, mxx, mny, mxy;
	void dfs(int x, int y) {
		cnt++;
	 
		vis[x][y] = 1;
	 
		mnx = min(mnx, x);
		mxx = max(mxx, x);
		mny = min(mny, y);
		mxy = max(mxy, y);
	 
		for(int i = 0; i < 4; i++) {
			int xx = dx[i] + x;
			int yy = dy[i] + y;
			if(1 <= xx and xx <= n and 1 <= yy and yy <= m and a[xx][yy] == 0 and !vis[xx][yy]) {
				dfs(xx, yy);
			}
		}
	}
	 
	int count_rectangles(vector<vector<int> > aa) {
		n = aa.size(), m = aa[0].size();
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < m; j++) {
				a[i + 1][j + 1] = aa[i][j];
			}
		}
		int ans = 0;
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= m; j++) {
				if(!vis[i][j] and a[i][j] == 0) {
					mnx = inf, mxx = -inf;
					mny = inf, mxy = -inf;
					cnt = 0;
					dfs(i, j);
					if((mxx - mnx + 1) * (mxy - mny + 1) == cnt and mnx != 1 and mxx != n and mny != 1 and mxy != m) {
						ans++;
					}
				}
			}
		} return ans;
	}
}

namespace slow_general {
	using ii = pair<int, int>;
	using ll = long long;
	const int N = 2500;
	const int inf = 1e9;

	int n, m;
	int g[N][N];
	bitset<N> ls[N][N];
	int mxx[N];

	int count_rectangles(vector<vector<int> > a) {
		n = a.size(), m = a[0].size();
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < m; j++) {
				g[i][j] = a[i][j];
			}
		}
		for(int i = 1; i < n - 1; i++) {
			for(int j = 1; j < m - 1; j++) {
				int mx = -inf;
				for(int k = j; k > 0; k--) {
					mx = max(mx, g[i][k]);
					if(mx < g[i][j + 1]) {
						if(mx < g[i][k - 1]) {
							ls[i][j][k] = 1;
						}
					} else {
						break;
					}
				}
			}
		}
		int ans = 0;
		for(int u = 1; u < n - 1; u++) {
			for(int i = 1; i < m - 1; i++) {
				mxx[i] = -inf;
			}
			for(int v = u; v < n - 1; v++) {
				bitset<N> can;
				for(int i = 1; i < m - 1; i++) {
					mxx[i] = max(mxx[i], g[v][i]);
					if(mxx[i] < g[u - 1][i] and mxx[i] < g[v + 1][i]) {
						can[i] = 1;
					}
				}
				int now = 0;
				while(can._Find_next(now) < m - 1) {
					int l = can._Find_next(now);
					int r = l;
					while(can[r + 1]) {
						r++;
					}
					bitset<N> range;
					for(int i = l; i <= r; i++) {
						range[i] = 1;
					}
					for(int j = l; j <= r; j++) {
						bitset<N> intersection = range;
						for(int i = u; i <= v; i++) {
							intersection &= ls[i][j];
							if(intersection.count() == 0) {
								break;
							}
						}
						ans += intersection.count();
					}
					now = r;
				}
			}
			move_u : ;
		}
		return ans;
	}
}

long long count_rectangles(vector<vector<int> > a) {
	int n = a.size(), m = a[0].size();
	int mx = -1e9, mn = 1e9;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			mx = max(mx, a[i][j]);
			mn = min(mn, a[i][j]);
		}
	}
	if(0 <= mn and mx <= 1) {
		return binary_grid::count_rectangles(a);
	} else {
		return slow_general::count_rectangles(a);
	}
}

Compilation message

rect.cpp: In function 'int slow_general::count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:107:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(can._Find_next(now) < m - 1) {
           ~~~~~~~~~~~~~~~~~~~~^~~~~~~
rect.cpp:130:4: warning: label 'move_u' defined but not used [-Wunused-label]
    move_u : ;
    ^~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 3 ms 892 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 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 504 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 2 ms 632 KB Output is correct
20 Correct 2 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 3 ms 376 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 3 ms 892 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 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 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 1272 KB Output is correct
18 Correct 8 ms 1144 KB Output is correct
19 Correct 8 ms 1272 KB Output is correct
20 Correct 6 ms 2936 KB Output is correct
21 Correct 8 ms 3064 KB Output is correct
22 Correct 8 ms 3068 KB Output is correct
23 Correct 9 ms 2936 KB Output is correct
24 Correct 5 ms 1912 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 632 KB Output is correct
28 Correct 2 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 3 ms 376 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 3 ms 892 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 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 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 1272 KB Output is correct
18 Correct 8 ms 1144 KB Output is correct
19 Correct 8 ms 1272 KB Output is correct
20 Correct 6 ms 2936 KB Output is correct
21 Correct 8 ms 3064 KB Output is correct
22 Correct 8 ms 3068 KB Output is correct
23 Correct 9 ms 2936 KB Output is correct
24 Correct 5 ms 1912 KB Output is correct
25 Correct 40 ms 2856 KB Output is correct
26 Correct 40 ms 2936 KB Output is correct
27 Correct 40 ms 2936 KB Output is correct
28 Correct 31 ms 14968 KB Output is correct
29 Correct 46 ms 14968 KB Output is correct
30 Correct 47 ms 14968 KB Output is correct
31 Correct 46 ms 14456 KB Output is correct
32 Correct 45 ms 14328 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 632 KB Output is correct
36 Correct 2 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 3 ms 376 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 3 ms 892 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 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 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 1272 KB Output is correct
18 Correct 8 ms 1144 KB Output is correct
19 Correct 8 ms 1272 KB Output is correct
20 Correct 6 ms 2936 KB Output is correct
21 Correct 8 ms 3064 KB Output is correct
22 Correct 8 ms 3068 KB Output is correct
23 Correct 9 ms 2936 KB Output is correct
24 Correct 5 ms 1912 KB Output is correct
25 Correct 40 ms 2856 KB Output is correct
26 Correct 40 ms 2936 KB Output is correct
27 Correct 40 ms 2936 KB Output is correct
28 Correct 31 ms 14968 KB Output is correct
29 Correct 46 ms 14968 KB Output is correct
30 Correct 47 ms 14968 KB Output is correct
31 Correct 46 ms 14456 KB Output is correct
32 Correct 45 ms 14328 KB Output is correct
33 Correct 580 ms 14788 KB Output is correct
34 Correct 603 ms 90744 KB Output is correct
35 Correct 632 ms 14832 KB Output is correct
36 Correct 634 ms 90872 KB Output is correct
37 Correct 701 ms 14972 KB Output is correct
38 Correct 701 ms 14712 KB Output is correct
39 Correct 703 ms 14968 KB Output is correct
40 Correct 636 ms 14072 KB Output is correct
41 Correct 35 ms 15608 KB Output is correct
42 Correct 526 ms 166060 KB Output is correct
43 Correct 739 ms 166648 KB Output is correct
44 Correct 752 ms 166416 KB Output is correct
45 Correct 386 ms 86392 KB Output is correct
46 Correct 300 ms 83192 KB Output is correct
47 Correct 724 ms 159480 KB Output is correct
48 Correct 723 ms 159352 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 632 KB Output is correct
52 Correct 2 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 4 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 4 ms 1272 KB Output is correct
6 Correct 4 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 1276 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 380 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 170 ms 58292 KB Output is correct
3 Correct 357 ms 134484 KB Output is correct
4 Correct 387 ms 135288 KB Output is correct
5 Correct 356 ms 135288 KB Output is correct
6 Correct 288 ms 123384 KB Output is correct
7 Correct 759 ms 273660 KB Output is correct
8 Correct 720 ms 310276 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 2 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 3 ms 376 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 3 ms 892 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 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 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 1272 KB Output is correct
18 Correct 8 ms 1144 KB Output is correct
19 Correct 8 ms 1272 KB Output is correct
20 Correct 6 ms 2936 KB Output is correct
21 Correct 8 ms 3064 KB Output is correct
22 Correct 8 ms 3068 KB Output is correct
23 Correct 9 ms 2936 KB Output is correct
24 Correct 5 ms 1912 KB Output is correct
25 Correct 40 ms 2856 KB Output is correct
26 Correct 40 ms 2936 KB Output is correct
27 Correct 40 ms 2936 KB Output is correct
28 Correct 31 ms 14968 KB Output is correct
29 Correct 46 ms 14968 KB Output is correct
30 Correct 47 ms 14968 KB Output is correct
31 Correct 46 ms 14456 KB Output is correct
32 Correct 45 ms 14328 KB Output is correct
33 Correct 580 ms 14788 KB Output is correct
34 Correct 603 ms 90744 KB Output is correct
35 Correct 632 ms 14832 KB Output is correct
36 Correct 634 ms 90872 KB Output is correct
37 Correct 701 ms 14972 KB Output is correct
38 Correct 701 ms 14712 KB Output is correct
39 Correct 703 ms 14968 KB Output is correct
40 Correct 636 ms 14072 KB Output is correct
41 Correct 35 ms 15608 KB Output is correct
42 Correct 526 ms 166060 KB Output is correct
43 Correct 739 ms 166648 KB Output is correct
44 Correct 752 ms 166416 KB Output is correct
45 Correct 386 ms 86392 KB Output is correct
46 Correct 300 ms 83192 KB Output is correct
47 Correct 724 ms 159480 KB Output is correct
48 Correct 723 ms 159352 KB Output is correct
49 Correct 4 ms 504 KB Output is correct
50 Correct 3 ms 504 KB Output is correct
51 Correct 3 ms 760 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 4 ms 1272 KB Output is correct
54 Correct 4 ms 1272 KB Output is correct
55 Correct 3 ms 1272 KB Output is correct
56 Correct 3 ms 1276 KB Output is correct
57 Correct 3 ms 1272 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 380 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 170 ms 58292 KB Output is correct
62 Correct 357 ms 134484 KB Output is correct
63 Correct 387 ms 135288 KB Output is correct
64 Correct 356 ms 135288 KB Output is correct
65 Correct 288 ms 123384 KB Output is correct
66 Correct 759 ms 273660 KB Output is correct
67 Correct 720 ms 310276 KB Output is correct
68 Execution timed out 5108 ms 158644 KB Time limit exceeded
69 Halted 0 ms 0 KB -