oj.uz

Submission #956953

# Submission time Handle Problem Language Result Execution time Memory
956953 2024-04-02T17:55:20 Z Macker Rectangles (IOI19_rect) C++17
59 / 100
 2698 ms 1048576 KB 
#include "rect.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define int ll
typedef pair<int, int> pii;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define FOR(i, n) for (int i = 0; i < n; i++)

struct node{
	int on = 0, mxx, mnx, mxy, mny;
};
vector<vector<node>> st;
int lenx = 1, leny = 1;
node zero({1, 0, INT_MAX, 0, INT_MAX});

vector<int> get_last_big(vector<int> v){
	int n = v.size();
	vector<int> res(n, -1);
	stack<pii> s;
	s.push({INT_MAX, -1});
	FOR(i, n){
		int a = v[i];
		while(a >= s.top().ff) s.pop();
		res[i] = s.top().ss;
		s.push({a, i});
	}
	return res;
}

node comb(node a, node b){
	node res;
	res.on = min(a.on, b.on);
	res.mnx = min(a.mnx, b.mnx);
	res.mny = min(a.mny, b.mny);
	res.mxx = max(a.mxx, b.mxx);
	res.mxy = max(a.mxy, b.mxy);
	return res;
}

void updy(int y, node val, int i, int j = 1, int s = 0, int e = leny){
	if(y < s || y >= e) return;
	if(y == s && s + 1 == e) {
		if(i >= lenx) st[i][j] = val;
		else st[i][j] = comb(st[i * 2][j], st[i * 2 + 1][j]);
		return;
	}

	updy(y, val, i, j * 2, s, (s + e) / 2);
	updy(y, val, i, j * 2 + 1, (s + e) / 2, e);
	st[i][j] = comb(st[i][j * 2], st[i][j * 2 + 1]);
}

void updx(int x, int y, node val, int i = 1, int s = 0, int e = lenx){
	if(x < s || x >= e) return;
	if(x == s && s + 1 == e) {updy(y, val, i); return;}

	updx(x, y, val, i * 2, s, (s + e) / 2);
	updx(x, y, val, i * 2 + 1, (s + e) / 2, e);
	
	updy(y, val, i);
}

node qryy(int l, int r, int i, int j = 1, int s = 0, int e = leny){
	if(l >= e || r <= s) return zero;
	if(l <= s && e <= r) return st[i][j];

	return comb(qryy(l, r, i, j * 2, s, (s + e) / 2),
				qryy(l, r, i, j * 2 + 1, (s + e) / 2, e));
}

node qryx(int xl, int xr, int yl, int yr, int i = 1, int s = 0, int e = lenx){
	if(xl >= e || xr <= s) return zero;
	if(xl <= s && e <= xr) return qryy(yl, yr, i);

	return comb(qryx(xl, xr, yl, yr, i * 2, s, (s + e) / 2),
				qryx(xl, xr, yl, yr, i * 2 + 1, (s + e) / 2, e));
}

long long count_rectangles(vector<vector<signed>> v) {
	int n = v.size();
	while(lenx < n) lenx *= 2;
	int m = v[0].size();
	while(leny < m) leny *= 2;
	st.assign(2 * lenx, vector<node>(2 * leny));
	vector<vector<node>> passive(n, vector<node>(m));

	FOR(i, n){
		vector<int> cur;
		vector<int> res;
		FOR(j, m){
			cur.push_back(v[i][j]);
		}
		res = get_last_big(cur);
		FOR(j, m){
			passive[i][j].mnx = res[j];
		}
		reverse(all(cur));
		res = get_last_big(cur);
		reverse(all(res));
		FOR(j, m){
			passive[i][j].mxx = m - res[j] - 1;
		}
	}
	FOR(j, m){
		vector<int> cur;
		vector<int> res;
		FOR(i, n){
			cur.push_back(v[i][j]);
		}
		res = get_last_big(cur);
		FOR(i, n){
			passive[i][j].mny = res[i];
		}
		reverse(all(cur));
		res = get_last_big(cur);
		reverse(all(res));
		FOR(i, n){
			passive[i][j].mxy = n - res[i] - 1;
		}
	}
	
	vector<vector<pii>> ord(7000005);
	FOR(i, n) FOR(j, m){
		ord[v[i][j]].push_back({i, j});
	}
	ll res = 0;
	for (auto o : ord) {
		for (auto [x, y] : o) {
			passive[x][y].on = true;
			updx(x, y, passive[x][y]);

			int mnx = passive[x][y].mnx;
			int mny = passive[x][y].mny;
			int mxx = passive[x][y].mxx;
			int mxy = passive[x][y].mxy;

			if(mxx >= m || mxy >= n || mnx < 0 || mny < 0) continue;
			
			node ret = qryx(
				mny + 1,
				mxy,
				mnx + 1,
				mxx
			);
			bool f = 0;
			if(!ret.on) f = 1;
			if(ret.mnx < mnx) f = 1;
			if(ret.mny < mny) f = 1;
			if(ret.mxx > mxx) f = 1;
			if(ret.mxy > mxy) f = 1;

			if(!f)
				res++;
		}
	}
	return res;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 164584 KB Output is correct
2 Correct 71 ms 164948 KB Output is correct
3 Correct 68 ms 165204 KB Output is correct
4 Correct 66 ms 164944 KB Output is correct
5 Correct 66 ms 164944 KB Output is correct
6 Correct 76 ms 165200 KB Output is correct
7 Correct 68 ms 164692 KB Output is correct
8 Correct 69 ms 164692 KB Output is correct
9 Correct 67 ms 164944 KB Output is correct
10 Correct 70 ms 164944 KB Output is correct
11 Correct 72 ms 164948 KB Output is correct
12 Correct 67 ms 164944 KB Output is correct
13 Correct 69 ms 164588 KB Output is correct
14 Correct 68 ms 164688 KB Output is correct
15 Correct 69 ms 164692 KB Output is correct
16 Correct 66 ms 164692 KB Output is correct
17 Correct 69 ms 164692 KB Output is correct
18 Correct 68 ms 164700 KB Output is correct
19 Correct 67 ms 164944 KB Output is correct
20 Correct 67 ms 164688 KB Output is correct
21 Correct 68 ms 164688 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 164584 KB Output is correct
2 Correct 71 ms 164948 KB Output is correct
3 Correct 68 ms 165204 KB Output is correct
4 Correct 66 ms 164944 KB Output is correct
5 Correct 66 ms 164944 KB Output is correct
6 Correct 76 ms 165200 KB Output is correct
7 Correct 68 ms 164692 KB Output is correct
8 Correct 69 ms 164692 KB Output is correct
9 Correct 67 ms 164944 KB Output is correct
10 Correct 70 ms 164944 KB Output is correct
11 Correct 72 ms 164948 KB Output is correct
12 Correct 67 ms 164944 KB Output is correct
13 Correct 69 ms 164588 KB Output is correct
14 Correct 68 ms 164688 KB Output is correct
15 Correct 69 ms 164692 KB Output is correct
16 Correct 66 ms 164692 KB Output is correct
17 Correct 69 ms 164692 KB Output is correct
18 Correct 68 ms 164700 KB Output is correct
19 Correct 67 ms 164944 KB Output is correct
20 Correct 67 ms 164688 KB Output is correct
21 Correct 68 ms 164688 KB Output is correct
22 Correct 82 ms 167936 KB Output is correct
23 Correct 84 ms 167764 KB Output is correct
24 Correct 81 ms 167856 KB Output is correct
25 Correct 74 ms 167756 KB Output is correct
26 Correct 77 ms 167764 KB Output is correct
27 Correct 81 ms 167764 KB Output is correct
28 Correct 77 ms 167764 KB Output is correct
29 Correct 73 ms 166228 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 164584 KB Output is correct
2 Correct 71 ms 164948 KB Output is correct
3 Correct 68 ms 165204 KB Output is correct
4 Correct 66 ms 164944 KB Output is correct
5 Correct 66 ms 164944 KB Output is correct
6 Correct 76 ms 165200 KB Output is correct
7 Correct 68 ms 164692 KB Output is correct
8 Correct 69 ms 164692 KB Output is correct
9 Correct 67 ms 164944 KB Output is correct
10 Correct 70 ms 164944 KB Output is correct
11 Correct 72 ms 164948 KB Output is correct
12 Correct 67 ms 164944 KB Output is correct
13 Correct 69 ms 164588 KB Output is correct
14 Correct 68 ms 164688 KB Output is correct
15 Correct 69 ms 164692 KB Output is correct
16 Correct 66 ms 164692 KB Output is correct
17 Correct 82 ms 167936 KB Output is correct
18 Correct 84 ms 167764 KB Output is correct
19 Correct 81 ms 167856 KB Output is correct
20 Correct 74 ms 167756 KB Output is correct
21 Correct 77 ms 167764 KB Output is correct
22 Correct 81 ms 167764 KB Output is correct
23 Correct 77 ms 167764 KB Output is correct
24 Correct 73 ms 166228 KB Output is correct
25 Correct 69 ms 164692 KB Output is correct
26 Correct 68 ms 164700 KB Output is correct
27 Correct 67 ms 164944 KB Output is correct
28 Correct 67 ms 164688 KB Output is correct
29 Correct 68 ms 164688 KB Output is correct
30 Correct 183 ms 178256 KB Output is correct
31 Correct 186 ms 178464 KB Output is correct
32 Correct 195 ms 178520 KB Output is correct
33 Correct 129 ms 177924 KB Output is correct
34 Correct 147 ms 178060 KB Output is correct
35 Correct 175 ms 178512 KB Output is correct
36 Correct 160 ms 178528 KB Output is correct
37 Correct 180 ms 178260 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 164584 KB Output is correct
2 Correct 71 ms 164948 KB Output is correct
3 Correct 68 ms 165204 KB Output is correct
4 Correct 66 ms 164944 KB Output is correct
5 Correct 66 ms 164944 KB Output is correct
6 Correct 76 ms 165200 KB Output is correct
7 Correct 68 ms 164692 KB Output is correct
8 Correct 69 ms 164692 KB Output is correct
9 Correct 67 ms 164944 KB Output is correct
10 Correct 70 ms 164944 KB Output is correct
11 Correct 72 ms 164948 KB Output is correct
12 Correct 67 ms 164944 KB Output is correct
13 Correct 69 ms 164588 KB Output is correct
14 Correct 68 ms 164688 KB Output is correct
15 Correct 69 ms 164692 KB Output is correct
16 Correct 66 ms 164692 KB Output is correct
17 Correct 82 ms 167936 KB Output is correct
18 Correct 84 ms 167764 KB Output is correct
19 Correct 81 ms 167856 KB Output is correct
20 Correct 74 ms 167756 KB Output is correct
21 Correct 77 ms 167764 KB Output is correct
22 Correct 81 ms 167764 KB Output is correct
23 Correct 77 ms 167764 KB Output is correct
24 Correct 73 ms 166228 KB Output is correct
25 Correct 183 ms 178256 KB Output is correct
26 Correct 186 ms 178464 KB Output is correct
27 Correct 195 ms 178520 KB Output is correct
28 Correct 129 ms 177924 KB Output is correct
29 Correct 147 ms 178060 KB Output is correct
30 Correct 175 ms 178512 KB Output is correct
31 Correct 160 ms 178528 KB Output is correct
32 Correct 180 ms 178260 KB Output is correct
33 Correct 69 ms 164692 KB Output is correct
34 Correct 68 ms 164700 KB Output is correct
35 Correct 67 ms 164944 KB Output is correct
36 Correct 67 ms 164688 KB Output is correct
37 Correct 68 ms 164688 KB Output is correct
38 Correct 1260 ms 367200 KB Output is correct
39 Correct 1158 ms 367088 KB Output is correct
40 Correct 1162 ms 366780 KB Output is correct
41 Correct 1172 ms 367188 KB Output is correct
42 Correct 2605 ms 370588 KB Output is correct
43 Correct 2548 ms 370688 KB Output is correct
44 Correct 2637 ms 371028 KB Output is correct
45 Correct 2319 ms 368336 KB Output is correct
46 Correct 1197 ms 364800 KB Output is correct
47 Correct 1297 ms 363664 KB Output is correct
48 Correct 2380 ms 366324 KB Output is correct
49 Correct 2698 ms 370708 KB Output is correct
50 Correct 1174 ms 267856 KB Output is correct
51 Correct 1155 ms 267860 KB Output is correct
52 Correct 2320 ms 367012 KB Output is correct
53 Correct 2510 ms 369940 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 167952 KB Output is correct
2 Correct 71 ms 168188 KB Output is correct
3 Correct 66 ms 167948 KB Output is correct
4 Correct 59 ms 164688 KB Output is correct
5 Correct 73 ms 167956 KB Output is correct
6 Correct 73 ms 167948 KB Output is correct
7 Correct 78 ms 168208 KB Output is correct
8 Correct 70 ms 167948 KB Output is correct
9 Correct 75 ms 167952 KB Output is correct
10 Correct 71 ms 165692 KB Output is correct
11 Correct 69 ms 166412 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 164692 KB Output is correct
2 Correct 68 ms 164700 KB Output is correct
3 Correct 67 ms 164944 KB Output is correct
4 Correct 67 ms 164688 KB Output is correct
5 Correct 68 ms 164688 KB Output is correct
6 Correct 62 ms 164700 KB Output is correct
7 Runtime error 536 ms 1048576 KB Execution killed with signal 9
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 164584 KB Output is correct
2 Correct 71 ms 164948 KB Output is correct
3 Correct 68 ms 165204 KB Output is correct
4 Correct 66 ms 164944 KB Output is correct
5 Correct 66 ms 164944 KB Output is correct
6 Correct 76 ms 165200 KB Output is correct
7 Correct 68 ms 164692 KB Output is correct
8 Correct 69 ms 164692 KB Output is correct
9 Correct 67 ms 164944 KB Output is correct
10 Correct 70 ms 164944 KB Output is correct
11 Correct 72 ms 164948 KB Output is correct
12 Correct 67 ms 164944 KB Output is correct
13 Correct 69 ms 164588 KB Output is correct
14 Correct 68 ms 164688 KB Output is correct
15 Correct 69 ms 164692 KB Output is correct
16 Correct 66 ms 164692 KB Output is correct
17 Correct 82 ms 167936 KB Output is correct
18 Correct 84 ms 167764 KB Output is correct
19 Correct 81 ms 167856 KB Output is correct
20 Correct 74 ms 167756 KB Output is correct
21 Correct 77 ms 167764 KB Output is correct
22 Correct 81 ms 167764 KB Output is correct
23 Correct 77 ms 167764 KB Output is correct
24 Correct 73 ms 166228 KB Output is correct
25 Correct 183 ms 178256 KB Output is correct
26 Correct 186 ms 178464 KB Output is correct
27 Correct 195 ms 178520 KB Output is correct
28 Correct 129 ms 177924 KB Output is correct
29 Correct 147 ms 178060 KB Output is correct
30 Correct 175 ms 178512 KB Output is correct
31 Correct 160 ms 178528 KB Output is correct
32 Correct 180 ms 178260 KB Output is correct
33 Correct 1260 ms 367200 KB Output is correct
34 Correct 1158 ms 367088 KB Output is correct
35 Correct 1162 ms 366780 KB Output is correct
36 Correct 1172 ms 367188 KB Output is correct
37 Correct 2605 ms 370588 KB Output is correct
38 Correct 2548 ms 370688 KB Output is correct
39 Correct 2637 ms 371028 KB Output is correct
40 Correct 2319 ms 368336 KB Output is correct
41 Correct 1197 ms 364800 KB Output is correct
42 Correct 1297 ms 363664 KB Output is correct
43 Correct 2380 ms 366324 KB Output is correct
44 Correct 2698 ms 370708 KB Output is correct
45 Correct 1174 ms 267856 KB Output is correct
46 Correct 1155 ms 267860 KB Output is correct
47 Correct 2320 ms 367012 KB Output is correct
48 Correct 2510 ms 369940 KB Output is correct
49 Correct 74 ms 167952 KB Output is correct
50 Correct 71 ms 168188 KB Output is correct
51 Correct 66 ms 167948 KB Output is correct
52 Correct 59 ms 164688 KB Output is correct
53 Correct 73 ms 167956 KB Output is correct
54 Correct 73 ms 167948 KB Output is correct
55 Correct 78 ms 168208 KB Output is correct
56 Correct 70 ms 167948 KB Output is correct
57 Correct 75 ms 167952 KB Output is correct
58 Correct 71 ms 165692 KB Output is correct
59 Correct 69 ms 166412 KB Output is correct
60 Correct 62 ms 164700 KB Output is correct
61 Runtime error 536 ms 1048576 KB Execution killed with signal 9
62 Halted 0 ms 0 KB -