oj.uz

답안 #145416

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145416 2019-08-19T19:54:28 Z jacynkaa Rectangles (IOI19_rect) C++14
100 / 100
 2378 ms 371212 KB 
// ... ... .. ....!
// ... ....... .... ...!

#include<bits/stdc++.h>
using namespace std;

#define rep(i, n) for(int i = 0, i##__n = (int)(n); i < i##__n; ++i)
#define fer(i, a, b) for(int i = (int)(a), i##__b = (int)(b); i < i##__b; ++i)
#define rof(i, b, a) for(int i = (int)(b), i##__a = (int)(a); i-- > i##__a; )
#define sz(x) (int((x).size()))
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define X first
#define Y second
//#define endl '\n'

template<class P, class Q> inline void smin(P &a, Q b) { if (b < a) a = b; }
template<class P, class Q> inline void smax(P &a, Q b) { if (a < b) a = b; }

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

////////////////////////////////////////////////////////////////////////////////

const int maxn = 3000 + 10;


int n, m;
vector<vector<int>> H;

short L[maxn][maxn], R[maxn][maxn], U[maxn][maxn], D[maxn][maxn];
short UL[maxn][maxn], DL[maxn][maxn], LU[maxn][maxn], RU[maxn][maxn];

vector<ll> v;

void precalc() {
	short st[maxn];
	
	rep(i, n) {
		int t = 0;
		rep(j, m) {
			while(t && H[i][j] > H[i][st[t-1]]) t--;
			L[i][j] = (t ? st[t-1] : -1);
			st[t++] = j;
		}
	}
	rep(i, n) {
		int t = 0;
		rof(j, m, 0) {
			while(t && H[i][j] > H[i][st[t-1]]) t--;
			R[i][j] = (t ? st[t-1] : -1);
			st[t++] = j;
		}
	}
	rep(j, m) {
		int t = 0;
		rep(i, n) {
			while(t && H[i][j] > H[st[t-1]][j]) t--;
			U[i][j] = (t ? st[t-1] : -1);
			st[t++] = i;
		}
	}
	rep(j, m) {
		int t = 0;
		rof(i, n, 0) {
			while(t && H[i][j] > H[st[t-1]][j]) t--;
			D[i][j] = (t ? st[t-1] : -1);
			st[t++] = i;
		}
	}

	rep(j, m) rep(i, n) {
		if(U[i][j] != -1) {
			if(j > 0 && U[i][j] == U[i][j-1]) UL[i][j] = UL[i][j-1];
			else if(j > 0 && i == D[U[i][j]][j-1]) UL[i][j] = DL[U[i][j]][j-1];
			else UL[i][j] = j;
		}
		if(D[i][j] != -1) {
			if(j > 0 && D[i][j] == D[i][j-1]) DL[i][j] = DL[i][j-1];
			else if(j > 0 && i == U[D[i][j]][j-1]) DL[i][j] = UL[D[i][j]][j-1];
			else DL[i][j] = j;
		}
	}

	rep(i, n) rep(j, m) {
		if(L[i][j] != -1) {
			if(i > 0 && L[i][j] == L[i-1][j]) LU[i][j] = LU[i-1][j];
			else if(i > 0 && j == R[i-1][L[i][j]]) LU[i][j] = RU[i-1][L[i][j]];
			else LU[i][j] = i;
		}
		if(R[i][j] != -1) {
			if(i > 0 && R[i][j] == R[i-1][j]) RU[i][j] = RU[i-1][j];
			else if(i > 0 && j == L[i-1][R[i][j]]) RU[i][j] = LU[i-1][R[i][j]];
			else RU[i][j] = i;
		}
	}
}

void check(int i1, int i2, int j1, int j2) {
	if(i2 < i1 || j2 < j1) return;
	if(!((R[i2][j1-1]-1 == j2 && RU[i2][j1-1] <= i1) || (L[i2][j2+1]+1 == j1 && LU[i2][j2+1] <= i1))) return;
	if(!((D[i1-1][j2]-1 == i2 && DL[i1-1][j2] <= j1) || (U[i2+1][j2]+1 == i1 && UL[i2+1][j2] <= j1))) return;
	v.pb((((ll)i1 * maxn + i2) * maxn + j1) * maxn + j2);
}

int count_rectangles(vector<vector<int>> _H) {
	H = _H;
	n = sz(H);
	m = sz(H[0]);

	precalc();

	fer(i, 1, n-1) fer(j, 1, m-1) {
		if(U[i+1][j] != -1 && L[i][j+1] != -1) check(U[i+1][j]+1, i, L[i][j+1]+1, j);
		if(U[i+1][j] != -1 && R[i][j-1] != -1) check(U[i+1][j]+1, i, j, R[i][j-1]-1);
		if(D[i-1][j] != -1 && L[i][j+1] != -1) check(i, D[i-1][j]-1, L[i][j+1]+1, j);
		if(D[i-1][j] != -1 && R[i][j-1] != -1) check(i, D[i-1][j]-1, j, R[i][j-1]-1);
		if(D[i-1][j] != -1 && R[D[i-1][j]-1][j-1] != -1) check(i, D[i-1][j]-1, j, R[D[i-1][j]-1][j-1]-1);
		if(D[i-1][j] != -1 && L[D[i-1][j]-1][j+1] != -1) check(i, D[i-1][j]-1, L[D[i-1][j]-1][j+1]+1, j);
	}
	
	sort(all(v));
	v.resize(unique(all(v)) - v.begin());

	return sz(v);
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 3 ms 1400 KB Output is correct
4 Correct 3 ms 1400 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1400 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 1400 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1400 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 616 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 1272 KB Output is correct
20 Correct 3 ms 1272 KB Output is correct
21 Correct 2 ms 632 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 3 ms 1400 KB Output is correct
4 Correct 3 ms 1400 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1400 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 1400 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1400 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 3320 KB Output is correct
18 Correct 5 ms 3324 KB Output is correct
19 Correct 5 ms 3324 KB Output is correct
20 Correct 5 ms 3064 KB Output is correct
21 Correct 5 ms 3064 KB Output is correct
22 Correct 5 ms 3192 KB Output is correct
23 Correct 5 ms 3192 KB Output is correct
24 Correct 5 ms 3064 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 1272 KB Output is correct
28 Correct 3 ms 1272 KB Output is correct
29 Correct 2 ms 632 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 3 ms 1400 KB Output is correct
4 Correct 3 ms 1400 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1400 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 1400 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1400 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 3320 KB Output is correct
18 Correct 5 ms 3324 KB Output is correct
19 Correct 5 ms 3324 KB Output is correct
20 Correct 5 ms 3064 KB Output is correct
21 Correct 5 ms 3064 KB Output is correct
22 Correct 5 ms 3192 KB Output is correct
23 Correct 5 ms 3192 KB Output is correct
24 Correct 5 ms 3064 KB Output is correct
25 Correct 14 ms 9188 KB Output is correct
26 Correct 15 ms 9332 KB Output is correct
27 Correct 15 ms 9332 KB Output is correct
28 Correct 14 ms 8184 KB Output is correct
29 Correct 15 ms 8440 KB Output is correct
30 Correct 16 ms 8568 KB Output is correct
31 Correct 16 ms 8568 KB Output is correct
32 Correct 16 ms 8440 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 1272 KB Output is correct
36 Correct 3 ms 1272 KB Output is correct
37 Correct 2 ms 632 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 3 ms 1400 KB Output is correct
4 Correct 3 ms 1400 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1400 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 1400 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1400 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 3320 KB Output is correct
18 Correct 5 ms 3324 KB Output is correct
19 Correct 5 ms 3324 KB Output is correct
20 Correct 5 ms 3064 KB Output is correct
21 Correct 5 ms 3064 KB Output is correct
22 Correct 5 ms 3192 KB Output is correct
23 Correct 5 ms 3192 KB Output is correct
24 Correct 5 ms 3064 KB Output is correct
25 Correct 14 ms 9188 KB Output is correct
26 Correct 15 ms 9332 KB Output is correct
27 Correct 15 ms 9332 KB Output is correct
28 Correct 14 ms 8184 KB Output is correct
29 Correct 15 ms 8440 KB Output is correct
30 Correct 16 ms 8568 KB Output is correct
31 Correct 16 ms 8568 KB Output is correct
32 Correct 16 ms 8440 KB Output is correct
33 Correct 83 ms 38536 KB Output is correct
34 Correct 82 ms 38520 KB Output is correct
35 Correct 79 ms 38392 KB Output is correct
36 Correct 78 ms 38520 KB Output is correct
37 Correct 157 ms 47884 KB Output is correct
38 Correct 161 ms 48040 KB Output is correct
39 Correct 158 ms 48224 KB Output is correct
40 Correct 147 ms 45916 KB Output is correct
41 Correct 121 ms 38408 KB Output is correct
42 Correct 125 ms 39400 KB Output is correct
43 Correct 147 ms 40168 KB Output is correct
44 Correct 153 ms 42144 KB Output is correct
45 Correct 85 ms 32468 KB Output is correct
46 Correct 69 ms 21360 KB Output is correct
47 Correct 147 ms 41192 KB Output is correct
48 Correct 150 ms 42188 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 1272 KB Output is correct
52 Correct 3 ms 1272 KB Output is correct
53 Correct 2 ms 632 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 632 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 2 ms 652 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 636 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 3 ms 632 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 656 ms 106332 KB Output is correct
3 Correct 1491 ms 211308 KB Output is correct
4 Correct 1520 ms 220704 KB Output is correct
5 Correct 1493 ms 220552 KB Output is correct
6 Correct 479 ms 100944 KB Output is correct
7 Correct 1081 ms 198752 KB Output is correct
8 Correct 1130 ms 204080 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 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 632 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 3 ms 1400 KB Output is correct
4 Correct 3 ms 1400 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1400 KB Output is correct
7 Correct 3 ms 1400 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 1400 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1400 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 3320 KB Output is correct
18 Correct 5 ms 3324 KB Output is correct
19 Correct 5 ms 3324 KB Output is correct
20 Correct 5 ms 3064 KB Output is correct
21 Correct 5 ms 3064 KB Output is correct
22 Correct 5 ms 3192 KB Output is correct
23 Correct 5 ms 3192 KB Output is correct
24 Correct 5 ms 3064 KB Output is correct
25 Correct 14 ms 9188 KB Output is correct
26 Correct 15 ms 9332 KB Output is correct
27 Correct 15 ms 9332 KB Output is correct
28 Correct 14 ms 8184 KB Output is correct
29 Correct 15 ms 8440 KB Output is correct
30 Correct 16 ms 8568 KB Output is correct
31 Correct 16 ms 8568 KB Output is correct
32 Correct 16 ms 8440 KB Output is correct
33 Correct 83 ms 38536 KB Output is correct
34 Correct 82 ms 38520 KB Output is correct
35 Correct 79 ms 38392 KB Output is correct
36 Correct 78 ms 38520 KB Output is correct
37 Correct 157 ms 47884 KB Output is correct
38 Correct 161 ms 48040 KB Output is correct
39 Correct 158 ms 48224 KB Output is correct
40 Correct 147 ms 45916 KB Output is correct
41 Correct 121 ms 38408 KB Output is correct
42 Correct 125 ms 39400 KB Output is correct
43 Correct 147 ms 40168 KB Output is correct
44 Correct 153 ms 42144 KB Output is correct
45 Correct 85 ms 32468 KB Output is correct
46 Correct 69 ms 21360 KB Output is correct
47 Correct 147 ms 41192 KB Output is correct
48 Correct 150 ms 42188 KB Output is correct
49 Correct 3 ms 632 KB Output is correct
50 Correct 3 ms 632 KB Output is correct
51 Correct 2 ms 652 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 3 ms 636 KB Output is correct
54 Correct 3 ms 632 KB Output is correct
55 Correct 3 ms 632 KB Output is correct
56 Correct 3 ms 632 KB Output is correct
57 Correct 3 ms 632 KB Output is correct
58 Correct 2 ms 504 KB Output is correct
59 Correct 3 ms 632 KB Output is correct
60 Correct 2 ms 636 KB Output is correct
61 Correct 656 ms 106332 KB Output is correct
62 Correct 1491 ms 211308 KB Output is correct
63 Correct 1520 ms 220704 KB Output is correct
64 Correct 1493 ms 220552 KB Output is correct
65 Correct 479 ms 100944 KB Output is correct
66 Correct 1081 ms 198752 KB Output is correct
67 Correct 1130 ms 204080 KB Output is correct
68 Correct 1203 ms 230256 KB Output is correct
69 Correct 1212 ms 236132 KB Output is correct
70 Correct 1090 ms 236760 KB Output is correct
71 Correct 1089 ms 236660 KB Output is correct
72 Correct 2348 ms 371104 KB Output is correct
73 Correct 1158 ms 145520 KB Output is correct
74 Correct 1281 ms 203240 KB Output is correct
75 Correct 2019 ms 247684 KB Output is correct
76 Correct 1215 ms 160500 KB Output is correct
77 Correct 1659 ms 248368 KB Output is correct
78 Correct 2033 ms 272672 KB Output is correct
79 Correct 1146 ms 153232 KB Output is correct
80 Correct 2015 ms 272952 KB Output is correct
81 Correct 1959 ms 266512 KB Output is correct
82 Correct 1387 ms 256952 KB Output is correct
83 Correct 2368 ms 371172 KB Output is correct
84 Correct 2341 ms 371212 KB Output is correct
85 Correct 2378 ms 371156 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 1272 KB Output is correct
89 Correct 3 ms 1272 KB Output is correct
90 Correct 2 ms 632 KB Output is correct