oj.uz

답안 #443525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443525 2021-07-10T16:53:40 Z rainboy Rectangles (IOI19_rect) C++14
100 / 100
 2389 ms 386156 KB 
#include "rect.h"
#include <stdlib.h>

using namespace std;

typedef vector<int> vi;

const int N = 2500, M = 2500;

int *ej[N][N], eo[N][N];

void append(int i1, int i2, int j) {
	int o = eo[i1][i2]++;

	if (o >= 2 && (o & o - 1) == 0)
		ej[i1][i2] = (int *) realloc(ej[i1][i2], o * 2 * sizeof *ej[i1][i2]);
	ej[i1][i2][o] = j;
}

int qu[N], ii1[M][M], ii2[M][M], jj1[N][M], jj2[N][M], kk[N], ft[M][M];

void update(int *ft, int i, int n, int x) {
	while (i < n) {
		ft[i] += x;
		i |= i + 1;
	}
}

int query(int *ft, int i) {
	int x = 0;

	while (i >= 0) {
		x += ft[i];
		i &= i + 1, i--;
	}
	return x;
}

long long count_rectangles(vector<vi> aa) {
	int n = aa.size(), m = aa[0].size();
	long long ans;
	int h, i, i1, i2, j, j1, j2, o, cnt;

	for (i1 = 0; i1 < n; i1++)
		for (i2 = i1; i2 < n; i2++)
			ej[i1][i2] = (int *) malloc(2 * sizeof *ej[i1][i2]);
	for (j = 0; j < m; j++) {
		cnt = 0;
		for (i = 0; i < n; i++) {
			while (cnt && aa[qu[cnt - 1]][j] < aa[i][j])
				cnt--;
			if (cnt && qu[cnt - 1] + 1 < i)
				append(qu[cnt - 1] + 1, i - 1, j);
			qu[cnt++] = i;
		}
		cnt = 0;
		for (i = n - 1; i >= 0; i--) {
			while (cnt && aa[qu[cnt - 1]][j] < aa[i][j])
				cnt--;
			if (cnt && aa[qu[cnt - 1]][j] > aa[i][j] && i + 1 < qu[cnt - 1])
				append(i + 1, qu[cnt - 1] - 1, j);
			qu[cnt++] = i;
		}
	}
	for (j1 = 0; j1 < m; j1++)
		for (j2 = j1; j2 < m; j2++)
			ii1[j1][j2] = ii2[j1][j2] = n + 1;
	ans = 0;
	for (i1 = n - 1; i1 >= 0; i1--) {
		cnt = 0;
		for (j = 0; j < m; j++) {
			while (cnt && aa[i1][qu[cnt - 1]] < aa[i1][j])
				cnt--;
			if (cnt && qu[cnt - 1] + 1 < j) {
				j1 = qu[cnt - 1] + 1, j2 = j - 1;
				if (i1 + 1 < ii1[j1][j2])
					ii2[j1][j2] = i1;
				ii1[j1][j2] = i1;
				i2 = ii2[j1][j2];
				jj1[i2][kk[i2]] = j1, jj2[i2][kk[i2]] = j2, kk[i2]++;
				update(ft[j1], j2, m, 1);
			}
			qu[cnt++] = j;
		}
		cnt = 0;
		for (j = m - 1; j >= 0; j--) {
			while (cnt && aa[i1][qu[cnt - 1]] < aa[i1][j])
				cnt--;
			if (cnt && aa[i1][qu[cnt - 1]] > aa[i1][j] && j + 1 < qu[cnt - 1]) {
				j1 = j + 1, j2 = qu[cnt - 1] - 1;
				if (i1 + 1 < ii1[j1][j2])
					ii2[j1][j2] = i1;
				ii1[j1][j2] = i1;
				i2 = ii2[j1][j2];
				jj1[i2][kk[i2]] = j1, jj2[i2][kk[i2]] = j2, kk[i2]++;
				update(ft[j1], j2, m, 1);
			}
			qu[cnt++] = j;
		}
		for (i2 = i1; i2 < n; i2++) {
			for (o = eo[i1][i2], j2 = m + 1; o--; ) {
				j1 = ej[i1][i2][o];
				if (o + 1 == eo[i1][i2] || j1 + 1 < ej[i1][i2][o + 1])
					j2 = j1;
				ans += query(ft[j1], j2);
			}
			for (h = 0; h < kk[i2]; h++) {
				j1 = jj1[i2][h], j2 = jj2[i2][h];
				update(ft[j1], j2, m, -1);
			}
			kk[i2] = 0;
		}
	}
	return ans;
}

Compilation message

rect.cpp: In function 'void append(int, int, int)':
rect.cpp:15:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   15 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 1 ms 1196 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 0 ms 332 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 1 ms 1196 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 3 ms 2124 KB Output is correct
23 Correct 2 ms 2252 KB Output is correct
24 Correct 2 ms 2124 KB Output is correct
25 Correct 2 ms 2764 KB Output is correct
26 Correct 4 ms 2764 KB Output is correct
27 Correct 3 ms 2764 KB Output is correct
28 Correct 3 ms 2764 KB Output is correct
29 Correct 3 ms 2124 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 1 ms 1196 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 3 ms 2124 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 2 ms 2124 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 4 ms 2764 KB Output is correct
22 Correct 3 ms 2764 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 3 ms 2124 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 1100 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 8 ms 5708 KB Output is correct
31 Correct 8 ms 5708 KB Output is correct
32 Correct 7 ms 5708 KB Output is correct
33 Correct 8 ms 7372 KB Output is correct
34 Correct 12 ms 7668 KB Output is correct
35 Correct 12 ms 7672 KB Output is correct
36 Correct 11 ms 7628 KB Output is correct
37 Correct 11 ms 7500 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 1 ms 1196 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 3 ms 2124 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 2 ms 2124 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 4 ms 2764 KB Output is correct
22 Correct 3 ms 2764 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 3 ms 2124 KB Output is correct
25 Correct 8 ms 5708 KB Output is correct
26 Correct 8 ms 5708 KB Output is correct
27 Correct 7 ms 5708 KB Output is correct
28 Correct 8 ms 7372 KB Output is correct
29 Correct 12 ms 7668 KB Output is correct
30 Correct 12 ms 7672 KB Output is correct
31 Correct 11 ms 7628 KB Output is correct
32 Correct 11 ms 7500 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 1 ms 1100 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 82 ms 39072 KB Output is correct
39 Correct 75 ms 39008 KB Output is correct
40 Correct 65 ms 39072 KB Output is correct
41 Correct 58 ms 39108 KB Output is correct
42 Correct 118 ms 32600 KB Output is correct
43 Correct 112 ms 32580 KB Output is correct
44 Correct 117 ms 32600 KB Output is correct
45 Correct 108 ms 30528 KB Output is correct
46 Correct 71 ms 37376 KB Output is correct
47 Correct 86 ms 38468 KB Output is correct
48 Correct 139 ms 41976 KB Output is correct
49 Correct 142 ms 42152 KB Output is correct
50 Correct 76 ms 31156 KB Output is correct
51 Correct 67 ms 24188 KB Output is correct
52 Correct 141 ms 40636 KB Output is correct
53 Correct 140 ms 40680 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 50764 KB Output is correct
2 Correct 22 ms 41892 KB Output is correct
3 Correct 21 ms 40780 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 29 ms 56608 KB Output is correct
6 Correct 30 ms 56172 KB Output is correct
7 Correct 29 ms 56364 KB Output is correct
8 Correct 29 ms 55416 KB Output is correct
9 Correct 30 ms 55068 KB Output is correct
10 Correct 24 ms 49844 KB Output is correct
11 Correct 33 ms 54216 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 465 ms 136656 KB Output is correct
8 Correct 1088 ms 288632 KB Output is correct
9 Correct 1082 ms 290356 KB Output is correct
10 Correct 1048 ms 290236 KB Output is correct
11 Correct 186 ms 99652 KB Output is correct
12 Correct 431 ms 215228 KB Output is correct
13 Correct 546 ms 221188 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 1 ms 1196 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 3 ms 2124 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 2 ms 2124 KB Output is correct
20 Correct 2 ms 2764 KB Output is correct
21 Correct 4 ms 2764 KB Output is correct
22 Correct 3 ms 2764 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 3 ms 2124 KB Output is correct
25 Correct 8 ms 5708 KB Output is correct
26 Correct 8 ms 5708 KB Output is correct
27 Correct 7 ms 5708 KB Output is correct
28 Correct 8 ms 7372 KB Output is correct
29 Correct 12 ms 7668 KB Output is correct
30 Correct 12 ms 7672 KB Output is correct
31 Correct 11 ms 7628 KB Output is correct
32 Correct 11 ms 7500 KB Output is correct
33 Correct 82 ms 39072 KB Output is correct
34 Correct 75 ms 39008 KB Output is correct
35 Correct 65 ms 39072 KB Output is correct
36 Correct 58 ms 39108 KB Output is correct
37 Correct 118 ms 32600 KB Output is correct
38 Correct 112 ms 32580 KB Output is correct
39 Correct 117 ms 32600 KB Output is correct
40 Correct 108 ms 30528 KB Output is correct
41 Correct 71 ms 37376 KB Output is correct
42 Correct 86 ms 38468 KB Output is correct
43 Correct 139 ms 41976 KB Output is correct
44 Correct 142 ms 42152 KB Output is correct
45 Correct 76 ms 31156 KB Output is correct
46 Correct 67 ms 24188 KB Output is correct
47 Correct 141 ms 40636 KB Output is correct
48 Correct 140 ms 40680 KB Output is correct
49 Correct 27 ms 50764 KB Output is correct
50 Correct 22 ms 41892 KB Output is correct
51 Correct 21 ms 40780 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 29 ms 56608 KB Output is correct
54 Correct 30 ms 56172 KB Output is correct
55 Correct 29 ms 56364 KB Output is correct
56 Correct 29 ms 55416 KB Output is correct
57 Correct 30 ms 55068 KB Output is correct
58 Correct 24 ms 49844 KB Output is correct
59 Correct 33 ms 54216 KB Output is correct
60 Correct 1 ms 460 KB Output is correct
61 Correct 465 ms 136656 KB Output is correct
62 Correct 1088 ms 288632 KB Output is correct
63 Correct 1082 ms 290356 KB Output is correct
64 Correct 1048 ms 290236 KB Output is correct
65 Correct 186 ms 99652 KB Output is correct
66 Correct 431 ms 215228 KB Output is correct
67 Correct 546 ms 221188 KB Output is correct
68 Correct 0 ms 204 KB Output is correct
69 Correct 0 ms 332 KB Output is correct
70 Correct 1 ms 1100 KB Output is correct
71 Correct 1 ms 460 KB Output is correct
72 Correct 0 ms 332 KB Output is correct
73 Correct 1288 ms 301788 KB Output is correct
74 Correct 1100 ms 301828 KB Output is correct
75 Correct 997 ms 301896 KB Output is correct
76 Correct 800 ms 301840 KB Output is correct
77 Correct 1778 ms 278668 KB Output is correct
78 Correct 1275 ms 209192 KB Output is correct
79 Correct 1361 ms 304692 KB Output is correct
80 Correct 2242 ms 358392 KB Output is correct
81 Correct 1333 ms 225360 KB Output is correct
82 Correct 1786 ms 348464 KB Output is correct
83 Correct 2389 ms 386156 KB Output is correct
84 Correct 1188 ms 213780 KB Output is correct
85 Correct 2121 ms 377684 KB Output is correct
86 Correct 2037 ms 365884 KB Output is correct
87 Correct 1014 ms 247104 KB Output is correct
88 Correct 1700 ms 326412 KB Output is correct
89 Correct 1682 ms 326600 KB Output is correct
90 Correct 1668 ms 326636 KB Output is correct