oj.uz

답안 #753720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
753720 2023-06-05T18:24:12 Z nicksms Rectangles (IOI19_rect) C++17
100 / 100
 2312 ms 783520 KB 
#include "rect.h"
/**
 *      Author:  Nicholas Winschel
 *      Created: 05.15.2023 13:01:55
**/

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<short,short>;
#define f first
#define s second
#define sz(x) (int)((x).size())



template<class T, size_t SZ> struct RMQ { // floor(log_2(x))
	static constexpr int level(int x) { return 31-__builtin_clz(x); }
	array<array<T,SZ>, level(SZ)+1> jmp;
	T cmb(T a, T b) { return min(a, b); }
	void init(const V<T>& v) { assert(sz(v) <= SZ);
		copy(v.begin(),v.end(), begin(jmp[0]));
		for (int j = 1; 1<<j <= sz(v); ++j) {
			for (int i=0; i < sz(v)-(1<<j)+1; i++) jmp[j][i] = cmb(jmp[j-1][i],
				jmp[j-1][i+(1<<(j-1))]);
		}
	}
	T query(int l, int r) {
		assert(l <= r); int d = level(r-l+1);
		return cmb(jmp[d][l],jmp[d][r-(1<<d)+1]); }
};

const size_t MAXN = 2505;
V<short> L[MAXN],R[MAXN],U[MAXN],D[MAXN];
RMQ<short,MAXN> rL[MAXN],rR[MAXN],rU[MAXN],rD[MAXN];
int n,m;

bool chk(int r, int c, int w, int h) {
	if (w == 0 || h == 0 || r+h >= n || c+w >= m) return false;
	// cout << "q " << rR[c-1].query(r,r+h-1) << " " << rL[c+w].query(r,r+h-1)
	// 	<< " " << rU[r+h].query(c,c+w-1) << " " << rD[r-1].query(c,c+w-1) << "\n";
	return rR[c-1].query(r,r+h-1) >= w
		&& rL[c+w].query(r,r+h-1) >= w
		&& rU[r+h].query(c,c+w-1) >= h
		&& rD[r-1].query(c,c+w-1) >= h;
}

long long count_rectangles(std::vector<std::vector<int> > a) {
	// cout << "hi" << endl;
	n = sz(a); m = sz(a[0]);
	for (int i = 0; i < m; i++) {
		L[i]=R[i]=V<short>(n);
	}
	for (int i = 0; i < n; i++) {
		U[i]=D[i]=V<short>(m);
	}
	for (int r = 0; r < n; r++) {
		stack<int> stk;
		for (int c = 0; c < m; c++) {
			while (sz(stk) && a[r][stk.top()] <= a[r][c]) R[stk.top()][r] = c-stk.top()-1, stk.pop();
			stk.push(c);
		}
		while (sz(stk)) R[stk.top()][r]=m-1-stk.top(),stk.pop();
		for (int c = m-1; c >= 0; c--) {
			while (sz(stk) && a[r][stk.top()] <= a[r][c]) L[stk.top()][r] = stk.top()-c-1, stk.pop();
			stk.push(c);
		}
		while (sz(stk)) L[stk.top()][r]=stk.top(), stk.pop();
	}
	for (int c = 0; c < m; c++) {
		stack<int> stk;
		for (int r = 0; r < n; r++) {
			while (sz(stk) && a[stk.top()][c] <= a[r][c]) D[stk.top()][c] = r-stk.top()-1, stk.pop();
			stk.push(r);
		}
		while (sz(stk)) D[stk.top()][c]=n-1-stk.top(),stk.pop();
		for (int r = n-1; r >= 0; r--) {
			while (sz(stk) && a[stk.top()][c] <= a[r][c]) U[stk.top()][c] = stk.top()-r-1, stk.pop();
			stk.push(r);
		}
		while (sz(stk)) U[stk.top()][c]=stk.top(),stk.pop();
	}
	// for (int r = 0; r < n; r++) {
	// 	for (int c = 0; c < m; c++) {
	// 		cout << r << " " << c << ": " << D[r][c] << " " << U[r][c] << "\n";
	// 	}
	// }
	for (int i = 0; i < m; i++) {
		rL[i].init(L[i]);
		rR[i].init(R[i]);
	}
	for (int i = 0; i < n; i++) {
		rU[i].init(U[i]);
		rD[i].init(D[i]);
	}

	V<pair<pi,pi>> pos;
	pos.reserve(MAXN*MAXN*6);
	auto pu = [&](pi &&a, pi &&b) {
		if (!chk(a.f,a.s,b.f,b.s)) return;
		pos.emplace_back(a,b);
	};
	for (int r = 1; r < n-1; r++) {
		for (int c = 1; c < m-1; c++) {
			pu(pi{r,c},pi{R[c-1][r], D[r-1][c]});
			if (L[c+1][r] && c-L[c+1][r]+1 > 0) pu(pi{r,c-L[c+1][r]+1},pi{L[c+1][r], D[r-1][c]});
			if (U[r+1][c] && r-U[r+1][c]+1 > 0) pu(pi{r-U[r+1][c]+1,c},pi{R[c-1][r], U[r+1][c]});
			if (L[c+1][r] && c-L[c+1][r]+1 > 0 && U[r+1][c] && r-U[r+1][c]+1 > 0)
				pu(pi{r-U[r+1][c]+1,c-L[c+1][r]+1},pi{L[c+1][r], U[r+1][c]});
			if (L[c+1][r] && c-L[c+1][r]+1 > 0) pu(pi{r,c-L[c+1][r]+1},pi{L[c+1][r], D[r-1][c-L[c+1][r]+1]});
			if (U[r+1][c] && r-U[r+1][c]+1 > 0) pu(pi{r-U[r+1][c]+1,c},pi{R[c-1][r-U[r+1][c]+1], U[r+1][c]});
			
		}
	}
	sort(pos.begin(),pos.end());
	return unique(pos.begin(),pos.end())-pos.begin();
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from rect.cpp:7:
rect.cpp: In instantiation of 'void RMQ<T, SZ>::init(V<T>&) [with T = short int; long unsigned int SZ = 2505; V<T> = std::vector<short int, std::allocator<short int> >]':
rect.cpp:93:18:   required from here
rect.cpp:25:42: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
   25 |  void init(const V<T>& v) { assert(sz(v) <= SZ);
      |                                          ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 2972 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 1 ms 2004 KB Output is correct
8 Correct 1 ms 2004 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 2 ms 2968 KB Output is correct
12 Correct 2 ms 3028 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 1176 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 544 KB Output is correct
18 Correct 1 ms 536 KB Output is correct
19 Correct 2 ms 3028 KB Output is correct
20 Correct 1 ms 2080 KB Output is correct
21 Correct 1 ms 724 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 2972 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 1 ms 2004 KB Output is correct
8 Correct 1 ms 2004 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 2 ms 2968 KB Output is correct
12 Correct 2 ms 3028 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 1176 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 544 KB Output is correct
18 Correct 1 ms 536 KB Output is correct
19 Correct 2 ms 3028 KB Output is correct
20 Correct 1 ms 2080 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 5 ms 9940 KB Output is correct
23 Correct 7 ms 9940 KB Output is correct
24 Correct 6 ms 9952 KB Output is correct
25 Correct 5 ms 9940 KB Output is correct
26 Correct 6 ms 9812 KB Output is correct
27 Correct 6 ms 9940 KB Output is correct
28 Correct 6 ms 9940 KB Output is correct
29 Correct 5 ms 6816 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 2972 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 1 ms 2004 KB Output is correct
8 Correct 1 ms 2004 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 2 ms 2968 KB Output is correct
12 Correct 2 ms 3028 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 1176 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 5 ms 9940 KB Output is correct
18 Correct 7 ms 9940 KB Output is correct
19 Correct 6 ms 9952 KB Output is correct
20 Correct 5 ms 9940 KB Output is correct
21 Correct 6 ms 9812 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct
23 Correct 6 ms 9940 KB Output is correct
24 Correct 5 ms 6816 KB Output is correct
25 Correct 1 ms 544 KB Output is correct
26 Correct 1 ms 536 KB Output is correct
27 Correct 2 ms 3028 KB Output is correct
28 Correct 1 ms 2080 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 20 ms 29436 KB Output is correct
31 Correct 20 ms 29472 KB Output is correct
32 Correct 21 ms 29548 KB Output is correct
33 Correct 18 ms 29128 KB Output is correct
34 Correct 21 ms 29220 KB Output is correct
35 Correct 22 ms 29388 KB Output is correct
36 Correct 23 ms 29320 KB Output is correct
37 Correct 22 ms 29104 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 2972 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 1 ms 2004 KB Output is correct
8 Correct 1 ms 2004 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 2 ms 2968 KB Output is correct
12 Correct 2 ms 3028 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 1176 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 5 ms 9940 KB Output is correct
18 Correct 7 ms 9940 KB Output is correct
19 Correct 6 ms 9952 KB Output is correct
20 Correct 5 ms 9940 KB Output is correct
21 Correct 6 ms 9812 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct
23 Correct 6 ms 9940 KB Output is correct
24 Correct 5 ms 6816 KB Output is correct
25 Correct 20 ms 29436 KB Output is correct
26 Correct 20 ms 29472 KB Output is correct
27 Correct 21 ms 29548 KB Output is correct
28 Correct 18 ms 29128 KB Output is correct
29 Correct 21 ms 29220 KB Output is correct
30 Correct 22 ms 29388 KB Output is correct
31 Correct 23 ms 29320 KB Output is correct
32 Correct 22 ms 29104 KB Output is correct
33 Correct 1 ms 544 KB Output is correct
34 Correct 1 ms 536 KB Output is correct
35 Correct 2 ms 3028 KB Output is correct
36 Correct 1 ms 2080 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 94 ms 147224 KB Output is correct
39 Correct 110 ms 147088 KB Output is correct
40 Correct 104 ms 147208 KB Output is correct
41 Correct 112 ms 147088 KB Output is correct
42 Correct 162 ms 151116 KB Output is correct
43 Correct 168 ms 151168 KB Output is correct
44 Correct 204 ms 151328 KB Output is correct
45 Correct 164 ms 145812 KB Output is correct
46 Correct 118 ms 145896 KB Output is correct
47 Correct 140 ms 146312 KB Output is correct
48 Correct 169 ms 147728 KB Output is correct
49 Correct 179 ms 149656 KB Output is correct
50 Correct 94 ms 98956 KB Output is correct
51 Correct 94 ms 98972 KB Output is correct
52 Correct 165 ms 148712 KB Output is correct
53 Correct 187 ms 149720 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 41804 KB Output is correct
2 Correct 16 ms 35560 KB Output is correct
3 Correct 17 ms 41684 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 18 ms 41684 KB Output is correct
6 Correct 17 ms 41768 KB Output is correct
7 Correct 17 ms 41748 KB Output is correct
8 Correct 17 ms 41684 KB Output is correct
9 Correct 17 ms 41688 KB Output is correct
10 Correct 8 ms 21440 KB Output is correct
11 Correct 20 ms 41564 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 544 KB Output is correct
2 Correct 1 ms 536 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 1 ms 2080 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 654 ms 449076 KB Output is correct
8 Correct 1402 ms 708564 KB Output is correct
9 Correct 1346 ms 710684 KB Output is correct
10 Correct 1403 ms 710872 KB Output is correct
11 Correct 453 ms 467404 KB Output is correct
12 Correct 884 ms 672356 KB Output is correct
13 Correct 923 ms 698936 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 2972 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 1 ms 2004 KB Output is correct
8 Correct 1 ms 2004 KB Output is correct
9 Correct 2 ms 3028 KB Output is correct
10 Correct 2 ms 3028 KB Output is correct
11 Correct 2 ms 2968 KB Output is correct
12 Correct 2 ms 3028 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 1176 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 5 ms 9940 KB Output is correct
18 Correct 7 ms 9940 KB Output is correct
19 Correct 6 ms 9952 KB Output is correct
20 Correct 5 ms 9940 KB Output is correct
21 Correct 6 ms 9812 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct
23 Correct 6 ms 9940 KB Output is correct
24 Correct 5 ms 6816 KB Output is correct
25 Correct 20 ms 29436 KB Output is correct
26 Correct 20 ms 29472 KB Output is correct
27 Correct 21 ms 29548 KB Output is correct
28 Correct 18 ms 29128 KB Output is correct
29 Correct 21 ms 29220 KB Output is correct
30 Correct 22 ms 29388 KB Output is correct
31 Correct 23 ms 29320 KB Output is correct
32 Correct 22 ms 29104 KB Output is correct
33 Correct 94 ms 147224 KB Output is correct
34 Correct 110 ms 147088 KB Output is correct
35 Correct 104 ms 147208 KB Output is correct
36 Correct 112 ms 147088 KB Output is correct
37 Correct 162 ms 151116 KB Output is correct
38 Correct 168 ms 151168 KB Output is correct
39 Correct 204 ms 151328 KB Output is correct
40 Correct 164 ms 145812 KB Output is correct
41 Correct 118 ms 145896 KB Output is correct
42 Correct 140 ms 146312 KB Output is correct
43 Correct 169 ms 147728 KB Output is correct
44 Correct 179 ms 149656 KB Output is correct
45 Correct 94 ms 98956 KB Output is correct
46 Correct 94 ms 98972 KB Output is correct
47 Correct 165 ms 148712 KB Output is correct
48 Correct 187 ms 149720 KB Output is correct
49 Correct 20 ms 41804 KB Output is correct
50 Correct 16 ms 35560 KB Output is correct
51 Correct 17 ms 41684 KB Output is correct
52 Correct 1 ms 592 KB Output is correct
53 Correct 18 ms 41684 KB Output is correct
54 Correct 17 ms 41768 KB Output is correct
55 Correct 17 ms 41748 KB Output is correct
56 Correct 17 ms 41684 KB Output is correct
57 Correct 17 ms 41688 KB Output is correct
58 Correct 8 ms 21440 KB Output is correct
59 Correct 20 ms 41564 KB Output is correct
60 Correct 1 ms 1108 KB Output is correct
61 Correct 654 ms 449076 KB Output is correct
62 Correct 1402 ms 708564 KB Output is correct
63 Correct 1346 ms 710684 KB Output is correct
64 Correct 1403 ms 710872 KB Output is correct
65 Correct 453 ms 467404 KB Output is correct
66 Correct 884 ms 672356 KB Output is correct
67 Correct 923 ms 698936 KB Output is correct
68 Correct 1 ms 544 KB Output is correct
69 Correct 1 ms 536 KB Output is correct
70 Correct 2 ms 3028 KB Output is correct
71 Correct 1 ms 2080 KB Output is correct
72 Correct 1 ms 724 KB Output is correct
73 Correct 1085 ms 733432 KB Output is correct
74 Correct 1231 ms 733540 KB Output is correct
75 Correct 1245 ms 733532 KB Output is correct
76 Correct 1225 ms 733508 KB Output is correct
77 Correct 2126 ms 783520 KB Output is correct
78 Correct 1202 ms 534464 KB Output is correct
79 Correct 1287 ms 556712 KB Output is correct
80 Correct 2015 ms 734552 KB Output is correct
81 Correct 1352 ms 549624 KB Output is correct
82 Correct 1718 ms 647600 KB Output is correct
83 Correct 2149 ms 759828 KB Output is correct
84 Correct 1304 ms 542140 KB Output is correct
85 Correct 2171 ms 759788 KB Output is correct
86 Correct 2144 ms 746424 KB Output is correct
87 Correct 1252 ms 563832 KB Output is correct
88 Correct 2312 ms 783104 KB Output is correct
89 Correct 2114 ms 783376 KB Output is correct
90 Correct 2136 ms 783436 KB Output is correct