oj.uz

Submission #956961

# Submission time Handle Problem Language Result Execution time Memory
956961 2024-04-02T18:05:35 Z Macker Rectangles (IOI19_rect) C++17
59 / 100
 5000 ms 790952 KB 
#include "rect.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
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/2, 0, INT_MAX/2});

vector<int> get_last_big(vector<int> v){
	int n = v.size();
	vector<int> res(n, -1);
	stack<pii> s;
	s.push({INT_MAX/2, -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;
		}
	}
	
	int mxval = 0;
	FOR(i, n) FOR(j, m) mxval = max(mxval, v[i][j]);
	vector<vector<pii>> ord(mxval + 1);
	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 1 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 58 ms 164760 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 31 ms 94296 KB Output is correct
7 Correct 32 ms 94300 KB Output is correct
8 Correct 37 ms 94044 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 34 ms 94264 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 0 ms 360 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 58 ms 164760 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 31 ms 94296 KB Output is correct
7 Correct 32 ms 94300 KB Output is correct
8 Correct 37 ms 94044 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 34 ms 94264 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 0 ms 360 KB Output is correct
22 Correct 15 ms 2292 KB Output is correct
23 Correct 69 ms 166364 KB Output is correct
24 Correct 14 ms 3176 KB Output is correct
25 Correct 8 ms 2048 KB Output is correct
26 Correct 10 ms 1896 KB Output is correct
27 Correct 11 ms 4968 KB Output is correct
28 Correct 9 ms 1888 KB Output is correct
29 Correct 36 ms 95220 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 58 ms 164760 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 31 ms 94296 KB Output is correct
7 Correct 32 ms 94300 KB Output is correct
8 Correct 37 ms 94044 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 34 ms 94264 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 15 ms 2292 KB Output is correct
18 Correct 69 ms 166364 KB Output is correct
19 Correct 14 ms 3176 KB Output is correct
20 Correct 8 ms 2048 KB Output is correct
21 Correct 10 ms 1896 KB Output is correct
22 Correct 11 ms 4968 KB Output is correct
23 Correct 9 ms 1888 KB Output is correct
24 Correct 36 ms 95220 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 356 KB Output is correct
27 Correct 1 ms 360 KB Output is correct
28 Correct 1 ms 360 KB Output is correct
29 Correct 0 ms 360 KB Output is correct
30 Correct 112 ms 9052 KB Output is correct
31 Correct 104 ms 9048 KB Output is correct
32 Correct 152 ms 101976 KB Output is correct
33 Correct 55 ms 7248 KB Output is correct
34 Correct 75 ms 7508 KB Output is correct
35 Correct 121 ms 101972 KB Output is correct
36 Correct 82 ms 17240 KB Output is correct
37 Correct 144 ms 172500 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 58 ms 164760 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 31 ms 94296 KB Output is correct
7 Correct 32 ms 94300 KB Output is correct
8 Correct 37 ms 94044 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 34 ms 94264 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 15 ms 2292 KB Output is correct
18 Correct 69 ms 166364 KB Output is correct
19 Correct 14 ms 3176 KB Output is correct
20 Correct 8 ms 2048 KB Output is correct
21 Correct 10 ms 1896 KB Output is correct
22 Correct 11 ms 4968 KB Output is correct
23 Correct 9 ms 1888 KB Output is correct
24 Correct 36 ms 95220 KB Output is correct
25 Correct 112 ms 9052 KB Output is correct
26 Correct 104 ms 9048 KB Output is correct
27 Correct 152 ms 101976 KB Output is correct
28 Correct 55 ms 7248 KB Output is correct
29 Correct 75 ms 7508 KB Output is correct
30 Correct 121 ms 101972 KB Output is correct
31 Correct 82 ms 17240 KB Output is correct
32 Correct 144 ms 172500 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 356 KB Output is correct
35 Correct 1 ms 360 KB Output is correct
36 Correct 1 ms 360 KB Output is correct
37 Correct 0 ms 360 KB Output is correct
38 Correct 903 ms 112412 KB Output is correct
39 Correct 904 ms 112548 KB Output is correct
40 Correct 892 ms 112456 KB Output is correct
41 Correct 882 ms 112464 KB Output is correct
42 Correct 2368 ms 125944 KB Output is correct
43 Correct 2274 ms 135508 KB Output is correct
44 Correct 2343 ms 159572 KB Output is correct
45 Correct 2072 ms 251476 KB Output is correct
46 Correct 937 ms 102844 KB Output is correct
47 Correct 1006 ms 102204 KB Output is correct
48 Correct 1764 ms 104308 KB Output is correct
49 Correct 2125 ms 208160 KB Output is correct
50 Correct 945 ms 151476 KB Output is correct
51 Correct 971 ms 151432 KB Output is correct
52 Correct 1801 ms 106344 KB Output is correct
53 Correct 1963 ms 207008 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 96336 KB Output is correct
2 Correct 42 ms 95924 KB Output is correct
3 Correct 6 ms 1976 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 41 ms 96180 KB Output is correct
6 Correct 64 ms 166576 KB Output is correct
7 Correct 57 ms 143084 KB Output is correct
8 Correct 7 ms 2232 KB Output is correct
9 Correct 42 ms 96172 KB Output is correct
10 Correct 53 ms 157472 KB Output is correct
11 Correct 14 ms 27572 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Execution timed out 5092 ms 790952 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 58 ms 164760 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 31 ms 94296 KB Output is correct
7 Correct 32 ms 94300 KB Output is correct
8 Correct 37 ms 94044 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 34 ms 94264 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 15 ms 2292 KB Output is correct
18 Correct 69 ms 166364 KB Output is correct
19 Correct 14 ms 3176 KB Output is correct
20 Correct 8 ms 2048 KB Output is correct
21 Correct 10 ms 1896 KB Output is correct
22 Correct 11 ms 4968 KB Output is correct
23 Correct 9 ms 1888 KB Output is correct
24 Correct 36 ms 95220 KB Output is correct
25 Correct 112 ms 9052 KB Output is correct
26 Correct 104 ms 9048 KB Output is correct
27 Correct 152 ms 101976 KB Output is correct
28 Correct 55 ms 7248 KB Output is correct
29 Correct 75 ms 7508 KB Output is correct
30 Correct 121 ms 101972 KB Output is correct
31 Correct 82 ms 17240 KB Output is correct
32 Correct 144 ms 172500 KB Output is correct
33 Correct 903 ms 112412 KB Output is correct
34 Correct 904 ms 112548 KB Output is correct
35 Correct 892 ms 112456 KB Output is correct
36 Correct 882 ms 112464 KB Output is correct
37 Correct 2368 ms 125944 KB Output is correct
38 Correct 2274 ms 135508 KB Output is correct
39 Correct 2343 ms 159572 KB Output is correct
40 Correct 2072 ms 251476 KB Output is correct
41 Correct 937 ms 102844 KB Output is correct
42 Correct 1006 ms 102204 KB Output is correct
43 Correct 1764 ms 104308 KB Output is correct
44 Correct 2125 ms 208160 KB Output is correct
45 Correct 945 ms 151476 KB Output is correct
46 Correct 971 ms 151432 KB Output is correct
47 Correct 1801 ms 106344 KB Output is correct
48 Correct 1963 ms 207008 KB Output is correct
49 Correct 41 ms 96336 KB Output is correct
50 Correct 42 ms 95924 KB Output is correct
51 Correct 6 ms 1976 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 41 ms 96180 KB Output is correct
54 Correct 64 ms 166576 KB Output is correct
55 Correct 57 ms 143084 KB Output is correct
56 Correct 7 ms 2232 KB Output is correct
57 Correct 42 ms 96172 KB Output is correct
58 Correct 53 ms 157472 KB Output is correct
59 Correct 14 ms 27572 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Execution timed out 5092 ms 790952 KB Time limit exceeded
62 Halted 0 ms 0 KB -