oj.uz

Submission #956963

# Submission time Handle Problem Language Result Execution time Memory
956963 2024-04-02T18:09:00 Z Macker Rectangles (IOI19_rect) C++17
49 / 100
 2061 ms 482816 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++)

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

struct node{
	int on = 0, mxx, mnx, mxy, mny;
};

node st[2503][2503];
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;
	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 60 ms 122964 KB Output is correct
2 Correct 19 ms 123476 KB Output is correct
3 Correct 129 ms 287332 KB Output is correct
4 Correct 22 ms 123284 KB Output is correct
5 Correct 19 ms 122976 KB Output is correct
6 Correct 50 ms 216780 KB Output is correct
7 Correct 47 ms 216664 KB Output is correct
8 Correct 47 ms 216544 KB Output is correct
9 Correct 17 ms 122972 KB Output is correct
10 Correct 17 ms 122972 KB Output is correct
11 Correct 17 ms 122972 KB Output is correct
12 Correct 49 ms 216924 KB Output is correct
13 Correct 17 ms 122972 KB Output is correct
14 Correct 16 ms 123072 KB Output is correct
15 Correct 16 ms 122972 KB Output is correct
16 Correct 16 ms 122972 KB Output is correct
17 Correct 16 ms 122884 KB Output is correct
18 Correct 16 ms 122972 KB Output is correct
19 Correct 17 ms 123168 KB Output is correct
20 Correct 17 ms 122972 KB Output is correct
21 Correct 18 ms 123012 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 122964 KB Output is correct
2 Correct 19 ms 123476 KB Output is correct
3 Correct 129 ms 287332 KB Output is correct
4 Correct 22 ms 123284 KB Output is correct
5 Correct 19 ms 122976 KB Output is correct
6 Correct 50 ms 216780 KB Output is correct
7 Correct 47 ms 216664 KB Output is correct
8 Correct 47 ms 216544 KB Output is correct
9 Correct 17 ms 122972 KB Output is correct
10 Correct 17 ms 122972 KB Output is correct
11 Correct 17 ms 122972 KB Output is correct
12 Correct 49 ms 216924 KB Output is correct
13 Correct 17 ms 122972 KB Output is correct
14 Correct 16 ms 123072 KB Output is correct
15 Correct 16 ms 122972 KB Output is correct
16 Correct 16 ms 122972 KB Output is correct
17 Correct 16 ms 122884 KB Output is correct
18 Correct 16 ms 122972 KB Output is correct
19 Correct 17 ms 123168 KB Output is correct
20 Correct 17 ms 122972 KB Output is correct
21 Correct 18 ms 123012 KB Output is correct
22 Correct 27 ms 123364 KB Output is correct
23 Correct 98 ms 287492 KB Output is correct
24 Correct 29 ms 124320 KB Output is correct
25 Correct 26 ms 123224 KB Output is correct
26 Correct 24 ms 123228 KB Output is correct
27 Correct 26 ms 126120 KB Output is correct
28 Correct 24 ms 123224 KB Output is correct
29 Correct 52 ms 216912 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 122964 KB Output is correct
2 Correct 19 ms 123476 KB Output is correct
3 Correct 129 ms 287332 KB Output is correct
4 Correct 22 ms 123284 KB Output is correct
5 Correct 19 ms 122976 KB Output is correct
6 Correct 50 ms 216780 KB Output is correct
7 Correct 47 ms 216664 KB Output is correct
8 Correct 47 ms 216544 KB Output is correct
9 Correct 17 ms 122972 KB Output is correct
10 Correct 17 ms 122972 KB Output is correct
11 Correct 17 ms 122972 KB Output is correct
12 Correct 49 ms 216924 KB Output is correct
13 Correct 17 ms 122972 KB Output is correct
14 Correct 16 ms 123072 KB Output is correct
15 Correct 16 ms 122972 KB Output is correct
16 Correct 16 ms 122972 KB Output is correct
17 Correct 27 ms 123364 KB Output is correct
18 Correct 98 ms 287492 KB Output is correct
19 Correct 29 ms 124320 KB Output is correct
20 Correct 26 ms 123224 KB Output is correct
21 Correct 24 ms 123228 KB Output is correct
22 Correct 26 ms 126120 KB Output is correct
23 Correct 24 ms 123224 KB Output is correct
24 Correct 52 ms 216912 KB Output is correct
25 Correct 16 ms 122884 KB Output is correct
26 Correct 16 ms 122972 KB Output is correct
27 Correct 17 ms 123168 KB Output is correct
28 Correct 17 ms 122972 KB Output is correct
29 Correct 18 ms 123012 KB Output is correct
30 Correct 114 ms 126320 KB Output is correct
31 Correct 111 ms 126300 KB Output is correct
32 Correct 151 ms 219220 KB Output is correct
33 Correct 63 ms 124616 KB Output is correct
34 Correct 76 ms 124508 KB Output is correct
35 Correct 137 ms 219220 KB Output is correct
36 Correct 87 ms 134604 KB Output is correct
37 Correct 164 ms 289620 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 122964 KB Output is correct
2 Correct 19 ms 123476 KB Output is correct
3 Correct 129 ms 287332 KB Output is correct
4 Correct 22 ms 123284 KB Output is correct
5 Correct 19 ms 122976 KB Output is correct
6 Correct 50 ms 216780 KB Output is correct
7 Correct 47 ms 216664 KB Output is correct
8 Correct 47 ms 216544 KB Output is correct
9 Correct 17 ms 122972 KB Output is correct
10 Correct 17 ms 122972 KB Output is correct
11 Correct 17 ms 122972 KB Output is correct
12 Correct 49 ms 216924 KB Output is correct
13 Correct 17 ms 122972 KB Output is correct
14 Correct 16 ms 123072 KB Output is correct
15 Correct 16 ms 122972 KB Output is correct
16 Correct 16 ms 122972 KB Output is correct
17 Correct 27 ms 123364 KB Output is correct
18 Correct 98 ms 287492 KB Output is correct
19 Correct 29 ms 124320 KB Output is correct
20 Correct 26 ms 123224 KB Output is correct
21 Correct 24 ms 123228 KB Output is correct
22 Correct 26 ms 126120 KB Output is correct
23 Correct 24 ms 123224 KB Output is correct
24 Correct 52 ms 216912 KB Output is correct
25 Correct 114 ms 126320 KB Output is correct
26 Correct 111 ms 126300 KB Output is correct
27 Correct 151 ms 219220 KB Output is correct
28 Correct 63 ms 124616 KB Output is correct
29 Correct 76 ms 124508 KB Output is correct
30 Correct 137 ms 219220 KB Output is correct
31 Correct 87 ms 134604 KB Output is correct
32 Correct 164 ms 289620 KB Output is correct
33 Correct 16 ms 122884 KB Output is correct
34 Correct 16 ms 122972 KB Output is correct
35 Correct 17 ms 123168 KB Output is correct
36 Correct 17 ms 122972 KB Output is correct
37 Correct 18 ms 123012 KB Output is correct
38 Correct 718 ms 149840 KB Output is correct
39 Correct 741 ms 149844 KB Output is correct
40 Correct 720 ms 149844 KB Output is correct
41 Correct 713 ms 149916 KB Output is correct
42 Correct 2017 ms 163160 KB Output is correct
43 Correct 1963 ms 172588 KB Output is correct
44 Correct 2061 ms 196452 KB Output is correct
45 Correct 1834 ms 288356 KB Output is correct
46 Correct 775 ms 142280 KB Output is correct
47 Correct 830 ms 143400 KB Output is correct
48 Correct 1472 ms 143252 KB Output is correct
49 Correct 1866 ms 244924 KB Output is correct
50 Correct 815 ms 231084 KB Output is correct
51 Correct 799 ms 230988 KB Output is correct
52 Correct 1479 ms 144212 KB Output is correct
53 Correct 1720 ms 243468 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 217176 KB Output is correct
2 Correct 52 ms 217264 KB Output is correct
3 Correct 22 ms 123472 KB Output is correct
4 Correct 17 ms 122968 KB Output is correct
5 Incorrect 55 ms 217396 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 122884 KB Output is correct
2 Correct 16 ms 122972 KB Output is correct
3 Correct 17 ms 123168 KB Output is correct
4 Correct 17 ms 122972 KB Output is correct
5 Correct 18 ms 123012 KB Output is correct
6 Correct 16 ms 122968 KB Output is correct
7 Runtime error 1526 ms 482816 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 122964 KB Output is correct
2 Correct 19 ms 123476 KB Output is correct
3 Correct 129 ms 287332 KB Output is correct
4 Correct 22 ms 123284 KB Output is correct
5 Correct 19 ms 122976 KB Output is correct
6 Correct 50 ms 216780 KB Output is correct
7 Correct 47 ms 216664 KB Output is correct
8 Correct 47 ms 216544 KB Output is correct
9 Correct 17 ms 122972 KB Output is correct
10 Correct 17 ms 122972 KB Output is correct
11 Correct 17 ms 122972 KB Output is correct
12 Correct 49 ms 216924 KB Output is correct
13 Correct 17 ms 122972 KB Output is correct
14 Correct 16 ms 123072 KB Output is correct
15 Correct 16 ms 122972 KB Output is correct
16 Correct 16 ms 122972 KB Output is correct
17 Correct 27 ms 123364 KB Output is correct
18 Correct 98 ms 287492 KB Output is correct
19 Correct 29 ms 124320 KB Output is correct
20 Correct 26 ms 123224 KB Output is correct
21 Correct 24 ms 123228 KB Output is correct
22 Correct 26 ms 126120 KB Output is correct
23 Correct 24 ms 123224 KB Output is correct
24 Correct 52 ms 216912 KB Output is correct
25 Correct 114 ms 126320 KB Output is correct
26 Correct 111 ms 126300 KB Output is correct
27 Correct 151 ms 219220 KB Output is correct
28 Correct 63 ms 124616 KB Output is correct
29 Correct 76 ms 124508 KB Output is correct
30 Correct 137 ms 219220 KB Output is correct
31 Correct 87 ms 134604 KB Output is correct
32 Correct 164 ms 289620 KB Output is correct
33 Correct 718 ms 149840 KB Output is correct
34 Correct 741 ms 149844 KB Output is correct
35 Correct 720 ms 149844 KB Output is correct
36 Correct 713 ms 149916 KB Output is correct
37 Correct 2017 ms 163160 KB Output is correct
38 Correct 1963 ms 172588 KB Output is correct
39 Correct 2061 ms 196452 KB Output is correct
40 Correct 1834 ms 288356 KB Output is correct
41 Correct 775 ms 142280 KB Output is correct
42 Correct 830 ms 143400 KB Output is correct
43 Correct 1472 ms 143252 KB Output is correct
44 Correct 1866 ms 244924 KB Output is correct
45 Correct 815 ms 231084 KB Output is correct
46 Correct 799 ms 230988 KB Output is correct
47 Correct 1479 ms 144212 KB Output is correct
48 Correct 1720 ms 243468 KB Output is correct
49 Correct 55 ms 217176 KB Output is correct
50 Correct 52 ms 217264 KB Output is correct
51 Correct 22 ms 123472 KB Output is correct
52 Correct 17 ms 122968 KB Output is correct
53 Incorrect 55 ms 217396 KB Output isn't correct
54 Halted 0 ms 0 KB -