oj.uz

Submission #264545

# Submission time Handle Problem Language Result Execution time Memory
264545 2020-08-14T07:34:35 Z kdh9949 Rectangles (IOI19_rect) C++17
100 / 100
 4892 ms 531064 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

using vint = vector<int>;
using vll = vector<ll>;
using vld = vector<ld>;
using vpii = vector<pii>;
using vpil = vector<pil>;
using vpli = vector<pli>;
using vpll = vector<pll>;

#define x first
#define y second
#define all(v) v.begin(),v.end()

using S = pair<pii, int>;
using SS = pair<pii, pii>;

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

	vector<S> rp, cp;
	vector<vint> um(n, vint(m)), dm(n, vint(m)), lm(n, vint(m)), rm(n, vint(m));
	for(int i = 1; i < n - 1; i++) {
		stack<int> st;
		for(int j = 0; j < m; j++) {
			while(!st.empty() && a[i][st.top()] < a[i][j]) {
				st.pop();
				if(!st.empty()) rp.emplace_back(pii(st.top() + 1, j - 1), i);
			}
			while(!st.empty() && a[i][st.top()] == a[i][j]) st.pop();
			if(!st.empty()) lm[i][j] = st.top() + 1;
			st.push(j);
		}
		while(!st.empty()) st.pop();
		for(int j = m - 1; j >= 0; j--) {
			while(!st.empty() && a[i][st.top()] <= a[i][j]) st.pop();
			if(!st.empty()) rm[i][j] = st.top() - 1;
			st.push(j);
		}
	}
	for(int i = 1; i < m - 1; i++) {
		stack<int> st;
		for(int j = 0; j < n; j++) {
			while(!st.empty() && a[st.top()][i] < a[j][i]) {
				st.pop();
				if(!st.empty()) cp.emplace_back(pii(st.top() + 1, j - 1), i);
			}
			while(!st.empty() && a[st.top()][i] == a[j][i]) st.pop();
			if(!st.empty()) um[j][i] = st.top() + 1;
			st.push(j);
		}
		while(!st.empty()) st.pop();
		for(int j = n - 1; j >= 0; j--) {
			while(!st.empty() && a[st.top()][i] <= a[j][i]) st.pop();
			if(!st.empty()) dm[j][i] = st.top() - 1;
			st.push(j);
		}
	}
	
	sort(all(rp));
	sort(all(cp));
	vector<pii> rseg;
	vector<vint> rS(m, vint(m, -1)), rE(m, vint(m, -1));
	for(int i = 0, j; i < rp.size(); i = j) {
		for(j = i + 1;
			j < rp.size() && rp[i].x == rp[j].x && rp[j].y - rp[i].y == j - i;
			j++);
		pii cur = rp[i].x;
		if(rS[cur.x][cur.y] < 0) rS[cur.x][cur.y] = rseg.size();
		rE[cur.x][cur.y] = rseg.size();
		rseg.emplace_back(rp[i].y, rp[j - 1].y);
	}
	vector<pii> cseg;
	vector<vint> cS(n, vint(n, -1)), cE(n, vint(n, -1));
	for(int i = 0, j; i < cp.size(); i = j) {
		for(j = i + 1;
			j < cp.size() && cp[i].x == cp[j].x && cp[j].y - cp[i].y == j - i;
			j++);
		pii cur = cp[i].x;
		if(cS[cur.x][cur.y] < 0) cS[cur.x][cur.y] = cseg.size();
		cE[cur.x][cur.y] = cseg.size();
		cseg.emplace_back(cp[i].y, cp[j - 1].y);
	}

	vector<ll> ans;
	for(int i = 1; i < n - 1; i++) {
		for(int j = 1; j < m - 1; j++) {
			int A = um[i][j], B = dm[i][j], C = lm[i][j], D = rm[i][j];
			if(!A || !B || !C || !D) continue;
			if(rS[C][D] < 0 || cS[A][B] < 0) continue;

			int l = rS[C][D] - 1, r = rE[C][D];
			while(l < r) {
				int m = (l + r + 1) >> 1;
				if(rseg[m].x <= A) l = m;
				else r = m - 1;
			}
			if(!(rS[C][D] <= l && l <= rE[C][D] && B <= rseg[l].y)) continue;

			l = cS[A][B] - 1; r = cE[A][B];
			while(l < r) {
				int m = (l + r + 1) >> 1;
				if(cseg[m].x <= C) l = m;
				else r = m - 1;
			}
			if(!(cS[A][B] <= l && l <= cE[A][B] && D <= cseg[l].y)) continue;

			ans.push_back(A ^ (ll(B) << 12) ^ (ll(C) << 24) ^ (ll(D) << 36));
		}
	}

	sort(all(ans));
	return int(unique(all(ans)) - ans.begin());
}

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:73:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |  for(int i = 0, j; i < rp.size(); i = j) {
      |                    ~~^~~~~~~~~~~
rect.cpp:75:6: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |    j < rp.size() && rp[i].x == rp[j].x && rp[j].y - rp[i].y == j - i;
      |    ~~^~~~~~~~~~~
rect.cpp:84:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |  for(int i = 0, j; i < cp.size(); i = j) {
      |                    ~~^~~~~~~~~~~
rect.cpp:86:6: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |    j < cp.size() && cp[i].x == cp[j].x && cp[j].y - cp[i].y == j - i;
      |    ~~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 896 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 3 ms 896 KB Output is correct
20 Correct 2 ms 768 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 3 ms 896 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 896 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 3 ms 896 KB Output is correct
20 Correct 2 ms 768 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 3 ms 896 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 20 ms 3952 KB Output is correct
26 Correct 17 ms 3952 KB Output is correct
27 Correct 17 ms 3952 KB Output is correct
28 Correct 11 ms 2688 KB Output is correct
29 Correct 23 ms 3704 KB Output is correct
30 Correct 22 ms 3952 KB Output is correct
31 Correct 20 ms 3832 KB Output is correct
32 Correct 21 ms 3704 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 896 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 3 ms 896 KB Output is correct
20 Correct 2 ms 768 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 3 ms 896 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 20 ms 3952 KB Output is correct
26 Correct 17 ms 3952 KB Output is correct
27 Correct 17 ms 3952 KB Output is correct
28 Correct 11 ms 2688 KB Output is correct
29 Correct 23 ms 3704 KB Output is correct
30 Correct 22 ms 3952 KB Output is correct
31 Correct 20 ms 3832 KB Output is correct
32 Correct 21 ms 3704 KB Output is correct
33 Correct 113 ms 31964 KB Output is correct
34 Correct 123 ms 31932 KB Output is correct
35 Correct 110 ms 31968 KB Output is correct
36 Correct 100 ms 31964 KB Output is correct
37 Correct 231 ms 39752 KB Output is correct
38 Correct 252 ms 39800 KB Output is correct
39 Correct 248 ms 39760 KB Output is correct
40 Correct 210 ms 37452 KB Output is correct
41 Correct 105 ms 26088 KB Output is correct
42 Correct 144 ms 29528 KB Output is correct
43 Correct 291 ms 41960 KB Output is correct
44 Correct 289 ms 42060 KB Output is correct
45 Correct 141 ms 22492 KB Output is correct
46 Correct 141 ms 22416 KB Output is correct
47 Correct 280 ms 39500 KB Output is correct
48 Correct 279 ms 39628 KB Output is correct
49 Correct 1 ms 256 KB Output is correct
50 Correct 1 ms 256 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 49792 KB Output is correct
2 Correct 21 ms 36088 KB Output is correct
3 Correct 27 ms 49664 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 28 ms 49792 KB Output is correct
6 Correct 33 ms 49788 KB Output is correct
7 Correct 28 ms 49792 KB Output is correct
8 Correct 29 ms 49792 KB Output is correct
9 Correct 33 ms 49784 KB Output is correct
10 Correct 32 ms 49528 KB Output is correct
11 Correct 28 ms 49528 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 764 ms 159436 KB Output is correct
3 Correct 1696 ms 321336 KB Output is correct
4 Correct 1700 ms 323380 KB Output is correct
5 Correct 1729 ms 323204 KB Output is correct
6 Correct 241 ms 136056 KB Output is correct
7 Correct 466 ms 232828 KB Output is correct
8 Correct 504 ms 247800 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 896 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 3 ms 896 KB Output is correct
20 Correct 2 ms 768 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 3 ms 896 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 20 ms 3952 KB Output is correct
26 Correct 17 ms 3952 KB Output is correct
27 Correct 17 ms 3952 KB Output is correct
28 Correct 11 ms 2688 KB Output is correct
29 Correct 23 ms 3704 KB Output is correct
30 Correct 22 ms 3952 KB Output is correct
31 Correct 20 ms 3832 KB Output is correct
32 Correct 21 ms 3704 KB Output is correct
33 Correct 113 ms 31964 KB Output is correct
34 Correct 123 ms 31932 KB Output is correct
35 Correct 110 ms 31968 KB Output is correct
36 Correct 100 ms 31964 KB Output is correct
37 Correct 231 ms 39752 KB Output is correct
38 Correct 252 ms 39800 KB Output is correct
39 Correct 248 ms 39760 KB Output is correct
40 Correct 210 ms 37452 KB Output is correct
41 Correct 105 ms 26088 KB Output is correct
42 Correct 144 ms 29528 KB Output is correct
43 Correct 291 ms 41960 KB Output is correct
44 Correct 289 ms 42060 KB Output is correct
45 Correct 141 ms 22492 KB Output is correct
46 Correct 141 ms 22416 KB Output is correct
47 Correct 280 ms 39500 KB Output is correct
48 Correct 279 ms 39628 KB Output is correct
49 Correct 27 ms 49792 KB Output is correct
50 Correct 21 ms 36088 KB Output is correct
51 Correct 27 ms 49664 KB Output is correct
52 Correct 1 ms 256 KB Output is correct
53 Correct 28 ms 49792 KB Output is correct
54 Correct 33 ms 49788 KB Output is correct
55 Correct 28 ms 49792 KB Output is correct
56 Correct 29 ms 49792 KB Output is correct
57 Correct 33 ms 49784 KB Output is correct
58 Correct 32 ms 49528 KB Output is correct
59 Correct 28 ms 49528 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 764 ms 159436 KB Output is correct
62 Correct 1696 ms 321336 KB Output is correct
63 Correct 1700 ms 323380 KB Output is correct
64 Correct 1729 ms 323204 KB Output is correct
65 Correct 241 ms 136056 KB Output is correct
66 Correct 466 ms 232828 KB Output is correct
67 Correct 504 ms 247800 KB Output is correct
68 Correct 1766 ms 401544 KB Output is correct
69 Correct 1620 ms 401632 KB Output is correct
70 Correct 1674 ms 401316 KB Output is correct
71 Correct 1379 ms 401212 KB Output is correct
72 Correct 3591 ms 491492 KB Output is correct
73 Correct 2713 ms 323320 KB Output is correct
74 Correct 2836 ms 338312 KB Output is correct
75 Correct 4740 ms 528408 KB Output is correct
76 Correct 2827 ms 324632 KB Output is correct
77 Correct 3740 ms 413552 KB Output is correct
78 Correct 4773 ms 531064 KB Output is correct
79 Correct 2563 ms 305824 KB Output is correct
80 Correct 4557 ms 501252 KB Output is correct
81 Correct 4892 ms 487432 KB Output is correct
82 Correct 2012 ms 305912 KB Output is correct
83 Correct 3461 ms 491036 KB Output is correct
84 Correct 3523 ms 491164 KB Output is correct
85 Correct 3503 ms 491228 KB Output is correct
86 Correct 1 ms 256 KB Output is correct
87 Correct 1 ms 256 KB Output is correct
88 Correct 1 ms 384 KB Output is correct
89 Correct 1 ms 384 KB Output is correct
90 Correct 1 ms 384 KB Output is correct