oj.uz

Submission #667486

# Submission time Handle Problem Language Result Execution time Memory
667486 2022-12-01T14:47:07 Z flappybird Rectangles (IOI19_rect) C++17
100 / 100
 4572 ms 713840 KB 
#include "rect.h"
#include <bits/stdc++.h>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define MAX 2503
int N, M;
int trans(int i, int j) {
	return j * (j + 1) / 2 + i;
}
vector<short> axis[2][MAX * (MAX + 1) / 2];
vector<short> endp[2][MAX * (MAX + 1) / 2];
short l[MAX][MAX];
short r[MAX][MAX];
short d[MAX];
short u[MAX];
int ans = 0; void chk(short r1, short c1, short r2, short c2) {
	if (r1 > r2 || c1 > c2 || r2 >= N - 1 || c2 >= M - 1 || r1 <= 0 || c1 <= 0) return;
	short ind1, ind2;
	ind1 = lower_bound(axis[0][trans(r1, r2)].begin(), axis[0][trans(r1, r2)].end(), c1) - axis[0][trans(r1, r2)].begin();
	ind2 = lower_bound(axis[0][trans(r1, r2)].begin(), axis[0][trans(r1, r2)].end(), c2) - axis[0][trans(r1, r2)].begin();
	if (ind1 >= axis[0][trans(r1, r2)].size()) return;
	if (ind2 >= axis[0][trans(r1, r2)].size()) return;
	if (c1 != axis[0][trans(r1, r2)][ind1]) return;
	if (c2 != axis[0][trans(r1, r2)][ind2]) return;
	if (c2 - c1 != ind2 - ind1) return;
	ind1 = lower_bound(axis[1][trans(c1, c2)].begin(), axis[1][trans(c1, c2)].end(), r1) - axis[1][trans(c1, c2)].begin();
	ind2 = lower_bound(axis[1][trans(c1, c2)].begin(), axis[1][trans(c1, c2)].end(), r2) - axis[1][trans(c1, c2)].begin();
	if (ind1 >= axis[1][trans(c1, c2)].size()) return;
	if (ind2 >= axis[1][trans(c1, c2)].size()) return;
	if (r1 != axis[1][trans(c1, c2)][ind1]) return;
	if (r2 != axis[1][trans(c1, c2)][ind2]) return;
	if (r2 - r1 != ind2 - ind1) return;
	ans++;
}
long long count_rectangles(std::vector<std::vector<int> > A) {
	N = A.size();
	M = A[0].size();
	int i, j;
	memset(l, -1, sizeof(l));
	memset(r, -1, sizeof(r));
	for (i = 0; i < N; i++) {
		vector<pii> st;
		for (j = 0; j < M; j++) {
			int cc = 1;
			while (st.size() && st.back().first <= A[i][j]) {
				if (st.back().first == A[i][j]) cc = 0;
				if (st.back().second + 1 <= j) r[i][st.back().second] = j - 1;
				if (st.back().second + 1 <= j - 1) {
					axis[1][trans(st.back().second + 1, j - 1)].push_back(i);
					endp[1][trans(i, st.back().second + 1)].push_back(j - 1);
				}
				st.pop_back();
			}
			if (st.size()) l[i][j] = st.back().second + 1;
			if (cc && st.size() && st.back().second + 1 <= j - 1) {
				axis[1][trans(st.back().second + 1, j - 1)].push_back(i);
				endp[1][trans(i, st.back().second + 1)].push_back(j - 1);
			}
			st.emplace_back(A[i][j], j);
		}
	}
	vector<tuple<short, short, short, short>> v;
	for (i = 0; i < M; i++) {
		vector<pii> st;
		memset(u, -1, sizeof(u));
		memset(d, -1, sizeof(d));
		for (j = 0; j < N; j++) {
			int cc = 1;
			while (st.size() && st.back().first <= A[j][i]) {
				if (st.back().first == A[j][i]) cc = 0;
				if (st.back().second + 1 <= j) d[st.back().second] = j - 1;
				if (st.back().second + 1 <= j - 1) {
					axis[0][trans(st.back().second + 1, j - 1)].push_back(i);
					endp[0][trans(st.back().second + 1, i)].push_back(j - 1);
				}
				st.pop_back();
			}
			if (st.size()) u[j] = st.back().second + 1;
			if (cc && st.size() && st.back().second + 1 <= j - 1) {
				axis[0][trans(st.back().second + 1, j - 1)].push_back(i);
				endp[0][trans(st.back().second + 1, i)].push_back(j - 1);
			}
			st.emplace_back(A[j][i], j);
		}
		for (j = 1; j < N - 1; j++) if (~l[j][i] && ~r[j][i] && ~u[j] && ~d[j]) v.emplace_back(l[j][i], u[j], r[j][i], d[j]);
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	for (auto& [a, b, c, d] : v) chk(b, a, d, c);
	return ans;
}

Compilation message

rect.cpp: In function 'void chk(short int, short int, short int, short int)':
rect.cpp:23:11: warning: comparison of integer expressions of different signedness: 'short int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  if (ind1 >= axis[0][trans(r1, r2)].size()) return;
      |      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:24:11: warning: comparison of integer expressions of different signedness: 'short int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |  if (ind2 >= axis[0][trans(r1, r2)].size()) return;
      |      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:30:11: warning: comparison of integer expressions of different signedness: 'short int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  if (ind1 >= axis[1][trans(c1, c2)].size()) return;
      |      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:31:11: warning: comparison of integer expressions of different signedness: 'short int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  if (ind2 >= axis[1][trans(c1, c2)].size()) return;
      |      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 319092 KB Output is correct
2 Correct 141 ms 319188 KB Output is correct
3 Correct 148 ms 319232 KB Output is correct
4 Correct 142 ms 319208 KB Output is correct
5 Correct 149 ms 319128 KB Output is correct
6 Correct 143 ms 319168 KB Output is correct
7 Correct 144 ms 319148 KB Output is correct
8 Correct 144 ms 319204 KB Output is correct
9 Correct 148 ms 319104 KB Output is correct
10 Correct 153 ms 319156 KB Output is correct
11 Correct 145 ms 319224 KB Output is correct
12 Correct 145 ms 319228 KB Output is correct
13 Correct 145 ms 319136 KB Output is correct
14 Correct 147 ms 319180 KB Output is correct
15 Correct 154 ms 319076 KB Output is correct
16 Correct 143 ms 319080 KB Output is correct
17 Correct 147 ms 319136 KB Output is correct
18 Correct 141 ms 319096 KB Output is correct
19 Correct 141 ms 319104 KB Output is correct
20 Correct 141 ms 319104 KB Output is correct
21 Correct 142 ms 319056 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 319092 KB Output is correct
2 Correct 141 ms 319188 KB Output is correct
3 Correct 148 ms 319232 KB Output is correct
4 Correct 142 ms 319208 KB Output is correct
5 Correct 149 ms 319128 KB Output is correct
6 Correct 143 ms 319168 KB Output is correct
7 Correct 144 ms 319148 KB Output is correct
8 Correct 144 ms 319204 KB Output is correct
9 Correct 148 ms 319104 KB Output is correct
10 Correct 153 ms 319156 KB Output is correct
11 Correct 145 ms 319224 KB Output is correct
12 Correct 145 ms 319228 KB Output is correct
13 Correct 145 ms 319136 KB Output is correct
14 Correct 147 ms 319180 KB Output is correct
15 Correct 154 ms 319076 KB Output is correct
16 Correct 143 ms 319080 KB Output is correct
17 Correct 147 ms 319136 KB Output is correct
18 Correct 141 ms 319096 KB Output is correct
19 Correct 141 ms 319104 KB Output is correct
20 Correct 141 ms 319104 KB Output is correct
21 Correct 142 ms 319056 KB Output is correct
22 Correct 146 ms 319484 KB Output is correct
23 Correct 144 ms 319536 KB Output is correct
24 Correct 146 ms 319468 KB Output is correct
25 Correct 145 ms 319296 KB Output is correct
26 Correct 147 ms 319500 KB Output is correct
27 Correct 155 ms 319468 KB Output is correct
28 Correct 142 ms 319412 KB Output is correct
29 Correct 143 ms 319308 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 319092 KB Output is correct
2 Correct 141 ms 319188 KB Output is correct
3 Correct 148 ms 319232 KB Output is correct
4 Correct 142 ms 319208 KB Output is correct
5 Correct 149 ms 319128 KB Output is correct
6 Correct 143 ms 319168 KB Output is correct
7 Correct 144 ms 319148 KB Output is correct
8 Correct 144 ms 319204 KB Output is correct
9 Correct 148 ms 319104 KB Output is correct
10 Correct 153 ms 319156 KB Output is correct
11 Correct 145 ms 319224 KB Output is correct
12 Correct 145 ms 319228 KB Output is correct
13 Correct 145 ms 319136 KB Output is correct
14 Correct 147 ms 319180 KB Output is correct
15 Correct 154 ms 319076 KB Output is correct
16 Correct 143 ms 319080 KB Output is correct
17 Correct 146 ms 319484 KB Output is correct
18 Correct 144 ms 319536 KB Output is correct
19 Correct 146 ms 319468 KB Output is correct
20 Correct 145 ms 319296 KB Output is correct
21 Correct 147 ms 319500 KB Output is correct
22 Correct 155 ms 319468 KB Output is correct
23 Correct 142 ms 319412 KB Output is correct
24 Correct 143 ms 319308 KB Output is correct
25 Correct 147 ms 319136 KB Output is correct
26 Correct 141 ms 319096 KB Output is correct
27 Correct 141 ms 319104 KB Output is correct
28 Correct 141 ms 319104 KB Output is correct
29 Correct 142 ms 319056 KB Output is correct
30 Correct 153 ms 321432 KB Output is correct
31 Correct 156 ms 321532 KB Output is correct
32 Correct 166 ms 321664 KB Output is correct
33 Correct 156 ms 320456 KB Output is correct
34 Correct 172 ms 321356 KB Output is correct
35 Correct 157 ms 321488 KB Output is correct
36 Correct 158 ms 321364 KB Output is correct
37 Correct 167 ms 321360 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 319092 KB Output is correct
2 Correct 141 ms 319188 KB Output is correct
3 Correct 148 ms 319232 KB Output is correct
4 Correct 142 ms 319208 KB Output is correct
5 Correct 149 ms 319128 KB Output is correct
6 Correct 143 ms 319168 KB Output is correct
7 Correct 144 ms 319148 KB Output is correct
8 Correct 144 ms 319204 KB Output is correct
9 Correct 148 ms 319104 KB Output is correct
10 Correct 153 ms 319156 KB Output is correct
11 Correct 145 ms 319224 KB Output is correct
12 Correct 145 ms 319228 KB Output is correct
13 Correct 145 ms 319136 KB Output is correct
14 Correct 147 ms 319180 KB Output is correct
15 Correct 154 ms 319076 KB Output is correct
16 Correct 143 ms 319080 KB Output is correct
17 Correct 146 ms 319484 KB Output is correct
18 Correct 144 ms 319536 KB Output is correct
19 Correct 146 ms 319468 KB Output is correct
20 Correct 145 ms 319296 KB Output is correct
21 Correct 147 ms 319500 KB Output is correct
22 Correct 155 ms 319468 KB Output is correct
23 Correct 142 ms 319412 KB Output is correct
24 Correct 143 ms 319308 KB Output is correct
25 Correct 153 ms 321432 KB Output is correct
26 Correct 156 ms 321532 KB Output is correct
27 Correct 166 ms 321664 KB Output is correct
28 Correct 156 ms 320456 KB Output is correct
29 Correct 172 ms 321356 KB Output is correct
30 Correct 157 ms 321488 KB Output is correct
31 Correct 158 ms 321364 KB Output is correct
32 Correct 167 ms 321360 KB Output is correct
33 Correct 147 ms 319136 KB Output is correct
34 Correct 141 ms 319096 KB Output is correct
35 Correct 141 ms 319104 KB Output is correct
36 Correct 141 ms 319104 KB Output is correct
37 Correct 142 ms 319056 KB Output is correct
38 Correct 219 ms 351232 KB Output is correct
39 Correct 227 ms 344484 KB Output is correct
40 Correct 216 ms 344344 KB Output is correct
41 Correct 203 ms 341108 KB Output is correct
42 Correct 301 ms 346640 KB Output is correct
43 Correct 309 ms 346540 KB Output is correct
44 Correct 303 ms 346696 KB Output is correct
45 Correct 287 ms 345956 KB Output is correct
46 Correct 262 ms 332576 KB Output is correct
47 Correct 281 ms 335720 KB Output is correct
48 Correct 374 ms 342060 KB Output is correct
49 Correct 425 ms 342892 KB Output is correct
50 Correct 266 ms 329844 KB Output is correct
51 Correct 265 ms 332716 KB Output is correct
52 Correct 379 ms 340928 KB Output is correct
53 Correct 413 ms 340960 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 319532 KB Output is correct
2 Correct 168 ms 319656 KB Output is correct
3 Correct 172 ms 319180 KB Output is correct
4 Correct 165 ms 319144 KB Output is correct
5 Correct 148 ms 319636 KB Output is correct
6 Correct 152 ms 319608 KB Output is correct
7 Correct 147 ms 319560 KB Output is correct
8 Correct 150 ms 319540 KB Output is correct
9 Correct 147 ms 319564 KB Output is correct
10 Correct 148 ms 319304 KB Output is correct
11 Correct 156 ms 319436 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 319136 KB Output is correct
2 Correct 141 ms 319096 KB Output is correct
3 Correct 141 ms 319104 KB Output is correct
4 Correct 141 ms 319104 KB Output is correct
5 Correct 142 ms 319056 KB Output is correct
6 Correct 143 ms 319124 KB Output is correct
7 Correct 954 ms 397496 KB Output is correct
8 Correct 1808 ms 479160 KB Output is correct
9 Correct 1830 ms 479372 KB Output is correct
10 Correct 1857 ms 479420 KB Output is correct
11 Correct 262 ms 343932 KB Output is correct
12 Correct 353 ms 365556 KB Output is correct
13 Correct 374 ms 368700 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 319092 KB Output is correct
2 Correct 141 ms 319188 KB Output is correct
3 Correct 148 ms 319232 KB Output is correct
4 Correct 142 ms 319208 KB Output is correct
5 Correct 149 ms 319128 KB Output is correct
6 Correct 143 ms 319168 KB Output is correct
7 Correct 144 ms 319148 KB Output is correct
8 Correct 144 ms 319204 KB Output is correct
9 Correct 148 ms 319104 KB Output is correct
10 Correct 153 ms 319156 KB Output is correct
11 Correct 145 ms 319224 KB Output is correct
12 Correct 145 ms 319228 KB Output is correct
13 Correct 145 ms 319136 KB Output is correct
14 Correct 147 ms 319180 KB Output is correct
15 Correct 154 ms 319076 KB Output is correct
16 Correct 143 ms 319080 KB Output is correct
17 Correct 146 ms 319484 KB Output is correct
18 Correct 144 ms 319536 KB Output is correct
19 Correct 146 ms 319468 KB Output is correct
20 Correct 145 ms 319296 KB Output is correct
21 Correct 147 ms 319500 KB Output is correct
22 Correct 155 ms 319468 KB Output is correct
23 Correct 142 ms 319412 KB Output is correct
24 Correct 143 ms 319308 KB Output is correct
25 Correct 153 ms 321432 KB Output is correct
26 Correct 156 ms 321532 KB Output is correct
27 Correct 166 ms 321664 KB Output is correct
28 Correct 156 ms 320456 KB Output is correct
29 Correct 172 ms 321356 KB Output is correct
30 Correct 157 ms 321488 KB Output is correct
31 Correct 158 ms 321364 KB Output is correct
32 Correct 167 ms 321360 KB Output is correct
33 Correct 219 ms 351232 KB Output is correct
34 Correct 227 ms 344484 KB Output is correct
35 Correct 216 ms 344344 KB Output is correct
36 Correct 203 ms 341108 KB Output is correct
37 Correct 301 ms 346640 KB Output is correct
38 Correct 309 ms 346540 KB Output is correct
39 Correct 303 ms 346696 KB Output is correct
40 Correct 287 ms 345956 KB Output is correct
41 Correct 262 ms 332576 KB Output is correct
42 Correct 281 ms 335720 KB Output is correct
43 Correct 374 ms 342060 KB Output is correct
44 Correct 425 ms 342892 KB Output is correct
45 Correct 266 ms 329844 KB Output is correct
46 Correct 265 ms 332716 KB Output is correct
47 Correct 379 ms 340928 KB Output is correct
48 Correct 413 ms 340960 KB Output is correct
49 Correct 146 ms 319532 KB Output is correct
50 Correct 168 ms 319656 KB Output is correct
51 Correct 172 ms 319180 KB Output is correct
52 Correct 165 ms 319144 KB Output is correct
53 Correct 148 ms 319636 KB Output is correct
54 Correct 152 ms 319608 KB Output is correct
55 Correct 147 ms 319560 KB Output is correct
56 Correct 150 ms 319540 KB Output is correct
57 Correct 147 ms 319564 KB Output is correct
58 Correct 148 ms 319304 KB Output is correct
59 Correct 156 ms 319436 KB Output is correct
60 Correct 143 ms 319124 KB Output is correct
61 Correct 954 ms 397496 KB Output is correct
62 Correct 1808 ms 479160 KB Output is correct
63 Correct 1830 ms 479372 KB Output is correct
64 Correct 1857 ms 479420 KB Output is correct
65 Correct 262 ms 343932 KB Output is correct
66 Correct 353 ms 365556 KB Output is correct
67 Correct 374 ms 368700 KB Output is correct
68 Correct 147 ms 319136 KB Output is correct
69 Correct 141 ms 319096 KB Output is correct
70 Correct 141 ms 319104 KB Output is correct
71 Correct 141 ms 319104 KB Output is correct
72 Correct 142 ms 319056 KB Output is correct
73 Correct 1231 ms 713840 KB Output is correct
74 Correct 1152 ms 623224 KB Output is correct
75 Correct 1370 ms 623208 KB Output is correct
76 Correct 1299 ms 582304 KB Output is correct
77 Correct 2664 ms 703852 KB Output is correct
78 Correct 2514 ms 513212 KB Output is correct
79 Correct 2734 ms 500936 KB Output is correct
80 Correct 4188 ms 615228 KB Output is correct
81 Correct 2549 ms 529728 KB Output is correct
82 Correct 3549 ms 584088 KB Output is correct
83 Correct 4572 ms 642704 KB Output is correct
84 Correct 2297 ms 508712 KB Output is correct
85 Correct 4026 ms 626476 KB Output is correct
86 Correct 3893 ms 619356 KB Output is correct
87 Correct 1494 ms 502420 KB Output is correct
88 Correct 2932 ms 701016 KB Output is correct
89 Correct 2805 ms 701652 KB Output is correct
90 Correct 2714 ms 701612 KB Output is correct