oj.uz

Submission #959270

# Submission time Handle Problem Language Result Execution time Memory
959270 2024-04-07T19:09:21 Z qin Rectangles (IOI19_rect) C++17
100 / 100
 1457 ms 356372 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ssize(x) int(x.size())
#define pn printf("\n")
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vv vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int inf = 2e09; ll infll = 2e18; int mod = 119<<23|1; // PAMIETAC, ZE TAM MAM CIAG INDEKSOWANY OD 0
struct segminmax{
		int base;
		struct Node{
				int mn, mx;
				Node(){ mn = inf, mx = 0; }
		};
		vv<Node> t;
		void init(int n, vv<int> &a, vv<int> &b){
				base = 1;
				while(base < n) base <<= 1;
				t.resize(base<<1, Node());
				for(int i = 1; i <= n; ++i) t[i+base-1].mn = b[i-1], t[i+base-1].mx = a[i-1];
				for(int i = base-1; i; --i) t[i].mn = min(t[i<<1].mn, t[i<<1|1].mn), t[i].mx = max(t[i<<1].mx, t[i<<1|1].mx);
		}
		pii query_interval(int l, int r){
				pii res = pii(inf, 0);
				for(l += base-1, r += base; l < r; l >>= 1, r >>= 1){
						if(l & 1) res.fi = min(res.fi, t[l].mn), res.se = max(res.se, t[l].mx), ++l;
						if(r & 1) --r, res.fi = min(res.fi, t[r].mn), res.se = max(res.se, t[r].mx);
				}
				return res;
		}
		pii query(int l, int r){
				if(l <= r) return query_interval(max(1, l), min(base, r));
				return pii(inf, 0);
		}
};
struct seg{
		int base;
		vv<int> t;
		void init(int n){
				base = 1;
				while(base < n) base <<= 1;
				t.resize(base<<1, 0);
		}
		void update(int i, int val){
				for(i += base-1, t[i] = val, i >>= 1; i; i >>= 1) t[i] = t[i<<1]+t[i<<1|1];
		}
		int query_interval(int l, int r){
				int res = 0;
				for(l += base-1, r += base; l < r; l >>= 1, r >>= 1){
						if(l & 1) res += t[l++];
						if(r & 1) res += t[--r];
				}
				return res;
		}
		int query(int l, int r){
				if(l <= r) return query_interval(max(1, l), min(base, r));
				return 0;
		}
};
ll count_rectangles(vv<vv<int>> t){
		int n = ssize(t), m = ssize(t[0]);
		vv<vv<int>> u(n, vv<int>(m, 0)), d(n, vv<int>(m, n-1)), l(n, vv<int>(m, inf)), r(n, vv<int>(m, -1));
		vv<int> st;
		for(int i = 0; i < n; ++i){ 
				for(int j = 0; j < m; ++j){ // przedzialy gdzie ja to prawy koniec
						while(ssize(st) && t[i][st.back()] < t[i][j]) st.pop_back();
						if(ssize(st)) r[i][j] = st.back();
						st.emplace_back(j);
				} st = vv<int>();
				for(int j = m-1; ~j; --j){  // przedzialy gdzie ja to lewy koniec
						while(ssize(st) && t[i][st.back()] < t[i][j]) st.pop_back();
						if(ssize(st)) l[i][j] = st.back();
						st.emplace_back(j);
				} st = vv<int>();
		}
		for(int j = 0; j < m; ++j){ 
				for(int i = 0; i < n; ++i){ // przedzialy gdzie ja to dolny koniec (ustawiamy najblizszego do gory)
						while(ssize(st) && t[st.back()][j] < t[i][j]) st.pop_back();
						if(ssize(st)) u[i][j] = st.back();
						st.emplace_back(i);
				} st = vv<int>();
				for(int i = n-1; ~i; --i){ // przedzialy gdzie ja to gorny koniec (ustawiamy najblizszego na dole)
						while(ssize(st) && t[st.back()][j] < t[i][j]) st.pop_back();
						if(ssize(st)) d[i][j] = st.back();
						st.emplace_back(i);
				} st = vv<int>();
		}
		//~ for(int i = 0; i < n; ++i){
				//~ for(int j = 0; j < m; ++j) printf("%d ", d[i][j]);
				//~ pn;
		//~ }
		ll result = 0;
		vv<segminmax> segm(n);
		vv<vv<int>> rem(n+1);
		seg seg; seg.init(n);
		vv<pii> queries(n+2);
		for(int i = 0; i < n; ++i) segm[i].init(m, u[i], d[i]);
		vv<pii> mp;
		for(int i = 1; i < n-1; ++i){
				mp = vv<pii>();
				for(int j = 0; j < m; ++j) if(l[i][j] != inf) mp.emplace_back(j, l[i][j]);
				for(int j = 0; j < m; ++j) if(r[i][j] != -1 && l[i][r[i][j]] != j) mp.emplace_back(r[i][j], j);
				for(pii pd : mp){
						int L = pd.fi+1, R = pd.se-1;
						if(R < L) continue;
						++L, ++R; // do przedzialowca
						int sz = 1;
						for(int j = i+1; j < n-1; ++j){
								if(l[j][pd.fi] == pd.se || r[j][pd.se] == pd.fi){
										++sz;
										if(l[j][pd.fi] == pd.se) l[j][pd.fi] = inf;
										if(r[j][pd.se] == pd.fi) r[j][pd.se] = -1;
								}
								else break;
						}
						//~ queries.resize(sz+2);
						for(int j = i-1; j <= i+sz; ++j) queries[j-(i-1)] = segm[j].query(L, R);
						for(int j = i; j < i+sz; ++j){
								//~ printf("%d %d %d: %lld\n", j, l-1, r-1, result);
								for(int &x : rem[j-i]) seg.update(x, 0);
								rem[j-i].clear();
								int endpoint = queries[j-1-i+1].fi;
								if(j < endpoint){
										seg.update(j-i+1, 1);
										rem[min(sz, endpoint-i)].emplace_back(j-i+1);
								}
								endpoint = queries[j+1-i+1].se;//segm[j+1].query_max(l, r);
								result += seg.query(max(-1, endpoint-i)+2, j-i+1);
								//~ printf("%d %d %d: %d %lld\n", j, l-1, r-1, endpoint, result);
						}
						for(int &x : rem[sz]) seg.update(x, 0);
						rem[sz].clear();//, queries.clear();
				}
		}
		return result;
}
#ifdef LOCAL
int main(){
		int T = 1;
		for(++T; --T; ){
				int n, m; scanf("%d%d", &n, &m);
				vv<vv<int>> t(n, vv<int>(m, 0));
				for(int i = 0; i < n; ++i)
						for(int j = 0; j < m; ++j) scanf("%d", &t[i][j]);
				ll result = count_rectangles(t);
				printf("%lld\n", result);
		}
		return 0;
}
#endif

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 696 KB Output is correct
29 Correct 1 ms 604 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 1 ms 696 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 5 ms 2392 KB Output is correct
31 Correct 5 ms 2396 KB Output is correct
32 Correct 5 ms 2396 KB Output is correct
33 Correct 5 ms 2140 KB Output is correct
34 Correct 7 ms 2336 KB Output is correct
35 Correct 8 ms 2548 KB Output is correct
36 Correct 7 ms 2396 KB Output is correct
37 Correct 7 ms 2396 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 1 ms 696 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 5 ms 2392 KB Output is correct
26 Correct 5 ms 2396 KB Output is correct
27 Correct 5 ms 2396 KB Output is correct
28 Correct 5 ms 2140 KB Output is correct
29 Correct 7 ms 2336 KB Output is correct
30 Correct 8 ms 2548 KB Output is correct
31 Correct 7 ms 2396 KB Output is correct
32 Correct 7 ms 2396 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 65 ms 26404 KB Output is correct
39 Correct 68 ms 26452 KB Output is correct
40 Correct 73 ms 26448 KB Output is correct
41 Correct 73 ms 26488 KB Output is correct
42 Correct 78 ms 26408 KB Output is correct
43 Correct 75 ms 26892 KB Output is correct
44 Correct 80 ms 26940 KB Output is correct
45 Correct 76 ms 25168 KB Output is correct
46 Correct 43 ms 24144 KB Output is correct
47 Correct 52 ms 24144 KB Output is correct
48 Correct 86 ms 25132 KB Output is correct
49 Correct 91 ms 26960 KB Output is correct
50 Correct 45 ms 13744 KB Output is correct
51 Correct 46 ms 13648 KB Output is correct
52 Correct 79 ms 26164 KB Output is correct
53 Correct 83 ms 26960 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 1056 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 780 KB Output is correct
6 Correct 2 ms 960 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 313 ms 152640 KB Output is correct
8 Correct 714 ms 318656 KB Output is correct
9 Correct 714 ms 320572 KB Output is correct
10 Correct 673 ms 320496 KB Output is correct
11 Correct 232 ms 158308 KB Output is correct
12 Correct 497 ms 310708 KB Output is correct
13 Correct 524 ms 320520 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 1 ms 696 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 5 ms 2392 KB Output is correct
26 Correct 5 ms 2396 KB Output is correct
27 Correct 5 ms 2396 KB Output is correct
28 Correct 5 ms 2140 KB Output is correct
29 Correct 7 ms 2336 KB Output is correct
30 Correct 8 ms 2548 KB Output is correct
31 Correct 7 ms 2396 KB Output is correct
32 Correct 7 ms 2396 KB Output is correct
33 Correct 65 ms 26404 KB Output is correct
34 Correct 68 ms 26452 KB Output is correct
35 Correct 73 ms 26448 KB Output is correct
36 Correct 73 ms 26488 KB Output is correct
37 Correct 78 ms 26408 KB Output is correct
38 Correct 75 ms 26892 KB Output is correct
39 Correct 80 ms 26940 KB Output is correct
40 Correct 76 ms 25168 KB Output is correct
41 Correct 43 ms 24144 KB Output is correct
42 Correct 52 ms 24144 KB Output is correct
43 Correct 86 ms 25132 KB Output is correct
44 Correct 91 ms 26960 KB Output is correct
45 Correct 45 ms 13744 KB Output is correct
46 Correct 46 ms 13648 KB Output is correct
47 Correct 79 ms 26164 KB Output is correct
48 Correct 83 ms 26960 KB Output is correct
49 Correct 2 ms 860 KB Output is correct
50 Correct 1 ms 860 KB Output is correct
51 Correct 1 ms 1056 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 2 ms 780 KB Output is correct
54 Correct 2 ms 960 KB Output is correct
55 Correct 1 ms 856 KB Output is correct
56 Correct 2 ms 856 KB Output is correct
57 Correct 1 ms 860 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 604 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 313 ms 152640 KB Output is correct
62 Correct 714 ms 318656 KB Output is correct
63 Correct 714 ms 320572 KB Output is correct
64 Correct 673 ms 320496 KB Output is correct
65 Correct 232 ms 158308 KB Output is correct
66 Correct 497 ms 310708 KB Output is correct
67 Correct 524 ms 320520 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 1034 ms 354968 KB Output is correct
74 Correct 1112 ms 355380 KB Output is correct
75 Correct 1154 ms 355180 KB Output is correct
76 Correct 1205 ms 354976 KB Output is correct
77 Correct 1431 ms 356372 KB Output is correct
78 Correct 679 ms 198920 KB Output is correct
79 Correct 732 ms 196060 KB Output is correct
80 Correct 1134 ms 331072 KB Output is correct
81 Correct 746 ms 213840 KB Output is correct
82 Correct 961 ms 237236 KB Output is correct
83 Correct 1282 ms 356256 KB Output is correct
84 Correct 663 ms 206660 KB Output is correct
85 Correct 1209 ms 356076 KB Output is correct
86 Correct 1140 ms 346988 KB Output is correct
87 Correct 814 ms 198256 KB Output is correct
88 Correct 1441 ms 355936 KB Output is correct
89 Correct 1439 ms 356304 KB Output is correct
90 Correct 1457 ms 356272 KB Output is correct