oj.uz

Submission #146224

# Submission time Handle Problem Language Result Execution time Memory
146224 2019-08-22T21:14:48 Z Sorting Rectangles (IOI19_rect) C++14
100 / 100
 4963 ms 470028 KB 
#include "rect.h"
#include <bits/stdc++.h>

using namespace  std;

const int MAXN = 2507;
const int inf = 1e9;

inline int fast_min(int lvalue, int rvalue){
	return ((lvalue < rvalue) ? lvalue : rvalue);
}

inline int fast_max(int lvalue, int rvalue){
	return ((lvalue > rvalue) ? lvalue : rvalue);
}

struct b_str{
	int l, r, u, d;

	b_str(){}
};


b_str b[MAXN][MAXN];

struct segment_tree{
	int mn[2 * MAXN];
	char type;
	int val;
	int sz;

	segment_tree(){}

	void init(char type, int val, int sz){
		this->type = type;
		this->val = val;
		this->sz = sz;
		
		for(int i = 0; i < sz; ++i){
			int idx = i + sz;

			switch(type){
			case 'l':
				mn[idx] = b[i][val].l;
				break;
			case 'r':
				mn[idx] = b[i][val].r;
				break;
			case 'u':
				mn[idx] = b[val][i].u;
				break;
			case 'd':
				mn[idx] = b[val][i].d;
				break;
			}
		}
		for(int i = sz - 1; i > 0; --i){
			mn[i] = fast_min(mn[i << 1], mn[(i << 1) | 1]);
		}
	}

	int query(int l, int r){
		++r;

		int resl = inf, resr = inf;

		for(l += sz, r += sz; l < r; l >>= 1, r >>= 1){
            if(l & 1){
            	resl = fast_min(resl, mn[l++]);
            }
            if(r & 1){
            	resr = fast_min(mn[--r], resr);
            }
        }

        return fast_min(resl, resr);
	}
};

struct rect{
	int x1, y1, x2, y2;

	rect(){}

	friend bool operator<(rect lvalue, rect rvalue){
		if(lvalue.x1 != rvalue.x1){
			return lvalue.x1 < rvalue.x1;
		}
		if(lvalue.x2 != rvalue.x2){
			return lvalue.x2 < rvalue.x2;
		}
		if(lvalue.y1 != rvalue.y1){
			return lvalue.y1 < rvalue.y1;
		}

		return lvalue.y2 < rvalue.y2;
	}
};

rect v[MAXN * MAXN];
segment_tree st_l[MAXN], st_r[MAXN], st_u[MAXN], st_d[MAXN];
int a[MAXN][MAXN], n, m;

bool check(int x1, int y1, int x2, int y2){
	//cout << x1 << " " << y1 << " " << x2 << " " << y2 << endl;

	int lvalue = st_l[y2 + 1].query(x1, x2);
	int rvalue = st_r[y1 - 1].query(x1, x2);
	int uvalue = st_u[x2 + 1].query(y1, y2);
	int dvalue = st_d[x1 - 1].query(y1, y2);

	if(fast_min(lvalue, rvalue) < y2 - y1 + 2){
		return false;
	}
	if(fast_min(uvalue, dvalue) < x2 - x1 + 2){
		return false;
	}

	return true;
}

stack<int> st;

long long 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){
			a[i][j] = _a[i][j];
		}
	}

	for(int i = 0; i < n; ++i){
		st.push(0);
		for(int j = 1; j < m; ++j){
			while(!st.empty() && a[i][j] >= a[i][st.top()]){
				b[i][st.top()].r = j - st.top();
				st.pop();
			}
			st.push(j);
		}
		while(!st.empty()){
			b[i][st.top()].r = m - st.top();
			st.pop();
		}
	}

	for(int i = 0; i < n; ++i){
		st.push(m - 1);
		for(int j = m - 2 ; j >= 0; --j){
			while(!st.empty() && a[i][j] >= a[i][st.top()]){
				b[i][st.top()].l = st.top() - j;
				st.pop();
			}
			st.push(j);
		}
		while(!st.empty()){
			b[i][st.top()].l = st.top() + 1;
			st.pop();
		}
	}

	for(int i = 0; i < m; ++i){
		st.push(0);
		for(int j = 1; j < n; ++j){
			while(!st.empty() && a[j][i] >= a[st.top()][i]){
				b[st.top()][i].d = j - st.top();
				st.pop();
			}
			st.push(j);
		}
		while(!st.empty()){
			b[st.top()][i].d = n - st.top();
			st.pop();
		}
	}

	for(int i = 0; i < m; ++i){
		st.push(n - 1);
		for(int j = n - 2; j >= 0; --j){
			while(!st.empty() && a[j][i] >= a[st.top()][i]){
				b[st.top()][i].u = st.top() - j;
				st.pop();
			}
			st.push(j);
		}
		while(!st.empty()){
			b[st.top()][i].u = st.top() + 1;
			st.pop();
		}
	}

	for(int i = 0; i < n; ++i){
		st_u[i].init('u', i, m);
		st_d[i].init('d', i, m);
	}
	for(int i = 0; i < m; ++i){
		st_l[i].init('l', i, n);
		st_r[i].init('r', i, n);
	}

	for(int i = 0; i < n; ++i){
		st.push(0);
		for(int j = 1; j < m; ++j){
			while(!st.empty() && a[i][j] > a[i][st.top()]){
				b[i][st.top()].r = j - st.top();
				st.pop();
			}
			st.push(j);
		}
		while(!st.empty()){
			b[i][st.top()].r = m - st.top();
			st.pop();
		}
	}

	for(int i = 0; i < n; ++i){
		st.push(m - 1);
		for(int j = m - 2 ; j >= 0; --j){
			while(!st.empty() && a[i][j] > a[i][st.top()]){
				b[i][st.top()].l = st.top() - j;
				st.pop();
			}
			st.push(j);
		}
		while(!st.empty()){
			b[i][st.top()].l = st.top() + 1;
			st.pop();
		}
	}

	for(int i = 0; i < m; ++i){
		st.push(0);
		for(int j = 1; j < n; ++j){
			while(!st.empty() && a[j][i] > a[st.top()][i]){
				b[st.top()][i].d = j - st.top();
				st.pop();
			}
			st.push(j);
		}
		while(!st.empty()){
			b[st.top()][i].d = n - st.top();
			st.pop();
		}
	}

	for(int i = 0; i < m; ++i){
		st.push(n - 1);
		for(int j = n - 2; j >= 0; --j){
			while(!st.empty() && a[j][i] > a[st.top()][i]){
				b[st.top()][i].u = st.top() - j;
				st.pop();
			}
			st.push(j);
		}
		while(!st.empty()){
			b[st.top()][i].u = st.top() + 1;
			st.pop();
		}
	}

	long long ans = 0;
	int cnt = 0;

	for(int i = 1; i < n - 1; ++i){
		for(int j = 1; j < m - 1; ++j){
			rect r;

			r.x1 = fast_min(n - 2, fast_max(1, i - b[i][j].u + 1));
			r.x2 = fast_min(n - 2, fast_max(1, i + b[i][j].d - 1));
			r.y1 = fast_min(m - 2, fast_max(1, j - b[i][j].l + 1));
			r.y2 = fast_min(m - 2, fast_max(1, j + b[i][j].r - 1));

			//cout << i << " " << j << " - " << r.x1 << " " << r.y1 << " " << r.x2 << " " << r.y2 << endl;

			v[cnt++] = r;
		}
	}

	sort(v, v + cnt);

	for(int i = 0; i < cnt; ++i){
		if(i != 0 && v[i - 1].x1 == v[i].x1 && v[i - 1].y1 == v[i].y1 && v[i - 1].x2 == v[i].x2 && v[i - 1].y2 == v[i].y2){
			continue;
		}
		ans += check(v[i].x1, v[i].y1, v[i].x2, v[i].y2);
	}

	return ans;
}
/*
6 5
4 8 7 5 6
7 4 10 3 5
9 7 20 14 2
9 14 7 3 6
5 7 5 2 7
4 5 13 5 6
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 3 ms 1144 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1148 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 632 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 1144 KB Output is correct
20 Correct 3 ms 1016 KB Output is correct
21 Correct 2 ms 504 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 3 ms 1144 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1148 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 2808 KB Output is correct
18 Correct 5 ms 2808 KB Output is correct
19 Correct 5 ms 2748 KB Output is correct
20 Correct 6 ms 2808 KB Output is correct
21 Correct 6 ms 2808 KB Output is correct
22 Correct 6 ms 2872 KB Output is correct
23 Correct 6 ms 2808 KB Output is correct
24 Correct 4 ms 2296 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 1144 KB Output is correct
28 Correct 3 ms 1016 KB Output is correct
29 Correct 2 ms 504 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 3 ms 1144 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1148 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 2808 KB Output is correct
18 Correct 5 ms 2808 KB Output is correct
19 Correct 5 ms 2748 KB Output is correct
20 Correct 6 ms 2808 KB Output is correct
21 Correct 6 ms 2808 KB Output is correct
22 Correct 6 ms 2872 KB Output is correct
23 Correct 6 ms 2808 KB Output is correct
24 Correct 4 ms 2296 KB Output is correct
25 Correct 20 ms 8212 KB Output is correct
26 Correct 21 ms 8184 KB Output is correct
27 Correct 19 ms 8184 KB Output is correct
28 Correct 20 ms 8184 KB Output is correct
29 Correct 23 ms 8184 KB Output is correct
30 Correct 24 ms 8312 KB Output is correct
31 Correct 23 ms 8184 KB Output is correct
32 Correct 23 ms 8152 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 1144 KB Output is correct
36 Correct 3 ms 1016 KB Output is correct
37 Correct 2 ms 504 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 3 ms 1144 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1148 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 2808 KB Output is correct
18 Correct 5 ms 2808 KB Output is correct
19 Correct 5 ms 2748 KB Output is correct
20 Correct 6 ms 2808 KB Output is correct
21 Correct 6 ms 2808 KB Output is correct
22 Correct 6 ms 2872 KB Output is correct
23 Correct 6 ms 2808 KB Output is correct
24 Correct 4 ms 2296 KB Output is correct
25 Correct 20 ms 8212 KB Output is correct
26 Correct 21 ms 8184 KB Output is correct
27 Correct 19 ms 8184 KB Output is correct
28 Correct 20 ms 8184 KB Output is correct
29 Correct 23 ms 8184 KB Output is correct
30 Correct 24 ms 8312 KB Output is correct
31 Correct 23 ms 8184 KB Output is correct
32 Correct 23 ms 8152 KB Output is correct
33 Correct 313 ms 53788 KB Output is correct
34 Correct 331 ms 53752 KB Output is correct
35 Correct 306 ms 53772 KB Output is correct
36 Correct 303 ms 53752 KB Output is correct
37 Correct 290 ms 53784 KB Output is correct
38 Correct 264 ms 53724 KB Output is correct
39 Correct 252 ms 53752 KB Output is correct
40 Correct 228 ms 50688 KB Output is correct
41 Correct 211 ms 53720 KB Output is correct
42 Correct 241 ms 53648 KB Output is correct
43 Correct 295 ms 53728 KB Output is correct
44 Correct 298 ms 53812 KB Output is correct
45 Correct 153 ms 32860 KB Output is correct
46 Correct 133 ms 29940 KB Output is correct
47 Correct 277 ms 53876 KB Output is correct
48 Correct 287 ms 53880 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 1144 KB Output is correct
52 Correct 3 ms 1016 KB Output is correct
53 Correct 2 ms 504 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 21112 KB Output is correct
2 Correct 17 ms 18040 KB Output is correct
3 Correct 18 ms 21112 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 19 ms 21112 KB Output is correct
6 Correct 20 ms 21112 KB Output is correct
7 Correct 20 ms 21112 KB Output is correct
8 Correct 19 ms 21112 KB Output is correct
9 Correct 19 ms 21112 KB Output is correct
10 Correct 18 ms 20728 KB Output is correct
11 Correct 21 ms 20856 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 1516 ms 240224 KB Output is correct
3 Correct 3353 ms 464424 KB Output is correct
4 Correct 3401 ms 466348 KB Output is correct
5 Correct 3443 ms 466236 KB Output is correct
6 Correct 1175 ms 250360 KB Output is correct
7 Correct 2539 ms 451076 KB Output is correct
8 Correct 2747 ms 466236 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 1144 KB Output is correct
12 Correct 3 ms 1016 KB Output is correct
13 Correct 2 ms 504 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 3 ms 1144 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1148 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 2808 KB Output is correct
18 Correct 5 ms 2808 KB Output is correct
19 Correct 5 ms 2748 KB Output is correct
20 Correct 6 ms 2808 KB Output is correct
21 Correct 6 ms 2808 KB Output is correct
22 Correct 6 ms 2872 KB Output is correct
23 Correct 6 ms 2808 KB Output is correct
24 Correct 4 ms 2296 KB Output is correct
25 Correct 20 ms 8212 KB Output is correct
26 Correct 21 ms 8184 KB Output is correct
27 Correct 19 ms 8184 KB Output is correct
28 Correct 20 ms 8184 KB Output is correct
29 Correct 23 ms 8184 KB Output is correct
30 Correct 24 ms 8312 KB Output is correct
31 Correct 23 ms 8184 KB Output is correct
32 Correct 23 ms 8152 KB Output is correct
33 Correct 313 ms 53788 KB Output is correct
34 Correct 331 ms 53752 KB Output is correct
35 Correct 306 ms 53772 KB Output is correct
36 Correct 303 ms 53752 KB Output is correct
37 Correct 290 ms 53784 KB Output is correct
38 Correct 264 ms 53724 KB Output is correct
39 Correct 252 ms 53752 KB Output is correct
40 Correct 228 ms 50688 KB Output is correct
41 Correct 211 ms 53720 KB Output is correct
42 Correct 241 ms 53648 KB Output is correct
43 Correct 295 ms 53728 KB Output is correct
44 Correct 298 ms 53812 KB Output is correct
45 Correct 153 ms 32860 KB Output is correct
46 Correct 133 ms 29940 KB Output is correct
47 Correct 277 ms 53876 KB Output is correct
48 Correct 287 ms 53880 KB Output is correct
49 Correct 19 ms 21112 KB Output is correct
50 Correct 17 ms 18040 KB Output is correct
51 Correct 18 ms 21112 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 19 ms 21112 KB Output is correct
54 Correct 20 ms 21112 KB Output is correct
55 Correct 20 ms 21112 KB Output is correct
56 Correct 19 ms 21112 KB Output is correct
57 Correct 19 ms 21112 KB Output is correct
58 Correct 18 ms 20728 KB Output is correct
59 Correct 21 ms 20856 KB Output is correct
60 Correct 2 ms 632 KB Output is correct
61 Correct 1516 ms 240224 KB Output is correct
62 Correct 3353 ms 464424 KB Output is correct
63 Correct 3401 ms 466348 KB Output is correct
64 Correct 3443 ms 466236 KB Output is correct
65 Correct 1175 ms 250360 KB Output is correct
66 Correct 2539 ms 451076 KB Output is correct
67 Correct 2747 ms 466236 KB Output is correct
68 Correct 4963 ms 466268 KB Output is correct
69 Correct 4839 ms 466296 KB Output is correct
70 Correct 4895 ms 466324 KB Output is correct
71 Correct 4870 ms 469936 KB Output is correct
72 Correct 4307 ms 469852 KB Output is correct
73 Correct 2492 ms 303428 KB Output is correct
74 Correct 2675 ms 335064 KB Output is correct
75 Correct 4274 ms 468036 KB Output is correct
76 Correct 2610 ms 301916 KB Output is correct
77 Correct 3483 ms 410492 KB Output is correct
78 Correct 4366 ms 469940 KB Output is correct
79 Correct 2335 ms 301432 KB Output is correct
80 Correct 4048 ms 469916 KB Output is correct
81 Correct 4016 ms 459680 KB Output is correct
82 Correct 2574 ms 321712 KB Output is correct
83 Correct 4204 ms 469724 KB Output is correct
84 Correct 4251 ms 469916 KB Output is correct
85 Correct 4222 ms 470028 KB Output is correct
86 Correct 2 ms 376 KB Output is correct
87 Correct 2 ms 376 KB Output is correct
88 Correct 3 ms 1144 KB Output is correct
89 Correct 3 ms 1016 KB Output is correct
90 Correct 2 ms 504 KB Output is correct