oj.uz

Submission #810301

# Submission time Handle Problem Language Result Execution time Memory
810301 2023-08-06T08:12:52 Z Sohsoh84 Rectangles (IOI19_rect) C++17
100 / 100
 4894 ms 819428 KB 
#include "rect.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pll;

#define X		first
#define Y		second
#define all(x)		(x).begin(), (x).end()
#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl;

const int MAXN = 2500 + 10;



struct HASH{
	size_t operator()(const pair<int,int>&x)const{
		return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
	}
};

int n, m, A[MAXN][MAXN], L[MAXN], R[MAXN];
unordered_map<pll, int, HASH> mp_r[2], mp_c[MAXN];
vector<int> F[MAXN][MAXN];
vector<pair<pll, pll>> ans_vec;

inline bool valid(int l1, int l2, int r1, int r2) {	
	if (l2 - l1 <= 1 || r2 - r1 <= 1) return false;
	return true;
}

inline void add(int l1, int l2, int r1, int r2) {
	ans_vec.push_back({{l1, l2}, {r1, r2}});
}

inline int get(unordered_map<pll, int, HASH>& mp, pll f) {
	auto it = mp.find(f);
	if (it == mp.end()) return 0;
	return it -> Y;
}

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

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			A[i][j] = vec_[i - 1][j - 1];


	vec_.clear();
	vec_.shrink_to_fit();

	for (int j = 1; j <= m; j++) {
		for (int i = 1; i <= n; i++)
			for (L[i] = i - 1; L[i] > 0 && A[L[i]][j] < A[i][j]; L[i] = L[L[i]]);

		for (int i = n; i > 0; i--)
			for (R[i] = i + 1; R[i] <= n && A[R[i]][j] < A[i][j]; R[i] = R[R[i]]);

		for (int i = 1; i <= n; i++) {
			if (L[i] && i - L[i] > 1) {
				mp_c[j][pll(L[i], i)] = get(mp_c[j - 1], pll(L[i], i)) + 1;
				F[i][j].push_back(L[i]);
			}

			if (R[i] <= n && R[i] - i > 1) {
				mp_c[j][pll(i, R[i])] = get(mp_c[j - 1], pll(i, R[i])) + 1;
				F[R[i]][j].push_back(i);
			}
			

			F[i][j].shrink_to_fit();
		}
	}

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			sort(all(F[i][j]));
			F[i][j].resize(unique(all(F[i][j])) - F[i][j].begin());
		}
	}

	for (int i = 1; i <= n; i++) {
		int ind = i & 1;
		mp_r[ind].clear();

		for (int j = 1; j <= m; j++)
			for (L[j] = j - 1; L[j] > 0 && A[i][L[j]] < A[i][j]; L[j] = L[L[j]]);

		for (int j = m; j > 0; j--)
			for (R[j] = j + 1; R[j] <= m && A[i][R[j]] < A[i][j]; R[j] = R[R[j]]);


		for (int j = 1; j <= m; j++) {
			if (L[j] && j - L[j] > 1) mp_r[ind][pll(L[j], j)] = mp_r[ind ^ 1][pll(L[j], j)] + 1;
			if (R[j] <= m && R[j] - j > 1) mp_r[ind][pll(j, R[j])] = mp_r[ind ^ 1][pll(j, R[j])] + 1;
		}

		if (i == n) continue;
		for (int j = 1; j <= m; j++) {
			if (L[j]) {
				for (int f : F[i + 1][j - 1]) {	
					if (!valid(f, i + 1, L[j], j)) continue;
					if (mp_r[ind][pll(L[j], j)] >= i - f && mp_c[j - 1][pll(f, i + 1)] >= j - L[j] - 1)
						add(f, i + 1, L[j], j);
				} 
			}

			if (R[j] <= m) {
				for (int f : F[i + 1][j + 1]) {		
					if (!valid(f, i + 1, j, R[j])) continue;
					if (mp_r[ind][pll(j, R[j])] >= i - f && mp_c[R[j] - 1][pll(f, i + 1)] >= R[j] - j - 1)
						add(f, i + 1, j, R[j]);
				}
			}
		}
	}

	sort(all(ans_vec));
	ans_vec.resize(unique(all(ans_vec)) - ans_vec.begin());
	return ans_vec.size();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 148300 KB Output is correct
2 Correct 68 ms 148548 KB Output is correct
3 Correct 68 ms 148556 KB Output is correct
4 Correct 67 ms 148524 KB Output is correct
5 Correct 66 ms 148420 KB Output is correct
6 Correct 66 ms 148460 KB Output is correct
7 Correct 66 ms 148440 KB Output is correct
8 Correct 65 ms 148344 KB Output is correct
9 Correct 65 ms 148460 KB Output is correct
10 Correct 67 ms 148476 KB Output is correct
11 Correct 65 ms 148520 KB Output is correct
12 Correct 66 ms 148556 KB Output is correct
13 Correct 65 ms 148304 KB Output is correct
14 Correct 68 ms 148376 KB Output is correct
15 Correct 65 ms 148384 KB Output is correct
16 Correct 66 ms 148292 KB Output is correct
17 Correct 66 ms 148276 KB Output is correct
18 Correct 65 ms 148272 KB Output is correct
19 Correct 65 ms 148532 KB Output is correct
20 Correct 68 ms 148424 KB Output is correct
21 Correct 69 ms 148316 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 148300 KB Output is correct
2 Correct 68 ms 148548 KB Output is correct
3 Correct 68 ms 148556 KB Output is correct
4 Correct 67 ms 148524 KB Output is correct
5 Correct 66 ms 148420 KB Output is correct
6 Correct 66 ms 148460 KB Output is correct
7 Correct 66 ms 148440 KB Output is correct
8 Correct 65 ms 148344 KB Output is correct
9 Correct 65 ms 148460 KB Output is correct
10 Correct 67 ms 148476 KB Output is correct
11 Correct 65 ms 148520 KB Output is correct
12 Correct 66 ms 148556 KB Output is correct
13 Correct 65 ms 148304 KB Output is correct
14 Correct 68 ms 148376 KB Output is correct
15 Correct 65 ms 148384 KB Output is correct
16 Correct 66 ms 148292 KB Output is correct
17 Correct 66 ms 148276 KB Output is correct
18 Correct 65 ms 148272 KB Output is correct
19 Correct 65 ms 148532 KB Output is correct
20 Correct 68 ms 148424 KB Output is correct
21 Correct 69 ms 148316 KB Output is correct
22 Correct 69 ms 149276 KB Output is correct
23 Correct 68 ms 149344 KB Output is correct
24 Correct 67 ms 149320 KB Output is correct
25 Correct 66 ms 148916 KB Output is correct
26 Correct 69 ms 149228 KB Output is correct
27 Correct 69 ms 149232 KB Output is correct
28 Correct 69 ms 149324 KB Output is correct
29 Correct 67 ms 148856 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 148300 KB Output is correct
2 Correct 68 ms 148548 KB Output is correct
3 Correct 68 ms 148556 KB Output is correct
4 Correct 67 ms 148524 KB Output is correct
5 Correct 66 ms 148420 KB Output is correct
6 Correct 66 ms 148460 KB Output is correct
7 Correct 66 ms 148440 KB Output is correct
8 Correct 65 ms 148344 KB Output is correct
9 Correct 65 ms 148460 KB Output is correct
10 Correct 67 ms 148476 KB Output is correct
11 Correct 65 ms 148520 KB Output is correct
12 Correct 66 ms 148556 KB Output is correct
13 Correct 65 ms 148304 KB Output is correct
14 Correct 68 ms 148376 KB Output is correct
15 Correct 65 ms 148384 KB Output is correct
16 Correct 66 ms 148292 KB Output is correct
17 Correct 69 ms 149276 KB Output is correct
18 Correct 68 ms 149344 KB Output is correct
19 Correct 67 ms 149320 KB Output is correct
20 Correct 66 ms 148916 KB Output is correct
21 Correct 69 ms 149228 KB Output is correct
22 Correct 69 ms 149232 KB Output is correct
23 Correct 69 ms 149324 KB Output is correct
24 Correct 67 ms 148856 KB Output is correct
25 Correct 66 ms 148276 KB Output is correct
26 Correct 65 ms 148272 KB Output is correct
27 Correct 65 ms 148532 KB Output is correct
28 Correct 68 ms 148424 KB Output is correct
29 Correct 69 ms 148316 KB Output is correct
30 Correct 80 ms 153016 KB Output is correct
31 Correct 79 ms 153072 KB Output is correct
32 Correct 82 ms 153056 KB Output is correct
33 Correct 79 ms 151028 KB Output is correct
34 Correct 84 ms 152696 KB Output is correct
35 Correct 84 ms 152736 KB Output is correct
36 Correct 84 ms 152572 KB Output is correct
37 Correct 85 ms 152504 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 148300 KB Output is correct
2 Correct 68 ms 148548 KB Output is correct
3 Correct 68 ms 148556 KB Output is correct
4 Correct 67 ms 148524 KB Output is correct
5 Correct 66 ms 148420 KB Output is correct
6 Correct 66 ms 148460 KB Output is correct
7 Correct 66 ms 148440 KB Output is correct
8 Correct 65 ms 148344 KB Output is correct
9 Correct 65 ms 148460 KB Output is correct
10 Correct 67 ms 148476 KB Output is correct
11 Correct 65 ms 148520 KB Output is correct
12 Correct 66 ms 148556 KB Output is correct
13 Correct 65 ms 148304 KB Output is correct
14 Correct 68 ms 148376 KB Output is correct
15 Correct 65 ms 148384 KB Output is correct
16 Correct 66 ms 148292 KB Output is correct
17 Correct 69 ms 149276 KB Output is correct
18 Correct 68 ms 149344 KB Output is correct
19 Correct 67 ms 149320 KB Output is correct
20 Correct 66 ms 148916 KB Output is correct
21 Correct 69 ms 149228 KB Output is correct
22 Correct 69 ms 149232 KB Output is correct
23 Correct 69 ms 149324 KB Output is correct
24 Correct 67 ms 148856 KB Output is correct
25 Correct 80 ms 153016 KB Output is correct
26 Correct 79 ms 153072 KB Output is correct
27 Correct 82 ms 153056 KB Output is correct
28 Correct 79 ms 151028 KB Output is correct
29 Correct 84 ms 152696 KB Output is correct
30 Correct 84 ms 152736 KB Output is correct
31 Correct 84 ms 152572 KB Output is correct
32 Correct 85 ms 152504 KB Output is correct
33 Correct 66 ms 148276 KB Output is correct
34 Correct 65 ms 148272 KB Output is correct
35 Correct 65 ms 148532 KB Output is correct
36 Correct 68 ms 148424 KB Output is correct
37 Correct 69 ms 148316 KB Output is correct
38 Correct 141 ms 170508 KB Output is correct
39 Correct 137 ms 170516 KB Output is correct
40 Correct 169 ms 177220 KB Output is correct
41 Correct 168 ms 177236 KB Output is correct
42 Correct 234 ms 194440 KB Output is correct
43 Correct 240 ms 194292 KB Output is correct
44 Correct 225 ms 194304 KB Output is correct
45 Correct 224 ms 192328 KB Output is correct
46 Correct 162 ms 167464 KB Output is correct
47 Correct 215 ms 174956 KB Output is correct
48 Correct 350 ms 196516 KB Output is correct
49 Correct 343 ms 196788 KB Output is correct
50 Correct 197 ms 173912 KB Output is correct
51 Correct 197 ms 172396 KB Output is correct
52 Correct 327 ms 194480 KB Output is correct
53 Correct 360 ms 194624 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 149320 KB Output is correct
2 Correct 69 ms 149092 KB Output is correct
3 Correct 66 ms 148412 KB Output is correct
4 Correct 67 ms 148296 KB Output is correct
5 Correct 69 ms 148968 KB Output is correct
6 Correct 71 ms 149016 KB Output is correct
7 Correct 69 ms 149024 KB Output is correct
8 Correct 73 ms 149032 KB Output is correct
9 Correct 69 ms 148916 KB Output is correct
10 Correct 66 ms 148764 KB Output is correct
11 Correct 69 ms 148828 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 148276 KB Output is correct
2 Correct 65 ms 148272 KB Output is correct
3 Correct 65 ms 148532 KB Output is correct
4 Correct 68 ms 148424 KB Output is correct
5 Correct 69 ms 148316 KB Output is correct
6 Correct 74 ms 148428 KB Output is correct
7 Correct 727 ms 244456 KB Output is correct
8 Correct 1542 ms 355616 KB Output is correct
9 Correct 1558 ms 356608 KB Output is correct
10 Correct 1699 ms 356560 KB Output is correct
11 Correct 202 ms 184628 KB Output is correct
12 Correct 374 ms 218992 KB Output is correct
13 Correct 386 ms 222016 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 148300 KB Output is correct
2 Correct 68 ms 148548 KB Output is correct
3 Correct 68 ms 148556 KB Output is correct
4 Correct 67 ms 148524 KB Output is correct
5 Correct 66 ms 148420 KB Output is correct
6 Correct 66 ms 148460 KB Output is correct
7 Correct 66 ms 148440 KB Output is correct
8 Correct 65 ms 148344 KB Output is correct
9 Correct 65 ms 148460 KB Output is correct
10 Correct 67 ms 148476 KB Output is correct
11 Correct 65 ms 148520 KB Output is correct
12 Correct 66 ms 148556 KB Output is correct
13 Correct 65 ms 148304 KB Output is correct
14 Correct 68 ms 148376 KB Output is correct
15 Correct 65 ms 148384 KB Output is correct
16 Correct 66 ms 148292 KB Output is correct
17 Correct 69 ms 149276 KB Output is correct
18 Correct 68 ms 149344 KB Output is correct
19 Correct 67 ms 149320 KB Output is correct
20 Correct 66 ms 148916 KB Output is correct
21 Correct 69 ms 149228 KB Output is correct
22 Correct 69 ms 149232 KB Output is correct
23 Correct 69 ms 149324 KB Output is correct
24 Correct 67 ms 148856 KB Output is correct
25 Correct 80 ms 153016 KB Output is correct
26 Correct 79 ms 153072 KB Output is correct
27 Correct 82 ms 153056 KB Output is correct
28 Correct 79 ms 151028 KB Output is correct
29 Correct 84 ms 152696 KB Output is correct
30 Correct 84 ms 152736 KB Output is correct
31 Correct 84 ms 152572 KB Output is correct
32 Correct 85 ms 152504 KB Output is correct
33 Correct 141 ms 170508 KB Output is correct
34 Correct 137 ms 170516 KB Output is correct
35 Correct 169 ms 177220 KB Output is correct
36 Correct 168 ms 177236 KB Output is correct
37 Correct 234 ms 194440 KB Output is correct
38 Correct 240 ms 194292 KB Output is correct
39 Correct 225 ms 194304 KB Output is correct
40 Correct 224 ms 192328 KB Output is correct
41 Correct 162 ms 167464 KB Output is correct
42 Correct 215 ms 174956 KB Output is correct
43 Correct 350 ms 196516 KB Output is correct
44 Correct 343 ms 196788 KB Output is correct
45 Correct 197 ms 173912 KB Output is correct
46 Correct 197 ms 172396 KB Output is correct
47 Correct 327 ms 194480 KB Output is correct
48 Correct 360 ms 194624 KB Output is correct
49 Correct 68 ms 149320 KB Output is correct
50 Correct 69 ms 149092 KB Output is correct
51 Correct 66 ms 148412 KB Output is correct
52 Correct 67 ms 148296 KB Output is correct
53 Correct 69 ms 148968 KB Output is correct
54 Correct 71 ms 149016 KB Output is correct
55 Correct 69 ms 149024 KB Output is correct
56 Correct 73 ms 149032 KB Output is correct
57 Correct 69 ms 148916 KB Output is correct
58 Correct 66 ms 148764 KB Output is correct
59 Correct 69 ms 148828 KB Output is correct
60 Correct 74 ms 148428 KB Output is correct
61 Correct 727 ms 244456 KB Output is correct
62 Correct 1542 ms 355616 KB Output is correct
63 Correct 1558 ms 356608 KB Output is correct
64 Correct 1699 ms 356560 KB Output is correct
65 Correct 202 ms 184628 KB Output is correct
66 Correct 374 ms 218992 KB Output is correct
67 Correct 386 ms 222016 KB Output is correct
68 Correct 66 ms 148276 KB Output is correct
69 Correct 65 ms 148272 KB Output is correct
70 Correct 65 ms 148532 KB Output is correct
71 Correct 68 ms 148424 KB Output is correct
72 Correct 69 ms 148316 KB Output is correct
73 Correct 1057 ms 392080 KB Output is correct
74 Correct 1047 ms 392016 KB Output is correct
75 Correct 1534 ms 477472 KB Output is correct
76 Correct 1601 ms 477572 KB Output is correct
77 Correct 2580 ms 746620 KB Output is correct
78 Correct 2783 ms 497404 KB Output is correct
79 Correct 2654 ms 539744 KB Output is correct
80 Correct 4781 ms 767240 KB Output is correct
81 Correct 2812 ms 528580 KB Output is correct
82 Correct 3445 ms 665016 KB Output is correct
83 Correct 4894 ms 819428 KB Output is correct
84 Correct 2409 ms 506336 KB Output is correct
85 Correct 4591 ms 792072 KB Output is correct
86 Correct 4559 ms 745876 KB Output is correct
87 Correct 1532 ms 532724 KB Output is correct
88 Correct 2574 ms 794104 KB Output is correct
89 Correct 2562 ms 794408 KB Output is correct
90 Correct 2579 ms 794568 KB Output is correct